./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-20.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-20.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 e22f36fcb48e37029a5451272d2b65f2136f0249698c819249f45360edf16ac5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:14:00,850 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:14:00,907 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 03:14:00,912 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:14:00,913 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:14:00,934 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:14:00,935 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:14:00,935 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:14:00,935 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:14:00,935 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:14:00,936 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:14:00,936 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:14:00,936 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:14:00,936 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:14:00,937 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:14:00,937 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:14:00,937 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:14:00,937 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:14:00,937 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 03:14:00,937 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:14:00,938 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:14:00,938 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:14:00,938 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:14:00,938 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:14:00,938 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:14:00,938 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:14:00,938 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:14:00,938 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:14:00,938 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:14:00,938 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:14:00,939 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:14:00,939 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:14:00,939 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:14:00,939 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:14:00,939 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:14:00,939 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:14:00,939 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:14:00,939 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 03:14:00,939 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 03:14:00,939 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:14:00,939 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:14:00,939 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:14:00,940 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:14:00,940 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 -> e22f36fcb48e37029a5451272d2b65f2136f0249698c819249f45360edf16ac5 [2025-03-17 03:14:01,169 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:14:01,177 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:14:01,179 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:14:01,181 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:14:01,181 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:14:01,182 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-20.i [2025-03-17 03:14:02,360 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f62b59e76/2c09a32f804440489b6e97dfe46d9afc/FLAG04d936014 [2025-03-17 03:14:02,620 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:14:02,621 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-20.i [2025-03-17 03:14:02,630 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f62b59e76/2c09a32f804440489b6e97dfe46d9afc/FLAG04d936014 [2025-03-17 03:14:02,646 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f62b59e76/2c09a32f804440489b6e97dfe46d9afc [2025-03-17 03:14:02,648 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:14:02,651 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:14:02,652 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:14:02,652 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:14:02,657 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:14:02,659 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:14:02" (1/1) ... [2025-03-17 03:14:02,660 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e35d77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:14:02, skipping insertion in model container [2025-03-17 03:14:02,661 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:14:02" (1/1) ... [2025-03-17 03:14:02,685 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:14:02,786 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-20.i[916,929] [2025-03-17 03:14:02,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:14:02,851 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:14:02,857 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-20.i[916,929] [2025-03-17 03:14:02,893 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:14:02,905 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:14:02,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:14:02 WrapperNode [2025-03-17 03:14:02,906 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:14:02,906 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:14:02,907 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:14:02,907 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:14:02,911 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:14:02" (1/1) ... [2025-03-17 03:14:02,920 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:14:02" (1/1) ... [2025-03-17 03:14:02,966 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 258 [2025-03-17 03:14:02,966 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:14:02,967 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:14:02,967 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:14:02,967 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:14:02,973 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:14:02" (1/1) ... [2025-03-17 03:14:02,974 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:14:02" (1/1) ... [2025-03-17 03:14:02,977 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:14:02" (1/1) ... [2025-03-17 03:14:02,997 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-17 03:14:02,997 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:14:02" (1/1) ... [2025-03-17 03:14:02,997 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:14:02" (1/1) ... [2025-03-17 03:14:03,005 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:14:02" (1/1) ... [2025-03-17 03:14:03,008 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:14:02" (1/1) ... [2025-03-17 03:14:03,013 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:14:02" (1/1) ... [2025-03-17 03:14:03,014 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:14:02" (1/1) ... [2025-03-17 03:14:03,021 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:14:03,022 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:14:03,023 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:14:03,023 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:14:03,024 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:14:02" (1/1) ... [2025-03-17 03:14:03,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:14:03,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:14:03,048 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-17 03:14:03,052 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-17 03:14:03,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:14:03,067 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:14:03,067 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:14:03,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 03:14:03,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:14:03,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:14:03,136 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:14:03,138 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:14:03,518 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L199: havoc property_#t~bitwise23#1;havoc property_#t~short24#1;havoc property_#t~ite27#1;havoc property_#t~ite26#1;havoc property_#t~bitwise25#1;havoc property_#t~short28#1; [2025-03-17 03:14:03,559 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2025-03-17 03:14:03,559 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:14:03,577 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:14:03,577 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-17 03:14:03,579 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:14:03 BoogieIcfgContainer [2025-03-17 03:14:03,579 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:14:03,581 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:14:03,581 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:14:03,584 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:14:03,584 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:14:02" (1/3) ... [2025-03-17 03:14:03,585 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a8cd0d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:14:03, skipping insertion in model container [2025-03-17 03:14:03,585 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:14:02" (2/3) ... [2025-03-17 03:14:03,585 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a8cd0d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:14:03, skipping insertion in model container [2025-03-17 03:14:03,586 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:14:03" (3/3) ... [2025-03-17 03:14:03,587 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-20.i [2025-03-17 03:14:03,597 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:14:03,598 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-20.i that has 2 procedures, 111 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:14:03,667 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:14:03,676 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;@1716ca13, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:14:03,677 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:14:03,680 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 78 states have internal predecessors, (112), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-17 03:14:03,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-03-17 03:14:03,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:14:03,691 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:14:03,693 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:14:03,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:14:03,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1324003311, now seen corresponding path program 1 times [2025-03-17 03:14:03,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:14:03,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298679763] [2025-03-17 03:14:03,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:14:03,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:14:03,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-17 03:14:03,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-17 03:14:03,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:14:03,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:14:03,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-03-17 03:14:03,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:14:03,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298679763] [2025-03-17 03:14:03,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298679763] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:14:03,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090573780] [2025-03-17 03:14:03,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:14:03,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:14:03,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:14:03,995 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-17 03:14:03,996 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-17 03:14:04,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-17 03:14:04,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-17 03:14:04,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:14:04,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:14:04,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:14:04,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:14:04,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-03-17 03:14:04,180 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:14:04,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090573780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:14:04,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:14:04,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 03:14:04,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44678570] [2025-03-17 03:14:04,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:14:04,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:14:04,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:14:04,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:14:04,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:14:04,202 INFO L87 Difference]: Start difference. First operand has 111 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 78 states have internal predecessors, (112), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-17 03:14:04,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:14:04,233 INFO L93 Difference]: Finished difference Result 219 states and 377 transitions. [2025-03-17 03:14:04,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:14:04,235 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 201 [2025-03-17 03:14:04,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:14:04,239 INFO L225 Difference]: With dead ends: 219 [2025-03-17 03:14:04,239 INFO L226 Difference]: Without dead ends: 109 [2025-03-17 03:14:04,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 202 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-17 03:14:04,243 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:14:04,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 166 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:14:04,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-17 03:14:04,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-03-17 03:14:04,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 76 states have internal predecessors, (108), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-17 03:14:04,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 170 transitions. [2025-03-17 03:14:04,283 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 170 transitions. Word has length 201 [2025-03-17 03:14:04,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:14:04,284 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 170 transitions. [2025-03-17 03:14:04,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-17 03:14:04,284 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 170 transitions. [2025-03-17 03:14:04,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-03-17 03:14:04,289 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:14:04,289 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:14:04,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 03:14:04,490 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-17 03:14:04,490 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:14:04,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:14:04,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1643246222, now seen corresponding path program 1 times [2025-03-17 03:14:04,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:14:04,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411026452] [2025-03-17 03:14:04,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:14:04,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:14:04,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-17 03:14:04,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-17 03:14:04,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:14:04,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:14:04,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 03:14:04,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:14:04,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411026452] [2025-03-17 03:14:04,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411026452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:14:04,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:14:04,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 03:14:04,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116993305] [2025-03-17 03:14:04,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:14:04,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 03:14:04,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:14:04,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 03:14:04,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 03:14:04,944 INFO L87 Difference]: Start difference. First operand 109 states and 170 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:14:05,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:14:05,179 INFO L93 Difference]: Finished difference Result 359 states and 560 transitions. [2025-03-17 03:14:05,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 03:14:05,179 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 201 [2025-03-17 03:14:05,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:14:05,183 INFO L225 Difference]: With dead ends: 359 [2025-03-17 03:14:05,184 INFO L226 Difference]: Without dead ends: 251 [2025-03-17 03:14:05,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:14:05,187 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 165 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:14:05,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 509 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 03:14:05,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-03-17 03:14:05,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 240. [2025-03-17 03:14:05,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 175 states have (on average 1.4114285714285715) internal successors, (247), 175 states have internal predecessors, (247), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-17 03:14:05,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 371 transitions. [2025-03-17 03:14:05,218 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 371 transitions. Word has length 201 [2025-03-17 03:14:05,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:14:05,220 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 371 transitions. [2025-03-17 03:14:05,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:14:05,220 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 371 transitions. [2025-03-17 03:14:05,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-17 03:14:05,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:14:05,225 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:14:05,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 03:14:05,225 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:14:05,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:14:05,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1347895977, now seen corresponding path program 1 times [2025-03-17 03:14:05,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:14:05,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915186573] [2025-03-17 03:14:05,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:14:05,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:14:05,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-17 03:14:05,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-17 03:14:05,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:14:05,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:14:05,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 03:14:05,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:14:05,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915186573] [2025-03-17 03:14:05,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915186573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:14:05,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:14:05,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 03:14:05,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834926981] [2025-03-17 03:14:05,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:14:05,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 03:14:05,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:14:05,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 03:14:05,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 03:14:05,666 INFO L87 Difference]: Start difference. First operand 240 states and 371 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:14:05,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:14:05,886 INFO L93 Difference]: Finished difference Result 701 states and 1082 transitions. [2025-03-17 03:14:05,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 03:14:05,886 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 202 [2025-03-17 03:14:05,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:14:05,891 INFO L225 Difference]: With dead ends: 701 [2025-03-17 03:14:05,893 INFO L226 Difference]: Without dead ends: 462 [2025-03-17 03:14:05,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:14:05,895 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 141 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:14:05,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 629 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 03:14:05,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2025-03-17 03:14:05,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 315. [2025-03-17 03:14:05,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 250 states have (on average 1.456) internal successors, (364), 250 states have internal predecessors, (364), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-17 03:14:05,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 488 transitions. [2025-03-17 03:14:05,955 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 488 transitions. Word has length 202 [2025-03-17 03:14:05,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:14:05,955 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 488 transitions. [2025-03-17 03:14:05,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:14:05,955 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 488 transitions. [2025-03-17 03:14:05,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-17 03:14:05,957 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:14:05,957 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:14:05,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 03:14:05,958 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:14:05,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:14:05,958 INFO L85 PathProgramCache]: Analyzing trace with hash 697887700, now seen corresponding path program 1 times [2025-03-17 03:14:05,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:14:05,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861188771] [2025-03-17 03:14:05,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:14:05,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:14:05,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-17 03:14:06,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-17 03:14:06,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:14:06,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:14:06,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 03:14:06,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:14:06,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861188771] [2025-03-17 03:14:06,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861188771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:14:06,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:14:06,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 03:14:06,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551870671] [2025-03-17 03:14:06,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:14:06,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 03:14:06,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:14:06,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 03:14:06,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 03:14:06,304 INFO L87 Difference]: Start difference. First operand 315 states and 488 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:14:06,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:14:06,833 INFO L93 Difference]: Finished difference Result 920 states and 1408 transitions. [2025-03-17 03:14:06,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 03:14:06,834 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 203 [2025-03-17 03:14:06,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:14:06,837 INFO L225 Difference]: With dead ends: 920 [2025-03-17 03:14:06,837 INFO L226 Difference]: Without dead ends: 606 [2025-03-17 03:14:06,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 03:14:06,838 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 237 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 03:14:06,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 644 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 03:14:06,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2025-03-17 03:14:06,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 455. [2025-03-17 03:14:06,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 376 states have (on average 1.4414893617021276) internal successors, (542), 378 states have internal predecessors, (542), 74 states have call successors, (74), 4 states have call predecessors, (74), 4 states have return successors, (74), 72 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-17 03:14:06,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 690 transitions. [2025-03-17 03:14:06,880 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 690 transitions. Word has length 203 [2025-03-17 03:14:06,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:14:06,881 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 690 transitions. [2025-03-17 03:14:06,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:14:06,882 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 690 transitions. [2025-03-17 03:14:06,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-17 03:14:06,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:14:06,884 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:14:06,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 03:14:06,884 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:14:06,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:14:06,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1942652181, now seen corresponding path program 1 times [2025-03-17 03:14:06,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:14:06,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148780123] [2025-03-17 03:14:06,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:14:06,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:14:06,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-17 03:14:07,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-17 03:14:07,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:14:07,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:14:09,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 03:14:09,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:14:09,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148780123] [2025-03-17 03:14:09,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148780123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:14:09,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:14:09,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 03:14:09,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538010183] [2025-03-17 03:14:09,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:14:09,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 03:14:09,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:14:09,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 03:14:09,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-03-17 03:14:09,214 INFO L87 Difference]: Start difference. First operand 455 states and 690 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:14:10,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:14:10,054 INFO L93 Difference]: Finished difference Result 1379 states and 2065 transitions. [2025-03-17 03:14:10,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 03:14:10,055 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 203 [2025-03-17 03:14:10,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:14:10,061 INFO L225 Difference]: With dead ends: 1379 [2025-03-17 03:14:10,062 INFO L226 Difference]: Without dead ends: 925 [2025-03-17 03:14:10,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2025-03-17 03:14:10,064 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 257 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 03:14:10,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 672 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 03:14:10,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2025-03-17 03:14:10,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 588. [2025-03-17 03:14:10,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 509 states have (on average 1.4734774066797642) internal successors, (750), 511 states have internal predecessors, (750), 74 states have call successors, (74), 4 states have call predecessors, (74), 4 states have return successors, (74), 72 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-17 03:14:10,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 898 transitions. [2025-03-17 03:14:10,105 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 898 transitions. Word has length 203 [2025-03-17 03:14:10,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:14:10,105 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 898 transitions. [2025-03-17 03:14:10,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:14:10,105 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 898 transitions. [2025-03-17 03:14:10,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-17 03:14:10,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:14:10,107 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:14:10,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 03:14:10,107 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:14:10,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:14:10,107 INFO L85 PathProgramCache]: Analyzing trace with hash 945579828, now seen corresponding path program 1 times [2025-03-17 03:14:10,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:14:10,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568604982] [2025-03-17 03:14:10,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:14:10,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:14:10,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-17 03:14:10,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-17 03:14:10,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:14:10,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:14:10,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 03:14:10,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:14:10,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568604982] [2025-03-17 03:14:10,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568604982] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:14:10,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:14:10,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 03:14:10,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587534633] [2025-03-17 03:14:10,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:14:10,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 03:14:10,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:14:10,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 03:14:10,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 03:14:10,215 INFO L87 Difference]: Start difference. First operand 588 states and 898 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:14:10,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:14:10,301 INFO L93 Difference]: Finished difference Result 1412 states and 2157 transitions. [2025-03-17 03:14:10,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 03:14:10,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 203 [2025-03-17 03:14:10,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:14:10,306 INFO L225 Difference]: With dead ends: 1412 [2025-03-17 03:14:10,306 INFO L226 Difference]: Without dead ends: 825 [2025-03-17 03:14:10,308 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-17 03:14:10,309 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 145 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:14:10,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 432 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:14:10,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2025-03-17 03:14:10,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 680. [2025-03-17 03:14:10,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 601 states have (on average 1.464226289517471) internal successors, (880), 603 states have internal predecessors, (880), 74 states have call successors, (74), 4 states have call predecessors, (74), 4 states have return successors, (74), 72 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-17 03:14:10,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 1028 transitions. [2025-03-17 03:14:10,360 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 1028 transitions. Word has length 203 [2025-03-17 03:14:10,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:14:10,361 INFO L471 AbstractCegarLoop]: Abstraction has 680 states and 1028 transitions. [2025-03-17 03:14:10,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:14:10,364 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 1028 transitions. [2025-03-17 03:14:10,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-17 03:14:10,365 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:14:10,366 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:14:10,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 03:14:10,366 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:14:10,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:14:10,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1033250882, now seen corresponding path program 1 times [2025-03-17 03:14:10,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:14:10,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184030194] [2025-03-17 03:14:10,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:14:10,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:14:10,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-17 03:14:10,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-17 03:14:10,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:14:10,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:14:12,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 03:14:12,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:14:12,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184030194] [2025-03-17 03:14:12,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184030194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:14:12,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:14:12,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 03:14:12,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901298138] [2025-03-17 03:14:12,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:14:12,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 03:14:12,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:14:12,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 03:14:12,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-17 03:14:12,331 INFO L87 Difference]: Start difference. First operand 680 states and 1028 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:14:13,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:14:13,983 INFO L93 Difference]: Finished difference Result 1698 states and 2536 transitions. [2025-03-17 03:14:13,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 03:14:13,984 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 203 [2025-03-17 03:14:13,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:14:13,990 INFO L225 Difference]: With dead ends: 1698 [2025-03-17 03:14:13,990 INFO L226 Difference]: Without dead ends: 1019 [2025-03-17 03:14:13,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2025-03-17 03:14:13,992 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 461 mSDsluCounter, 890 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-17 03:14:13,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 1021 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-17 03:14:13,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2025-03-17 03:14:14,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 751. [2025-03-17 03:14:14,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 672 states have (on average 1.4732142857142858) internal successors, (990), 674 states have internal predecessors, (990), 74 states have call successors, (74), 4 states have call predecessors, (74), 4 states have return successors, (74), 72 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-17 03:14:14,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1138 transitions. [2025-03-17 03:14:14,028 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1138 transitions. Word has length 203 [2025-03-17 03:14:14,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:14:14,028 INFO L471 AbstractCegarLoop]: Abstraction has 751 states and 1138 transitions. [2025-03-17 03:14:14,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:14:14,029 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1138 transitions. [2025-03-17 03:14:14,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-17 03:14:14,032 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:14:14,032 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:14:14,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 03:14:14,032 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:14:14,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:14:14,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1754164605, now seen corresponding path program 1 times [2025-03-17 03:14:14,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:14:14,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096302897] [2025-03-17 03:14:14,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:14:14,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:14:14,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-17 03:14:14,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-17 03:14:14,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:14:14,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:14:14,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 03:14:14,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:14:14,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096302897] [2025-03-17 03:14:14,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096302897] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:14:14,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:14:14,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 03:14:14,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033019363] [2025-03-17 03:14:14,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:14:14,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 03:14:14,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:14:14,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 03:14:14,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-17 03:14:14,879 INFO L87 Difference]: Start difference. First operand 751 states and 1138 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:14:15,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:14:15,440 INFO L93 Difference]: Finished difference Result 1856 states and 2793 transitions. [2025-03-17 03:14:15,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 03:14:15,441 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 203 [2025-03-17 03:14:15,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:14:15,446 INFO L225 Difference]: With dead ends: 1856 [2025-03-17 03:14:15,447 INFO L226 Difference]: Without dead ends: 1106 [2025-03-17 03:14:15,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-17 03:14:15,450 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 260 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 03:14:15,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 473 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 03:14:15,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2025-03-17 03:14:15,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 721. [2025-03-17 03:14:15,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 642 states have (on average 1.4672897196261683) internal successors, (942), 644 states have internal predecessors, (942), 74 states have call successors, (74), 4 states have call predecessors, (74), 4 states have return successors, (74), 72 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-17 03:14:15,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 1090 transitions. [2025-03-17 03:14:15,479 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 1090 transitions. Word has length 203 [2025-03-17 03:14:15,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:14:15,480 INFO L471 AbstractCegarLoop]: Abstraction has 721 states and 1090 transitions. [2025-03-17 03:14:15,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:14:15,480 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 1090 transitions. [2025-03-17 03:14:15,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-17 03:14:15,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:14:15,482 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:14:15,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 03:14:15,483 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:14:15,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:14:15,483 INFO L85 PathProgramCache]: Analyzing trace with hash 188779011, now seen corresponding path program 1 times [2025-03-17 03:14:15,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:14:15,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935495512] [2025-03-17 03:14:15,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:14:15,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:14:15,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-17 03:14:15,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-17 03:14:15,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:14:15,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:14:17,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 03:14:17,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:14:17,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935495512] [2025-03-17 03:14:17,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935495512] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:14:17,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:14:17,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 03:14:17,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46380183] [2025-03-17 03:14:17,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:14:17,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 03:14:17,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:14:17,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 03:14:17,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-17 03:14:17,182 INFO L87 Difference]: Start difference. First operand 721 states and 1090 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:14:18,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:14:18,044 INFO L93 Difference]: Finished difference Result 1682 states and 2513 transitions. [2025-03-17 03:14:18,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 03:14:18,044 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 203 [2025-03-17 03:14:18,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:14:18,048 INFO L225 Difference]: With dead ends: 1682 [2025-03-17 03:14:18,048 INFO L226 Difference]: Without dead ends: 962 [2025-03-17 03:14:18,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-03-17 03:14:18,050 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 403 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 03:14:18,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 670 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 03:14:18,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2025-03-17 03:14:18,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 731. [2025-03-17 03:14:18,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 731 states, 652 states have (on average 1.4677914110429449) internal successors, (957), 654 states have internal predecessors, (957), 74 states have call successors, (74), 4 states have call predecessors, (74), 4 states have return successors, (74), 72 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-17 03:14:18,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1105 transitions. [2025-03-17 03:14:18,075 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1105 transitions. Word has length 203 [2025-03-17 03:14:18,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:14:18,075 INFO L471 AbstractCegarLoop]: Abstraction has 731 states and 1105 transitions. [2025-03-17 03:14:18,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:14:18,076 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1105 transitions. [2025-03-17 03:14:18,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-17 03:14:18,077 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:14:18,077 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:14:18,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 03:14:18,078 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:14:18,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:14:18,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1696330820, now seen corresponding path program 1 times [2025-03-17 03:14:18,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:14:18,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197661558] [2025-03-17 03:14:18,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:14:18,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:14:18,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-17 03:14:18,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-17 03:14:18,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:14:18,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:14:18,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 03:14:18,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:14:18,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197661558] [2025-03-17 03:14:18,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197661558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:14:18,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:14:18,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 03:14:18,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523469276] [2025-03-17 03:14:18,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:14:18,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 03:14:18,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:14:18,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 03:14:18,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-17 03:14:18,844 INFO L87 Difference]: Start difference. First operand 731 states and 1105 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:14:19,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:14:19,341 INFO L93 Difference]: Finished difference Result 1583 states and 2371 transitions. [2025-03-17 03:14:19,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 03:14:19,342 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 203 [2025-03-17 03:14:19,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:14:19,345 INFO L225 Difference]: With dead ends: 1583 [2025-03-17 03:14:19,345 INFO L226 Difference]: Without dead ends: 853 [2025-03-17 03:14:19,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-17 03:14:19,347 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 312 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 03:14:19,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 464 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 03:14:19,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2025-03-17 03:14:19,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 704. [2025-03-17 03:14:19,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 625 states have (on average 1.4624) internal successors, (914), 627 states have internal predecessors, (914), 74 states have call successors, (74), 4 states have call predecessors, (74), 4 states have return successors, (74), 72 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-17 03:14:19,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 1062 transitions. [2025-03-17 03:14:19,378 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 1062 transitions. Word has length 203 [2025-03-17 03:14:19,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:14:19,379 INFO L471 AbstractCegarLoop]: Abstraction has 704 states and 1062 transitions. [2025-03-17 03:14:19,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:14:19,379 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 1062 transitions. [2025-03-17 03:14:19,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-17 03:14:19,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:14:19,381 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:14:19,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 03:14:19,381 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:14:19,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:14:19,382 INFO L85 PathProgramCache]: Analyzing trace with hash 851318233, now seen corresponding path program 1 times [2025-03-17 03:14:19,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:14:19,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778812191] [2025-03-17 03:14:19,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:14:19,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:14:19,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-17 03:14:19,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-17 03:14:19,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:14:19,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:14:19,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 03:14:19,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:14:19,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778812191] [2025-03-17 03:14:19,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778812191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:14:19,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:14:19,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 03:14:19,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700215471] [2025-03-17 03:14:19,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:14:19,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 03:14:19,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:14:19,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 03:14:19,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 03:14:19,505 INFO L87 Difference]: Start difference. First operand 704 states and 1062 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:14:19,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:14:19,835 INFO L93 Difference]: Finished difference Result 1677 states and 2537 transitions. [2025-03-17 03:14:19,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 03:14:19,835 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 204 [2025-03-17 03:14:19,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:14:19,839 INFO L225 Difference]: With dead ends: 1677 [2025-03-17 03:14:19,839 INFO L226 Difference]: Without dead ends: 974 [2025-03-17 03:14:19,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:14:19,841 INFO L435 NwaCegarLoop]: 300 mSDtfsCounter, 150 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 03:14:19,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 635 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 03:14:19,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2025-03-17 03:14:19,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 732. [2025-03-17 03:14:19,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 653 states have (on average 1.4594180704441042) internal successors, (953), 655 states have internal predecessors, (953), 74 states have call successors, (74), 4 states have call predecessors, (74), 4 states have return successors, (74), 72 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-17 03:14:19,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 1101 transitions. [2025-03-17 03:14:19,864 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 1101 transitions. Word has length 204 [2025-03-17 03:14:19,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:14:19,865 INFO L471 AbstractCegarLoop]: Abstraction has 732 states and 1101 transitions. [2025-03-17 03:14:19,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:14:19,865 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 1101 transitions. [2025-03-17 03:14:19,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-17 03:14:19,866 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:14:19,866 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:14:19,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 03:14:19,867 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:14:19,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:14:19,868 INFO L85 PathProgramCache]: Analyzing trace with hash 844742652, now seen corresponding path program 1 times [2025-03-17 03:14:19,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:14:19,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790860553] [2025-03-17 03:14:19,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:14:19,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:14:19,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-17 03:14:19,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-17 03:14:19,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:14:19,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:14:21,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 03:14:21,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:14:21,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790860553] [2025-03-17 03:14:21,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790860553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:14:21,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:14:21,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 03:14:21,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307675295] [2025-03-17 03:14:21,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:14:21,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 03:14:21,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:14:21,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 03:14:21,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-17 03:14:21,456 INFO L87 Difference]: Start difference. First operand 732 states and 1101 transitions. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:14:23,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:14:23,556 INFO L93 Difference]: Finished difference Result 1788 states and 2683 transitions. [2025-03-17 03:14:23,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 03:14:23,557 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 205 [2025-03-17 03:14:23,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:14:23,563 INFO L225 Difference]: With dead ends: 1788 [2025-03-17 03:14:23,563 INFO L226 Difference]: Without dead ends: 1463 [2025-03-17 03:14:23,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2025-03-17 03:14:23,565 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 508 mSDsluCounter, 1058 mSDsCounter, 0 mSdLazyCounter, 1021 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 1262 SdHoareTripleChecker+Invalid, 1065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-17 03:14:23,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 1262 Invalid, 1065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1021 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-17 03:14:23,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2025-03-17 03:14:23,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 1017. [2025-03-17 03:14:23,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1017 states, 926 states have (on average 1.4773218142548596) internal successors, (1368), 930 states have internal predecessors, (1368), 82 states have call successors, (82), 8 states have call predecessors, (82), 8 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-17 03:14:23,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 1017 states and 1532 transitions. [2025-03-17 03:14:23,600 INFO L78 Accepts]: Start accepts. Automaton has 1017 states and 1532 transitions. Word has length 205 [2025-03-17 03:14:23,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:14:23,601 INFO L471 AbstractCegarLoop]: Abstraction has 1017 states and 1532 transitions. [2025-03-17 03:14:23,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:14:23,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1532 transitions. [2025-03-17 03:14:23,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-17 03:14:23,602 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:14:23,602 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:14:23,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 03:14:23,602 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:14:23,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:14:23,603 INFO L85 PathProgramCache]: Analyzing trace with hash 339184027, now seen corresponding path program 1 times [2025-03-17 03:14:23,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:14:23,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487035130] [2025-03-17 03:14:23,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:14:23,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:14:23,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-17 03:14:23,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-17 03:14:23,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:14:23,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:14:24,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 03:14:24,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:14:24,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487035130] [2025-03-17 03:14:24,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487035130] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:14:24,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:14:24,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 03:14:24,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523962856] [2025-03-17 03:14:24,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:14:24,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 03:14:24,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:14:24,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 03:14:24,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-17 03:14:24,563 INFO L87 Difference]: Start difference. First operand 1017 states and 1532 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:14:24,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:14:24,882 INFO L93 Difference]: Finished difference Result 2196 states and 3304 transitions. [2025-03-17 03:14:24,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 03:14:24,883 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 205 [2025-03-17 03:14:24,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:14:24,887 INFO L225 Difference]: With dead ends: 2196 [2025-03-17 03:14:24,887 INFO L226 Difference]: Without dead ends: 1518 [2025-03-17 03:14:24,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2025-03-17 03:14:24,889 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 258 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:14:24,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 546 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 03:14:24,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1518 states. [2025-03-17 03:14:24,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1518 to 1195. [2025-03-17 03:14:24,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1195 states, 1104 states have (on average 1.4393115942028984) internal successors, (1589), 1108 states have internal predecessors, (1589), 82 states have call successors, (82), 8 states have call predecessors, (82), 8 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-17 03:14:24,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 1753 transitions. [2025-03-17 03:14:24,925 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 1753 transitions. Word has length 205 [2025-03-17 03:14:24,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:14:24,925 INFO L471 AbstractCegarLoop]: Abstraction has 1195 states and 1753 transitions. [2025-03-17 03:14:24,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:14:24,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1753 transitions. [2025-03-17 03:14:24,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-17 03:14:24,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:14:24,927 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:14:24,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 03:14:24,927 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:14:24,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:14:24,928 INFO L85 PathProgramCache]: Analyzing trace with hash -542136777, now seen corresponding path program 1 times [2025-03-17 03:14:24,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:14:24,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806750577] [2025-03-17 03:14:24,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:14:24,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:14:24,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-17 03:14:24,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-17 03:14:24,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:14:24,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:14:26,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 03:14:26,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:14:26,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806750577] [2025-03-17 03:14:26,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806750577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:14:26,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:14:26,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 03:14:26,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721819859] [2025-03-17 03:14:26,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:14:26,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 03:14:26,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:14:26,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 03:14:26,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-17 03:14:26,216 INFO L87 Difference]: Start difference. First operand 1195 states and 1753 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:14:26,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:14:26,987 INFO L93 Difference]: Finished difference Result 2926 states and 4242 transitions. [2025-03-17 03:14:26,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 03:14:26,988 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 205 [2025-03-17 03:14:26,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:14:26,993 INFO L225 Difference]: With dead ends: 2926 [2025-03-17 03:14:26,993 INFO L226 Difference]: Without dead ends: 1732 [2025-03-17 03:14:26,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-03-17 03:14:26,996 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 369 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 03:14:26,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 745 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 03:14:26,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1732 states. [2025-03-17 03:14:27,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1732 to 1198. [2025-03-17 03:14:27,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1198 states, 1107 states have (on average 1.4263775971093045) internal successors, (1579), 1111 states have internal predecessors, (1579), 82 states have call successors, (82), 8 states have call predecessors, (82), 8 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-17 03:14:27,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1743 transitions. [2025-03-17 03:14:27,035 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1743 transitions. Word has length 205 [2025-03-17 03:14:27,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:14:27,036 INFO L471 AbstractCegarLoop]: Abstraction has 1198 states and 1743 transitions. [2025-03-17 03:14:27,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:14:27,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1743 transitions. [2025-03-17 03:14:27,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-17 03:14:27,037 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:14:27,037 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:14:27,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 03:14:27,037 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:14:27,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:14:27,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1047695402, now seen corresponding path program 1 times [2025-03-17 03:14:27,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:14:27,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672255155] [2025-03-17 03:14:27,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:14:27,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:14:27,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-17 03:14:27,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-17 03:14:27,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:14:27,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:14:29,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 03:14:29,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:14:29,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672255155] [2025-03-17 03:14:29,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672255155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:14:29,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:14:29,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 03:14:29,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151083336] [2025-03-17 03:14:29,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:14:29,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 03:14:29,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:14:29,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 03:14:29,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2025-03-17 03:14:29,080 INFO L87 Difference]: Start difference. First operand 1198 states and 1743 transitions. Second operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:14:30,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:14:30,896 INFO L93 Difference]: Finished difference Result 3056 states and 4378 transitions. [2025-03-17 03:14:30,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 03:14:30,897 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 205 [2025-03-17 03:14:30,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:14:30,903 INFO L225 Difference]: With dead ends: 3056 [2025-03-17 03:14:30,903 INFO L226 Difference]: Without dead ends: 1859 [2025-03-17 03:14:30,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2025-03-17 03:14:30,906 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 410 mSDsluCounter, 1231 mSDsCounter, 0 mSdLazyCounter, 1050 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 1427 SdHoareTripleChecker+Invalid, 1145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:14:30,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 1427 Invalid, 1145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1050 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-17 03:14:30,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1859 states. [2025-03-17 03:14:30,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1859 to 1273. [2025-03-17 03:14:30,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1273 states, 1149 states have (on average 1.4168842471714533) internal successors, (1628), 1153 states have internal predecessors, (1628), 113 states have call successors, (113), 10 states have call predecessors, (113), 10 states have return successors, (113), 109 states have call predecessors, (113), 113 states have call successors, (113) [2025-03-17 03:14:30,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1273 states to 1273 states and 1854 transitions. [2025-03-17 03:14:30,953 INFO L78 Accepts]: Start accepts. Automaton has 1273 states and 1854 transitions. Word has length 205 [2025-03-17 03:14:30,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:14:30,953 INFO L471 AbstractCegarLoop]: Abstraction has 1273 states and 1854 transitions. [2025-03-17 03:14:30,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:14:30,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1273 states and 1854 transitions. [2025-03-17 03:14:30,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-17 03:14:30,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:14:30,954 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:14:30,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 03:14:30,955 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:14:30,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:14:30,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1558229579, now seen corresponding path program 1 times [2025-03-17 03:14:30,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:14:30,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293211496] [2025-03-17 03:14:30,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:14:30,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:14:30,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-17 03:14:30,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-17 03:14:30,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:14:30,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:14:31,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 03:14:31,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:14:31,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293211496] [2025-03-17 03:14:31,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293211496] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:14:31,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:14:31,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 03:14:31,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567679793] [2025-03-17 03:14:31,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:14:31,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 03:14:31,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:14:31,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 03:14:31,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 03:14:31,303 INFO L87 Difference]: Start difference. First operand 1273 states and 1854 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:14:32,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:14:32,336 INFO L93 Difference]: Finished difference Result 2911 states and 4198 transitions. [2025-03-17 03:14:32,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 03:14:32,336 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 205 [2025-03-17 03:14:32,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:14:32,343 INFO L225 Difference]: With dead ends: 2911 [2025-03-17 03:14:32,343 INFO L226 Difference]: Without dead ends: 1714 [2025-03-17 03:14:32,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2025-03-17 03:14:32,346 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 305 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 03:14:32,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 967 Invalid, 998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 965 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 03:14:32,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1714 states. [2025-03-17 03:14:32,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1714 to 1577. [2025-03-17 03:14:32,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1577 states, 1412 states have (on average 1.405099150141643) internal successors, (1984), 1417 states have internal predecessors, (1984), 150 states have call successors, (150), 14 states have call predecessors, (150), 14 states have return successors, (150), 145 states have call predecessors, (150), 150 states have call successors, (150) [2025-03-17 03:14:32,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 2284 transitions. [2025-03-17 03:14:32,411 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 2284 transitions. Word has length 205 [2025-03-17 03:14:32,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:14:32,412 INFO L471 AbstractCegarLoop]: Abstraction has 1577 states and 2284 transitions. [2025-03-17 03:14:32,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:14:32,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 2284 transitions. [2025-03-17 03:14:32,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-17 03:14:32,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:14:32,414 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:14:32,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 03:14:32,414 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:14:32,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:14:32,415 INFO L85 PathProgramCache]: Analyzing trace with hash -289463456, now seen corresponding path program 1 times [2025-03-17 03:14:32,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:14:32,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745584620] [2025-03-17 03:14:32,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:14:32,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:14:32,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-17 03:14:32,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-17 03:14:32,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:14:32,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:14:32,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 30 proven. 60 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-03-17 03:14:32,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:14:32,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745584620] [2025-03-17 03:14:32,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745584620] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:14:32,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820387183] [2025-03-17 03:14:32,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:14:32,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:14:32,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:14:32,615 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-17 03:14:32,616 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-17 03:14:32,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-17 03:14:32,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-17 03:14:32,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:14:32,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:14:32,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 03:14:32,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:14:33,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 812 proven. 198 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2025-03-17 03:14:33,339 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:14:33,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 30 proven. 60 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-03-17 03:14:33,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820387183] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 03:14:33,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 03:14:33,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 7] total 15 [2025-03-17 03:14:33,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217370502] [2025-03-17 03:14:33,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 03:14:33,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 03:14:33,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:14:33,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 03:14:33,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-03-17 03:14:33,650 INFO L87 Difference]: Start difference. First operand 1577 states and 2284 transitions. Second operand has 15 states, 15 states have (on average 8.933333333333334) internal successors, (134), 15 states have internal predecessors, (134), 4 states have call successors, (71), 3 states have call predecessors, (71), 5 states have return successors, (73), 4 states have call predecessors, (73), 4 states have call successors, (73) [2025-03-17 03:14:34,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:14:34,313 INFO L93 Difference]: Finished difference Result 2857 states and 4080 transitions. [2025-03-17 03:14:34,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-17 03:14:34,314 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 8.933333333333334) internal successors, (134), 15 states have internal predecessors, (134), 4 states have call successors, (71), 3 states have call predecessors, (71), 5 states have return successors, (73), 4 states have call predecessors, (73), 4 states have call successors, (73) Word has length 205 [2025-03-17 03:14:34,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:14:34,319 INFO L225 Difference]: With dead ends: 2857 [2025-03-17 03:14:34,319 INFO L226 Difference]: Without dead ends: 1356 [2025-03-17 03:14:34,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 404 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=202, Invalid=500, Unknown=0, NotChecked=0, Total=702 [2025-03-17 03:14:34,321 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 211 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 03:14:34,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 662 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 03:14:34,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2025-03-17 03:14:34,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 1316. [2025-03-17 03:14:34,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1316 states, 1139 states have (on average 1.3643546971027216) internal successors, (1554), 1144 states have internal predecessors, (1554), 150 states have call successors, (150), 26 states have call predecessors, (150), 26 states have return successors, (150), 145 states have call predecessors, (150), 150 states have call successors, (150) [2025-03-17 03:14:34,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 1854 transitions. [2025-03-17 03:14:34,459 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 1854 transitions. Word has length 205 [2025-03-17 03:14:34,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:14:34,459 INFO L471 AbstractCegarLoop]: Abstraction has 1316 states and 1854 transitions. [2025-03-17 03:14:34,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 8.933333333333334) internal successors, (134), 15 states have internal predecessors, (134), 4 states have call successors, (71), 3 states have call predecessors, (71), 5 states have return successors, (73), 4 states have call predecessors, (73), 4 states have call successors, (73) [2025-03-17 03:14:34,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1854 transitions. [2025-03-17 03:14:34,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-17 03:14:34,461 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:14:34,461 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:14:34,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 03:14:34,661 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,SelfDestructingSolverStorable16 [2025-03-17 03:14:34,662 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:14:34,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:14:34,662 INFO L85 PathProgramCache]: Analyzing trace with hash -667549890, now seen corresponding path program 1 times [2025-03-17 03:14:34,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:14:34,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900273931] [2025-03-17 03:14:34,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:14:34,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:14:34,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-17 03:14:34,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-17 03:14:34,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:14:34,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:14:37,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 03:14:37,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:14:37,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900273931] [2025-03-17 03:14:37,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900273931] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:14:37,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:14:37,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 03:14:37,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237094385] [2025-03-17 03:14:37,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:14:37,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 03:14:37,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:14:37,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 03:14:37,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2025-03-17 03:14:37,258 INFO L87 Difference]: Start difference. First operand 1316 states and 1854 transitions. Second operand has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:14:39,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:14:39,101 INFO L93 Difference]: Finished difference Result 3582 states and 4938 transitions. [2025-03-17 03:14:39,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 03:14:39,102 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206 [2025-03-17 03:14:39,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:14:39,109 INFO L225 Difference]: With dead ends: 3582 [2025-03-17 03:14:39,109 INFO L226 Difference]: Without dead ends: 2354 [2025-03-17 03:14:39,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2025-03-17 03:14:39,110 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 550 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 1147 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:14:39,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 1147 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 898 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 03:14:39,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2354 states. [2025-03-17 03:14:39,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2354 to 1388. [2025-03-17 03:14:39,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1388 states, 1211 states have (on average 1.3633360858794386) internal successors, (1651), 1216 states have internal predecessors, (1651), 150 states have call successors, (150), 26 states have call predecessors, (150), 26 states have return successors, (150), 145 states have call predecessors, (150), 150 states have call successors, (150) [2025-03-17 03:14:39,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1388 states to 1388 states and 1951 transitions. [2025-03-17 03:14:39,185 INFO L78 Accepts]: Start accepts. Automaton has 1388 states and 1951 transitions. Word has length 206 [2025-03-17 03:14:39,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:14:39,185 INFO L471 AbstractCegarLoop]: Abstraction has 1388 states and 1951 transitions. [2025-03-17 03:14:39,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:14:39,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1388 states and 1951 transitions. [2025-03-17 03:14:39,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-17 03:14:39,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:14:39,187 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:14:39,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 03:14:39,187 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:14:39,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:14:39,187 INFO L85 PathProgramCache]: Analyzing trace with hash 840001919, now seen corresponding path program 1 times [2025-03-17 03:14:39,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:14:39,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515623815] [2025-03-17 03:14:39,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:14:39,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:14:39,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-17 03:14:39,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-17 03:14:39,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:14:39,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:14:40,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 03:14:40,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:14:40,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515623815] [2025-03-17 03:14:40,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515623815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:14:40,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:14:40,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 03:14:40,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377888207] [2025-03-17 03:14:40,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:14:40,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 03:14:40,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:14:40,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 03:14:40,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-17 03:14:40,865 INFO L87 Difference]: Start difference. First operand 1388 states and 1951 transitions. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:14:42,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:14:42,276 INFO L93 Difference]: Finished difference Result 3363 states and 4607 transitions. [2025-03-17 03:14:42,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 03:14:42,277 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206 [2025-03-17 03:14:42,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:14:42,284 INFO L225 Difference]: With dead ends: 3363 [2025-03-17 03:14:42,284 INFO L226 Difference]: Without dead ends: 2324 [2025-03-17 03:14:42,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2025-03-17 03:14:42,286 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 469 mSDsluCounter, 1038 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 1044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 03:14:42,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 1208 Invalid, 1044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 03:14:42,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2324 states. [2025-03-17 03:14:42,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2324 to 1301. [2025-03-17 03:14:42,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1301 states, 1160 states have (on average 1.3741379310344828) internal successors, (1594), 1165 states have internal predecessors, (1594), 119 states have call successors, (119), 21 states have call predecessors, (119), 21 states have return successors, (119), 114 states have call predecessors, (119), 119 states have call successors, (119) [2025-03-17 03:14:42,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1301 states to 1301 states and 1832 transitions. [2025-03-17 03:14:42,352 INFO L78 Accepts]: Start accepts. Automaton has 1301 states and 1832 transitions. Word has length 206 [2025-03-17 03:14:42,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:14:42,352 INFO L471 AbstractCegarLoop]: Abstraction has 1301 states and 1832 transitions. [2025-03-17 03:14:42,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:14:42,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1301 states and 1832 transitions. [2025-03-17 03:14:42,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-17 03:14:42,354 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:14:42,354 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:14:42,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 03:14:42,354 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:14:42,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:14:42,355 INFO L85 PathProgramCache]: Analyzing trace with hash 685759807, now seen corresponding path program 1 times [2025-03-17 03:14:42,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:14:42,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497490343] [2025-03-17 03:14:42,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:14:42,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:14:42,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-17 03:14:42,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-17 03:14:42,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:14:42,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:14:42,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 03:14:42,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:14:42,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497490343] [2025-03-17 03:14:42,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497490343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:14:42,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:14:42,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 03:14:42,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839074094] [2025-03-17 03:14:42,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:14:42,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 03:14:42,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:14:42,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 03:14:42,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-03-17 03:14:42,952 INFO L87 Difference]: Start difference. First operand 1301 states and 1832 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-17 03:14:44,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:14:44,203 INFO L93 Difference]: Finished difference Result 3485 states and 4845 transitions. [2025-03-17 03:14:44,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 03:14:44,203 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 206 [2025-03-17 03:14:44,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:14:44,210 INFO L225 Difference]: With dead ends: 3485 [2025-03-17 03:14:44,211 INFO L226 Difference]: Without dead ends: 2185 [2025-03-17 03:14:44,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2025-03-17 03:14:44,213 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 345 mSDsluCounter, 1234 mSDsCounter, 0 mSdLazyCounter, 1478 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 1493 SdHoareTripleChecker+Invalid, 1496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:14:44,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 1493 Invalid, 1496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1478 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 03:14:44,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2185 states. [2025-03-17 03:14:44,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2185 to 1571. [2025-03-17 03:14:44,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1571 states, 1386 states have (on average 1.3585858585858586) internal successors, (1883), 1392 states have internal predecessors, (1883), 156 states have call successors, (156), 28 states have call predecessors, (156), 28 states have return successors, (156), 150 states have call predecessors, (156), 156 states have call successors, (156) [2025-03-17 03:14:44,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 2195 transitions. [2025-03-17 03:14:44,305 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 2195 transitions. Word has length 206 [2025-03-17 03:14:44,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:14:44,305 INFO L471 AbstractCegarLoop]: Abstraction has 1571 states and 2195 transitions. [2025-03-17 03:14:44,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-17 03:14:44,305 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 2195 transitions. [2025-03-17 03:14:44,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-17 03:14:44,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:14:44,307 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:14:44,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 03:14:44,307 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:14:44,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:14:44,307 INFO L85 PathProgramCache]: Analyzing trace with hash -711433248, now seen corresponding path program 1 times [2025-03-17 03:14:44,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:14:44,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69096128] [2025-03-17 03:14:44,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:14:44,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:14:44,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-17 03:14:44,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-17 03:14:44,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:14:44,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:14:44,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 12 proven. 78 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-03-17 03:14:44,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:14:44,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69096128] [2025-03-17 03:14:44,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69096128] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:14:44,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638652244] [2025-03-17 03:14:44,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:14:44,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:14:44,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:14:44,516 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-17 03:14:44,519 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-17 03:14:44,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-17 03:14:44,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-17 03:14:44,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:14:44,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:14:44,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 03:14:44,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:14:45,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 482 proven. 150 refuted. 0 times theorem prover too weak. 1228 trivial. 0 not checked. [2025-03-17 03:14:45,108 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:14:45,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 12 proven. 78 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-03-17 03:14:45,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638652244] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 03:14:45,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 03:14:45,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6] total 14 [2025-03-17 03:14:45,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947767267] [2025-03-17 03:14:45,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 03:14:45,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 03:14:45,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:14:45,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 03:14:45,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-03-17 03:14:45,308 INFO L87 Difference]: Start difference. First operand 1571 states and 2195 transitions. Second operand has 14 states, 14 states have (on average 7.571428571428571) internal successors, (106), 14 states have internal predecessors, (106), 4 states have call successors, (83), 3 states have call predecessors, (83), 5 states have return successors, (84), 4 states have call predecessors, (84), 4 states have call successors, (84) [2025-03-17 03:14:46,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:14:46,144 INFO L93 Difference]: Finished difference Result 3022 states and 4179 transitions. [2025-03-17 03:14:46,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-17 03:14:46,144 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.571428571428571) internal successors, (106), 14 states have internal predecessors, (106), 4 states have call successors, (83), 3 states have call predecessors, (83), 5 states have return successors, (84), 4 states have call predecessors, (84), 4 states have call successors, (84) Word has length 206 [2025-03-17 03:14:46,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:14:46,151 INFO L225 Difference]: With dead ends: 3022 [2025-03-17 03:14:46,151 INFO L226 Difference]: Without dead ends: 1452 [2025-03-17 03:14:46,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 410 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=424, Invalid=1058, Unknown=0, NotChecked=0, Total=1482 [2025-03-17 03:14:46,155 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 447 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 03:14:46,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 660 Invalid, 938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 03:14:46,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1452 states. [2025-03-17 03:14:46,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1452 to 775. [2025-03-17 03:14:46,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 680 states have (on average 1.3779411764705882) internal successors, (937), 682 states have internal predecessors, (937), 76 states have call successors, (76), 18 states have call predecessors, (76), 18 states have return successors, (76), 74 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-17 03:14:46,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1089 transitions. [2025-03-17 03:14:46,215 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1089 transitions. Word has length 206 [2025-03-17 03:14:46,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:14:46,216 INFO L471 AbstractCegarLoop]: Abstraction has 775 states and 1089 transitions. [2025-03-17 03:14:46,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.571428571428571) internal successors, (106), 14 states have internal predecessors, (106), 4 states have call successors, (83), 3 states have call predecessors, (83), 5 states have return successors, (84), 4 states have call predecessors, (84), 4 states have call successors, (84) [2025-03-17 03:14:46,216 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1089 transitions. [2025-03-17 03:14:46,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-17 03:14:46,217 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:14:46,218 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:14:46,227 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-17 03:14:46,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:14:46,419 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:14:46,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:14:46,420 INFO L85 PathProgramCache]: Analyzing trace with hash 281762111, now seen corresponding path program 1 times [2025-03-17 03:14:46,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:14:46,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81927930] [2025-03-17 03:14:46,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:14:46,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:14:46,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-17 03:14:46,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-17 03:14:46,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:14:46,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:14:51,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 03:14:51,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:14:51,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81927930] [2025-03-17 03:14:51,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81927930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:14:51,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:14:51,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 03:14:51,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036585999] [2025-03-17 03:14:51,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:14:51,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 03:14:51,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:14:51,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 03:14:51,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-03-17 03:14:51,904 INFO L87 Difference]: Start difference. First operand 775 states and 1089 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:14:53,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:14:53,454 INFO L93 Difference]: Finished difference Result 1895 states and 2635 transitions. [2025-03-17 03:14:53,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 03:14:53,457 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 207 [2025-03-17 03:14:53,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:14:53,464 INFO L225 Difference]: With dead ends: 1895 [2025-03-17 03:14:53,467 INFO L226 Difference]: Without dead ends: 1121 [2025-03-17 03:14:53,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2025-03-17 03:14:53,470 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 509 mSDsluCounter, 1139 mSDsCounter, 0 mSdLazyCounter, 1117 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 1305 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:14:53,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 1305 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1117 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 03:14:53,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2025-03-17 03:14:53,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 803. [2025-03-17 03:14:53,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 708 states have (on average 1.384180790960452) internal successors, (980), 710 states have internal predecessors, (980), 76 states have call successors, (76), 18 states have call predecessors, (76), 18 states have return successors, (76), 74 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-17 03:14:53,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1132 transitions. [2025-03-17 03:14:53,543 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1132 transitions. Word has length 207 [2025-03-17 03:14:53,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:14:53,546 INFO L471 AbstractCegarLoop]: Abstraction has 803 states and 1132 transitions. [2025-03-17 03:14:53,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:14:53,547 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1132 transitions. [2025-03-17 03:14:53,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-17 03:14:53,548 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:14:53,548 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:14:53,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 03:14:53,548 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:14:53,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:14:53,549 INFO L85 PathProgramCache]: Analyzing trace with hash -223796514, now seen corresponding path program 1 times [2025-03-17 03:14:53,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:14:53,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81791277] [2025-03-17 03:14:53,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:14:53,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:14:53,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-17 03:14:53,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-17 03:14:53,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:14:53,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:14:54,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 03:14:54,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:14:54,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81791277] [2025-03-17 03:14:54,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81791277] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:14:54,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:14:54,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 03:14:54,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751192680] [2025-03-17 03:14:54,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:14:54,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 03:14:54,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:14:54,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 03:14:54,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-03-17 03:14:54,702 INFO L87 Difference]: Start difference. First operand 803 states and 1132 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:14:55,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:14:55,514 INFO L93 Difference]: Finished difference Result 2343 states and 3249 transitions. [2025-03-17 03:14:55,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 03:14:55,515 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 207 [2025-03-17 03:14:55,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:14:55,520 INFO L225 Difference]: With dead ends: 2343 [2025-03-17 03:14:55,520 INFO L226 Difference]: Without dead ends: 1541 [2025-03-17 03:14:55,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-03-17 03:14:55,522 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 326 mSDsluCounter, 1243 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 1466 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 03:14:55,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 1466 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 03:14:55,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1541 states. [2025-03-17 03:14:55,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1541 to 844. [2025-03-17 03:14:55,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 844 states, 749 states have (on average 1.3911882510013351) internal successors, (1042), 751 states have internal predecessors, (1042), 76 states have call successors, (76), 18 states have call predecessors, (76), 18 states have return successors, (76), 74 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-17 03:14:55,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1194 transitions. [2025-03-17 03:14:55,586 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1194 transitions. Word has length 207 [2025-03-17 03:14:55,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:14:55,586 INFO L471 AbstractCegarLoop]: Abstraction has 844 states and 1194 transitions. [2025-03-17 03:14:55,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:14:55,586 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1194 transitions. [2025-03-17 03:14:55,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-17 03:14:55,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:14:55,587 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:14:55,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 03:14:55,587 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:14:55,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:14:55,588 INFO L85 PathProgramCache]: Analyzing trace with hash -734330691, now seen corresponding path program 1 times [2025-03-17 03:14:55,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:14:55,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595065554] [2025-03-17 03:14:55,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:14:55,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:14:55,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-17 03:14:55,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-17 03:14:55,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:14:55,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:14:55,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 03:14:55,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:14:55,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595065554] [2025-03-17 03:14:55,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595065554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:14:55,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:14:55,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 03:14:55,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276460167] [2025-03-17 03:14:55,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:14:55,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 03:14:55,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:14:55,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 03:14:55,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 03:14:55,810 INFO L87 Difference]: Start difference. First operand 844 states and 1194 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-17 03:14:56,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:14:56,293 INFO L93 Difference]: Finished difference Result 2005 states and 2809 transitions. [2025-03-17 03:14:56,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 03:14:56,293 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 207 [2025-03-17 03:14:56,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:14:56,297 INFO L225 Difference]: With dead ends: 2005 [2025-03-17 03:14:56,298 INFO L226 Difference]: Without dead ends: 1162 [2025-03-17 03:14:56,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-17 03:14:56,300 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 270 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 03:14:56,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 739 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 03:14:56,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2025-03-17 03:14:56,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 996. [2025-03-17 03:14:56,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 996 states, 863 states have (on average 1.3696407879490151) internal successors, (1182), 865 states have internal predecessors, (1182), 107 states have call successors, (107), 25 states have call predecessors, (107), 25 states have return successors, (107), 105 states have call predecessors, (107), 107 states have call successors, (107) [2025-03-17 03:14:56,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 1396 transitions. [2025-03-17 03:14:56,373 INFO L78 Accepts]: Start accepts. Automaton has 996 states and 1396 transitions. Word has length 207 [2025-03-17 03:14:56,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:14:56,373 INFO L471 AbstractCegarLoop]: Abstraction has 996 states and 1396 transitions. [2025-03-17 03:14:56,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-17 03:14:56,373 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1396 transitions. [2025-03-17 03:14:56,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-17 03:14:56,374 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:14:56,374 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:14:56,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 03:14:56,374 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:14:56,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:14:56,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1337584895, now seen corresponding path program 1 times [2025-03-17 03:14:56,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:14:56,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251821439] [2025-03-17 03:14:56,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:14:56,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:14:56,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-17 03:14:56,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-17 03:14:56,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:14:56,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:14:58,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 03:14:58,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:14:58,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251821439] [2025-03-17 03:14:58,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251821439] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:14:58,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:14:58,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 03:14:58,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696016544] [2025-03-17 03:14:58,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:14:58,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 03:14:58,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:14:58,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 03:14:58,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-03-17 03:14:58,579 INFO L87 Difference]: Start difference. First operand 996 states and 1396 transitions. Second operand has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:14:59,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:14:59,788 INFO L93 Difference]: Finished difference Result 2888 states and 4004 transitions. [2025-03-17 03:14:59,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 03:14:59,789 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 207 [2025-03-17 03:14:59,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:14:59,794 INFO L225 Difference]: With dead ends: 2888 [2025-03-17 03:14:59,794 INFO L226 Difference]: Without dead ends: 2045 [2025-03-17 03:14:59,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-03-17 03:14:59,796 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 458 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 1022 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 1028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 03:14:59,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 1002 Invalid, 1028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1022 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 03:14:59,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2045 states. [2025-03-17 03:14:59,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2045 to 1010. [2025-03-17 03:14:59,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1010 states, 877 states have (on average 1.371721778791334) internal successors, (1203), 879 states have internal predecessors, (1203), 107 states have call successors, (107), 25 states have call predecessors, (107), 25 states have return successors, (107), 105 states have call predecessors, (107), 107 states have call successors, (107) [2025-03-17 03:14:59,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 1417 transitions. [2025-03-17 03:14:59,869 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 1417 transitions. Word has length 207 [2025-03-17 03:14:59,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:14:59,869 INFO L471 AbstractCegarLoop]: Abstraction has 1010 states and 1417 transitions. [2025-03-17 03:14:59,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:14:59,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1417 transitions. [2025-03-17 03:14:59,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-17 03:14:59,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:14:59,870 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:14:59,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 03:14:59,870 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:14:59,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:14:59,871 INFO L85 PathProgramCache]: Analyzing trace with hash 832026270, now seen corresponding path program 1 times [2025-03-17 03:14:59,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:14:59,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308714034] [2025-03-17 03:14:59,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:14:59,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:14:59,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-17 03:14:59,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-17 03:14:59,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:14:59,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:15:02,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 03:15:02,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:15:02,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308714034] [2025-03-17 03:15:02,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308714034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:15:02,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:15:02,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-17 03:15:02,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074072116] [2025-03-17 03:15:02,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:15:02,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 03:15:02,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:15:02,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 03:15:02,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2025-03-17 03:15:02,458 INFO L87 Difference]: Start difference. First operand 1010 states and 1417 transitions. Second operand has 17 states, 17 states have (on average 3.235294117647059) internal successors, (55), 17 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:15:05,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:15:05,547 INFO L93 Difference]: Finished difference Result 2375 states and 3287 transitions. [2025-03-17 03:15:05,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-17 03:15:05,547 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.235294117647059) internal successors, (55), 17 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 207 [2025-03-17 03:15:05,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:15:05,551 INFO L225 Difference]: With dead ends: 2375 [2025-03-17 03:15:05,551 INFO L226 Difference]: Without dead ends: 1521 [2025-03-17 03:15:05,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=297, Invalid=893, Unknown=0, NotChecked=0, Total=1190 [2025-03-17 03:15:05,552 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 523 mSDsluCounter, 1173 mSDsCounter, 0 mSdLazyCounter, 1333 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 1338 SdHoareTripleChecker+Invalid, 1427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-17 03:15:05,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 1338 Invalid, 1427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1333 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-17 03:15:05,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2025-03-17 03:15:05,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1105. [2025-03-17 03:15:05,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1105 states, 934 states have (on average 1.354389721627409) internal successors, (1265), 936 states have internal predecessors, (1265), 138 states have call successors, (138), 32 states have call predecessors, (138), 32 states have return successors, (138), 136 states have call predecessors, (138), 138 states have call successors, (138) [2025-03-17 03:15:05,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1105 states to 1105 states and 1541 transitions. [2025-03-17 03:15:05,652 INFO L78 Accepts]: Start accepts. Automaton has 1105 states and 1541 transitions. Word has length 207 [2025-03-17 03:15:05,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:15:05,652 INFO L471 AbstractCegarLoop]: Abstraction has 1105 states and 1541 transitions. [2025-03-17 03:15:05,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.235294117647059) internal successors, (55), 17 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:15:05,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1105 states and 1541 transitions. [2025-03-17 03:15:05,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-17 03:15:05,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:15:05,654 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:15:05,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 03:15:05,654 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:15:05,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:15:05,654 INFO L85 PathProgramCache]: Analyzing trace with hash 827050718, now seen corresponding path program 1 times [2025-03-17 03:15:05,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:15:05,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277428913] [2025-03-17 03:15:05,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:15:05,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:15:05,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-17 03:15:05,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-17 03:15:05,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:15:05,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:15:08,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 03:15:08,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:15:08,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277428913] [2025-03-17 03:15:08,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277428913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:15:08,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:15:08,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-17 03:15:08,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282491255] [2025-03-17 03:15:08,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:15:08,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 03:15:08,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:15:08,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 03:15:08,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2025-03-17 03:15:08,683 INFO L87 Difference]: Start difference. First operand 1105 states and 1541 transitions. Second operand has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 3 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2025-03-17 03:15:13,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:15:13,461 INFO L93 Difference]: Finished difference Result 2311 states and 3206 transitions. [2025-03-17 03:15:13,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 03:15:13,462 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 3 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) Word has length 207 [2025-03-17 03:15:13,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:15:13,465 INFO L225 Difference]: With dead ends: 2311 [2025-03-17 03:15:13,465 INFO L226 Difference]: Without dead ends: 1457 [2025-03-17 03:15:13,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=246, Invalid=810, Unknown=0, NotChecked=0, Total=1056 [2025-03-17 03:15:13,467 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 567 mSDsluCounter, 1376 mSDsCounter, 0 mSdLazyCounter, 2369 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 1570 SdHoareTripleChecker+Invalid, 2438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 2369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:15:13,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 1570 Invalid, 2438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 2369 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-03-17 03:15:13,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2025-03-17 03:15:13,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1253. [2025-03-17 03:15:13,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1253 states, 1044 states have (on average 1.3419540229885059) internal successors, (1401), 1046 states have internal predecessors, (1401), 169 states have call successors, (169), 39 states have call predecessors, (169), 39 states have return successors, (169), 167 states have call predecessors, (169), 169 states have call successors, (169) [2025-03-17 03:15:13,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 1739 transitions. [2025-03-17 03:15:13,589 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 1739 transitions. Word has length 207 [2025-03-17 03:15:13,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:15:13,589 INFO L471 AbstractCegarLoop]: Abstraction has 1253 states and 1739 transitions. [2025-03-17 03:15:13,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 3 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2025-03-17 03:15:13,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 1739 transitions. [2025-03-17 03:15:13,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-17 03:15:13,590 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:15:13,590 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:15:13,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 03:15:13,590 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:15:13,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:15:13,591 INFO L85 PathProgramCache]: Analyzing trace with hash 493113024, now seen corresponding path program 1 times [2025-03-17 03:15:13,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:15:13,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699779161] [2025-03-17 03:15:13,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:15:13,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:15:13,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-17 03:15:13,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-17 03:15:13,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:15:13,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:15:14,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 03:15:14,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:15:14,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699779161] [2025-03-17 03:15:14,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699779161] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:15:14,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:15:14,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 03:15:14,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049150658] [2025-03-17 03:15:14,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:15:14,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 03:15:14,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:15:14,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 03:15:14,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-17 03:15:14,834 INFO L87 Difference]: Start difference. First operand 1253 states and 1739 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:15:15,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:15:15,616 INFO L93 Difference]: Finished difference Result 3222 states and 4451 transitions. [2025-03-17 03:15:15,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 03:15:15,617 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 207 [2025-03-17 03:15:15,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:15:15,621 INFO L225 Difference]: With dead ends: 3222 [2025-03-17 03:15:15,621 INFO L226 Difference]: Without dead ends: 2217 [2025-03-17 03:15:15,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2025-03-17 03:15:15,623 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 412 mSDsluCounter, 1088 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 1262 SdHoareTripleChecker+Invalid, 950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 03:15:15,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 1262 Invalid, 950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 946 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 03:15:15,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2217 states. [2025-03-17 03:15:15,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2217 to 1214. [2025-03-17 03:15:15,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1214 states, 1005 states have (on average 1.3303482587064677) internal successors, (1337), 1007 states have internal predecessors, (1337), 169 states have call successors, (169), 39 states have call predecessors, (169), 39 states have return successors, (169), 167 states have call predecessors, (169), 169 states have call successors, (169) [2025-03-17 03:15:15,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 1675 transitions. [2025-03-17 03:15:15,737 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 1675 transitions. Word has length 207 [2025-03-17 03:15:15,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:15:15,737 INFO L471 AbstractCegarLoop]: Abstraction has 1214 states and 1675 transitions. [2025-03-17 03:15:15,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:15:15,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 1675 transitions. [2025-03-17 03:15:15,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-17 03:15:15,738 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:15:15,738 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:15:15,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-17 03:15:15,739 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:15:15,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:15:15,739 INFO L85 PathProgramCache]: Analyzing trace with hash -12445601, now seen corresponding path program 1 times [2025-03-17 03:15:15,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:15:15,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56771225] [2025-03-17 03:15:15,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:15:15,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:15:15,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-17 03:15:15,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-17 03:15:15,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:15:15,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:15:17,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 03:15:17,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:15:17,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56771225] [2025-03-17 03:15:17,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56771225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:15:17,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:15:17,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 03:15:17,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398208898] [2025-03-17 03:15:17,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:15:17,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 03:15:17,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:15:17,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 03:15:17,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-03-17 03:15:17,147 INFO L87 Difference]: Start difference. First operand 1214 states and 1675 transitions. Second operand has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:15:18,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:15:18,883 INFO L93 Difference]: Finished difference Result 3199 states and 4404 transitions. [2025-03-17 03:15:18,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 03:15:18,884 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 207 [2025-03-17 03:15:18,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:15:18,888 INFO L225 Difference]: With dead ends: 3199 [2025-03-17 03:15:18,888 INFO L226 Difference]: Without dead ends: 2374 [2025-03-17 03:15:18,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-03-17 03:15:18,890 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 386 mSDsluCounter, 1276 mSDsCounter, 0 mSdLazyCounter, 1447 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 1494 SdHoareTripleChecker+Invalid, 1447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-17 03:15:18,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 1494 Invalid, 1447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1447 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-17 03:15:18,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2374 states. [2025-03-17 03:15:19,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2374 to 1210. [2025-03-17 03:15:19,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1210 states, 1001 states have (on average 1.3296703296703296) internal successors, (1331), 1003 states have internal predecessors, (1331), 169 states have call successors, (169), 39 states have call predecessors, (169), 39 states have return successors, (169), 167 states have call predecessors, (169), 169 states have call successors, (169) [2025-03-17 03:15:19,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 1669 transitions. [2025-03-17 03:15:19,013 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 1669 transitions. Word has length 207 [2025-03-17 03:15:19,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:15:19,013 INFO L471 AbstractCegarLoop]: Abstraction has 1210 states and 1669 transitions. [2025-03-17 03:15:19,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:15:19,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1669 transitions. [2025-03-17 03:15:19,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-17 03:15:19,014 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:15:19,015 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:15:19,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-17 03:15:19,015 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:15:19,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:15:19,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1842684319, now seen corresponding path program 1 times [2025-03-17 03:15:19,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:15:19,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653500361] [2025-03-17 03:15:19,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:15:19,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:15:19,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-17 03:15:19,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-17 03:15:19,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:15:19,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:15:19,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 03:15:19,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:15:19,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653500361] [2025-03-17 03:15:19,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653500361] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:15:19,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:15:19,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 03:15:19,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962675026] [2025-03-17 03:15:19,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:15:19,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 03:15:19,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:15:19,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 03:15:19,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 03:15:19,203 INFO L87 Difference]: Start difference. First operand 1210 states and 1669 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:15:19,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:15:19,575 INFO L93 Difference]: Finished difference Result 3071 states and 4260 transitions. [2025-03-17 03:15:19,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 03:15:19,576 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 209 [2025-03-17 03:15:19,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:15:19,581 INFO L225 Difference]: With dead ends: 3071 [2025-03-17 03:15:19,581 INFO L226 Difference]: Without dead ends: 1954 [2025-03-17 03:15:19,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 03:15:19,584 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 141 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:15:19,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 727 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 03:15:19,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1954 states. [2025-03-17 03:15:19,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1954 to 1952. [2025-03-17 03:15:19,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1952 states, 1649 states have (on average 1.3256519102486355) internal successors, (2186), 1653 states have internal predecessors, (2186), 245 states have call successors, (245), 57 states have call predecessors, (245), 57 states have return successors, (245), 241 states have call predecessors, (245), 245 states have call successors, (245) [2025-03-17 03:15:19,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1952 states and 2676 transitions. [2025-03-17 03:15:19,768 INFO L78 Accepts]: Start accepts. Automaton has 1952 states and 2676 transitions. Word has length 209 [2025-03-17 03:15:19,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:15:19,769 INFO L471 AbstractCegarLoop]: Abstraction has 1952 states and 2676 transitions. [2025-03-17 03:15:19,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:15:19,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 2676 transitions. [2025-03-17 03:15:19,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-17 03:15:19,770 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:15:19,770 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:15:19,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-17 03:15:19,771 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:15:19,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:15:19,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1182141852, now seen corresponding path program 1 times [2025-03-17 03:15:19,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:15:19,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125263328] [2025-03-17 03:15:19,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:15:19,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:15:19,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-17 03:15:19,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-17 03:15:19,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:15:19,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:15:19,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 03:15:19,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:15:19,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125263328] [2025-03-17 03:15:19,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125263328] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:15:19,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:15:19,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 03:15:19,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447191578] [2025-03-17 03:15:19,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:15:19,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 03:15:19,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:15:19,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 03:15:19,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 03:15:19,829 INFO L87 Difference]: Start difference. First operand 1952 states and 2676 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:15:20,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:15:20,121 INFO L93 Difference]: Finished difference Result 5175 states and 7080 transitions. [2025-03-17 03:15:20,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 03:15:20,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 209 [2025-03-17 03:15:20,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:15:20,130 INFO L225 Difference]: With dead ends: 5175 [2025-03-17 03:15:20,130 INFO L226 Difference]: Without dead ends: 3316 [2025-03-17 03:15:20,134 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-17 03:15:20,134 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 87 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:15:20,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 354 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:15:20,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3316 states. [2025-03-17 03:15:20,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3316 to 3258. [2025-03-17 03:15:20,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3258 states, 2691 states have (on average 1.3039762170196953) internal successors, (3509), 2699 states have internal predecessors, (3509), 459 states have call successors, (459), 107 states have call predecessors, (459), 107 states have return successors, (459), 451 states have call predecessors, (459), 459 states have call successors, (459) [2025-03-17 03:15:20,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3258 states to 3258 states and 4427 transitions. [2025-03-17 03:15:20,480 INFO L78 Accepts]: Start accepts. Automaton has 3258 states and 4427 transitions. Word has length 209 [2025-03-17 03:15:20,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:15:20,480 INFO L471 AbstractCegarLoop]: Abstraction has 3258 states and 4427 transitions. [2025-03-17 03:15:20,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:15:20,480 INFO L276 IsEmpty]: Start isEmpty. Operand 3258 states and 4427 transitions. [2025-03-17 03:15:20,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-17 03:15:20,481 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:15:20,481 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:15:20,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-17 03:15:20,482 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:15:20,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:15:20,482 INFO L85 PathProgramCache]: Analyzing trace with hash -625312611, now seen corresponding path program 1 times [2025-03-17 03:15:20,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:15:20,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706934797] [2025-03-17 03:15:20,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:15:20,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:15:20,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-17 03:15:20,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-17 03:15:20,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:15:20,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat