./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-86.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_codestructure_steplocals_file-86.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e73e85347bbfce4f45897bd7cee996074c05d40818a217b9a91bb8d2644bc292 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 23:26:03,883 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 23:26:03,940 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 23:26:03,947 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 23:26:03,947 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 23:26:03,968 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 23:26:03,970 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 23:26:03,970 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 23:26:03,970 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 23:26:03,970 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 23:26:03,971 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 23:26:03,971 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 23:26:03,972 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 23:26:03,972 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 23:26:03,972 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 23:26:03,972 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 23:26:03,972 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 23:26:03,972 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 23:26:03,972 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 23:26:03,973 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 23:26:03,973 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 23:26:03,973 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 23:26:03,973 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 23:26:03,973 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 23:26:03,973 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 23:26:03,973 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 23:26:03,973 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 23:26:03,973 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 23:26:03,973 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 23:26:03,973 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 23:26:03,973 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 23:26:03,973 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 23:26:03,973 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:26:03,973 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 23:26:03,973 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 23:26:03,973 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 23:26:03,973 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 23:26:03,973 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 23:26:03,973 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 23:26:03,973 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 23:26:03,973 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 23:26:03,973 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 23:26:03,973 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 23:26:03,974 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 -> e73e85347bbfce4f45897bd7cee996074c05d40818a217b9a91bb8d2644bc292 [2025-03-16 23:26:04,191 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 23:26:04,198 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 23:26:04,200 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 23:26:04,201 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 23:26:04,201 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 23:26:04,202 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-86.i [2025-03-16 23:26:05,336 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32ae77863/02496178c6094cefa8394d54c7a26ca7/FLAGa6b26a97d [2025-03-16 23:26:05,646 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 23:26:05,647 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-86.i [2025-03-16 23:26:05,655 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32ae77863/02496178c6094cefa8394d54c7a26ca7/FLAGa6b26a97d [2025-03-16 23:26:05,670 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32ae77863/02496178c6094cefa8394d54c7a26ca7 [2025-03-16 23:26:05,673 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 23:26:05,675 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 23:26:05,676 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 23:26:05,677 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 23:26:05,680 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 23:26:05,681 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:26:05" (1/1) ... [2025-03-16 23:26:05,682 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3eee25a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:26:05, skipping insertion in model container [2025-03-16 23:26:05,682 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:26:05" (1/1) ... [2025-03-16 23:26:05,699 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 23:26:05,796 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_codestructure_steplocals_file-86.i[917,930] [2025-03-16 23:26:05,847 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:26:05,859 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 23:26:05,868 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_codestructure_steplocals_file-86.i[917,930] [2025-03-16 23:26:05,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:26:05,914 INFO L204 MainTranslator]: Completed translation [2025-03-16 23:26:05,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:26:05 WrapperNode [2025-03-16 23:26:05,916 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 23:26:05,918 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 23:26:05,918 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 23:26:05,918 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 23:26:05,923 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:26:05" (1/1) ... [2025-03-16 23:26:05,932 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:26:05" (1/1) ... [2025-03-16 23:26:05,970 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 163 [2025-03-16 23:26:05,973 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 23:26:05,973 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 23:26:05,973 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 23:26:05,973 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 23:26:05,979 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:26:05" (1/1) ... [2025-03-16 23:26:05,979 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:26:05" (1/1) ... [2025-03-16 23:26:05,982 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:26:05" (1/1) ... [2025-03-16 23:26:06,005 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-16 23:26:06,005 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:26:05" (1/1) ... [2025-03-16 23:26:06,005 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:26:05" (1/1) ... [2025-03-16 23:26:06,010 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:26:05" (1/1) ... [2025-03-16 23:26:06,014 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:26:05" (1/1) ... [2025-03-16 23:26:06,015 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:26:05" (1/1) ... [2025-03-16 23:26:06,016 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:26:05" (1/1) ... [2025-03-16 23:26:06,018 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 23:26:06,018 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 23:26:06,019 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 23:26:06,019 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 23:26:06,019 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:26:05" (1/1) ... [2025-03-16 23:26:06,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:26:06,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:26:06,042 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-16 23:26:06,045 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-16 23:26:06,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 23:26:06,061 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 23:26:06,061 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 23:26:06,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 23:26:06,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 23:26:06,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 23:26:06,116 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 23:26:06,118 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 23:26:06,423 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-16 23:26:06,423 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 23:26:06,436 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 23:26:06,436 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 23:26:06,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:26:06 BoogieIcfgContainer [2025-03-16 23:26:06,436 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 23:26:06,439 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 23:26:06,440 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 23:26:06,443 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 23:26:06,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:26:05" (1/3) ... [2025-03-16 23:26:06,444 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e8d006e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:26:06, skipping insertion in model container [2025-03-16 23:26:06,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:26:05" (2/3) ... [2025-03-16 23:26:06,444 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e8d006e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:26:06, skipping insertion in model container [2025-03-16 23:26:06,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:26:06" (3/3) ... [2025-03-16 23:26:06,446 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-86.i [2025-03-16 23:26:06,458 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 23:26:06,460 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-86.i that has 2 procedures, 73 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 23:26:06,508 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 23:26:06,517 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;@5cc71c40, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 23:26:06,517 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 23:26:06,520 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 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-16 23:26:06,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-16 23:26:06,534 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:26:06,534 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] [2025-03-16 23:26:06,534 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:26:06,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:26:06,538 INFO L85 PathProgramCache]: Analyzing trace with hash 261831023, now seen corresponding path program 1 times [2025-03-16 23:26:06,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:26:06,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637880596] [2025-03-16 23:26:06,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:26:06,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:26:06,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-16 23:26:06,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-16 23:26:06,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:26:06,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:26:06,791 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-16 23:26:06,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:26:06,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637880596] [2025-03-16 23:26:06,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637880596] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:26:06,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670117591] [2025-03-16 23:26:06,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:26:06,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:26:06,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:26:06,794 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-16 23:26:06,796 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-16 23:26:06,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-16 23:26:06,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-16 23:26:06,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:26:06,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:26:06,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 23:26:06,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:26:07,004 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-16 23:26:07,005 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:26:07,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670117591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:26:07,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 23:26:07,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-16 23:26:07,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971554123] [2025-03-16 23:26:07,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:26:07,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 23:26:07,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:26:07,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 23:26:07,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:26:07,027 INFO L87 Difference]: Start difference. First operand has 73 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 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 17.5) internal successors, (35), 2 states have internal predecessors, (35), 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-16 23:26:07,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:26:07,051 INFO L93 Difference]: Finished difference Result 143 states and 259 transitions. [2025-03-16 23:26:07,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 23:26:07,054 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 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 185 [2025-03-16 23:26:07,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:26:07,058 INFO L225 Difference]: With dead ends: 143 [2025-03-16 23:26:07,058 INFO L226 Difference]: Without dead ends: 71 [2025-03-16 23:26:07,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 186 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-16 23:26:07,061 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:26:07,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:26:07,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-16 23:26:07,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-03-16 23:26:07,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 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-16 23:26:07,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 111 transitions. [2025-03-16 23:26:07,091 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 111 transitions. Word has length 185 [2025-03-16 23:26:07,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:26:07,092 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 111 transitions. [2025-03-16 23:26:07,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 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-16 23:26:07,092 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 111 transitions. [2025-03-16 23:26:07,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-16 23:26:07,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:26:07,095 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] [2025-03-16 23:26:07,101 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-16 23:26:07,295 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-16 23:26:07,296 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:26:07,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:26:07,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1563599506, now seen corresponding path program 1 times [2025-03-16 23:26:07,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:26:07,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234477972] [2025-03-16 23:26:07,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:26:07,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:26:07,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-16 23:26:07,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-16 23:26:07,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:26:07,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:26:19,609 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-16 23:26:19,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:26:19,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234477972] [2025-03-16 23:26:19,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234477972] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:26:19,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:26:19,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 23:26:19,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216146162] [2025-03-16 23:26:19,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:26:19,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 23:26:19,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:26:19,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 23:26:19,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-03-16 23:26:19,611 INFO L87 Difference]: Start difference. First operand 71 states and 111 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 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-16 23:26:23,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:26:23,041 INFO L93 Difference]: Finished difference Result 186 states and 281 transitions. [2025-03-16 23:26:23,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 23:26:23,043 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 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 185 [2025-03-16 23:26:23,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:26:23,045 INFO L225 Difference]: With dead ends: 186 [2025-03-16 23:26:23,047 INFO L226 Difference]: Without dead ends: 116 [2025-03-16 23:26:23,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2025-03-16 23:26:23,048 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 98 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 23:26:23,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 382 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 23:26:23,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-16 23:26:23,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 84. [2025-03-16 23:26:23,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 51 states have internal predecessors, (66), 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-16 23:26:23,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 128 transitions. [2025-03-16 23:26:23,062 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 128 transitions. Word has length 185 [2025-03-16 23:26:23,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:26:23,064 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 128 transitions. [2025-03-16 23:26:23,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 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-16 23:26:23,064 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 128 transitions. [2025-03-16 23:26:23,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-16 23:26:23,066 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:26:23,067 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] [2025-03-16 23:26:23,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 23:26:23,067 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:26:23,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:26:23,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1434516787, now seen corresponding path program 1 times [2025-03-16 23:26:23,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:26:23,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422869913] [2025-03-16 23:26:23,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:26:23,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:26:23,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-16 23:26:23,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-16 23:26:23,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:26:23,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:26:23,128 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-16 23:26:23,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:26:23,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422869913] [2025-03-16 23:26:23,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422869913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:26:23,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:26:23,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 23:26:23,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442556173] [2025-03-16 23:26:23,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:26:23,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 23:26:23,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:26:23,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 23:26:23,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:26:23,132 INFO L87 Difference]: Start difference. First operand 84 states and 128 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-16 23:26:23,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:26:23,160 INFO L93 Difference]: Finished difference Result 195 states and 294 transitions. [2025-03-16 23:26:23,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 23:26:23,162 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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 185 [2025-03-16 23:26:23,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:26:23,163 INFO L225 Difference]: With dead ends: 195 [2025-03-16 23:26:23,163 INFO L226 Difference]: Without dead ends: 112 [2025-03-16 23:26:23,164 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-16 23:26:23,164 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 44 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:26:23,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 255 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:26:23,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-16 23:26:23,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2025-03-16 23:26:23,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 67 states have (on average 1.2835820895522387) internal successors, (86), 68 states have internal predecessors, (86), 39 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-16 23:26:23,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 164 transitions. [2025-03-16 23:26:23,184 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 164 transitions. Word has length 185 [2025-03-16 23:26:23,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:26:23,185 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 164 transitions. [2025-03-16 23:26:23,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-16 23:26:23,185 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 164 transitions. [2025-03-16 23:26:23,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-16 23:26:23,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:26:23,186 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] [2025-03-16 23:26:23,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 23:26:23,187 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:26:23,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:26:23,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1224112329, now seen corresponding path program 1 times [2025-03-16 23:26:23,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:26:23,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569258717] [2025-03-16 23:26:23,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:26:23,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:26:23,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-16 23:26:23,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-16 23:26:23,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:26:23,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:26:27,888 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-16 23:26:27,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:26:27,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569258717] [2025-03-16 23:26:27,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569258717] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:26:27,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:26:27,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-16 23:26:27,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305487383] [2025-03-16 23:26:27,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:26:27,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 23:26:27,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:26:27,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 23:26:27,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-03-16 23:26:27,890 INFO L87 Difference]: Start difference. First operand 109 states and 164 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 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-16 23:26:29,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:26:29,156 INFO L93 Difference]: Finished difference Result 178 states and 253 transitions. [2025-03-16 23:26:29,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 23:26:29,157 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 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 186 [2025-03-16 23:26:29,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:26:29,160 INFO L225 Difference]: With dead ends: 178 [2025-03-16 23:26:29,160 INFO L226 Difference]: Without dead ends: 176 [2025-03-16 23:26:29,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-03-16 23:26:29,160 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 106 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 23:26:29,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 563 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 23:26:29,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-03-16 23:26:29,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 119. [2025-03-16 23:26:29,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 77 states have (on average 1.3116883116883118) internal successors, (101), 78 states have internal predecessors, (101), 39 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-16 23:26:29,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 179 transitions. [2025-03-16 23:26:29,170 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 179 transitions. Word has length 186 [2025-03-16 23:26:29,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:26:29,171 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 179 transitions. [2025-03-16 23:26:29,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 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-16 23:26:29,171 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 179 transitions. [2025-03-16 23:26:29,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-16 23:26:29,172 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:26:29,172 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] [2025-03-16 23:26:29,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 23:26:29,172 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:26:29,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:26:29,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1224082538, now seen corresponding path program 1 times [2025-03-16 23:26:29,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:26:29,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604224800] [2025-03-16 23:26:29,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:26:29,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:26:29,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-16 23:26:29,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-16 23:26:29,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:26:29,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:26:32,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-16 23:26:32,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:26:32,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604224800] [2025-03-16 23:26:32,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604224800] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:26:32,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:26:32,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-16 23:26:32,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94056619] [2025-03-16 23:26:32,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:26:32,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 23:26:32,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:26:32,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 23:26:32,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-03-16 23:26:32,879 INFO L87 Difference]: Start difference. First operand 119 states and 179 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 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-16 23:26:34,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:26:34,208 INFO L93 Difference]: Finished difference Result 176 states and 251 transitions. [2025-03-16 23:26:34,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 23:26:34,209 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 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 186 [2025-03-16 23:26:34,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:26:34,210 INFO L225 Difference]: With dead ends: 176 [2025-03-16 23:26:34,210 INFO L226 Difference]: Without dead ends: 174 [2025-03-16 23:26:34,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-03-16 23:26:34,211 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 86 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 23:26:34,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 592 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 23:26:34,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-16 23:26:34,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 119. [2025-03-16 23:26:34,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 77 states have (on average 1.3116883116883118) internal successors, (101), 78 states have internal predecessors, (101), 39 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-16 23:26:34,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 179 transitions. [2025-03-16 23:26:34,225 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 179 transitions. Word has length 186 [2025-03-16 23:26:34,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:26:34,225 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 179 transitions. [2025-03-16 23:26:34,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 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-16 23:26:34,225 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 179 transitions. [2025-03-16 23:26:34,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-16 23:26:34,226 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:26:34,227 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] [2025-03-16 23:26:34,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 23:26:34,227 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:26:34,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:26:34,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1496550746, now seen corresponding path program 1 times [2025-03-16 23:26:34,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:26:34,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254000303] [2025-03-16 23:26:34,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:26:34,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:26:34,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-16 23:26:34,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-16 23:26:34,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:26:34,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:26:43,967 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-16 23:26:43,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:26:43,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254000303] [2025-03-16 23:26:43,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254000303] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:26:43,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:26:43,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-16 23:26:43,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136913772] [2025-03-16 23:26:43,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:26:43,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 23:26:43,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:26:43,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 23:26:43,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-03-16 23:26:43,969 INFO L87 Difference]: Start difference. First operand 119 states and 179 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 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-16 23:26:45,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:26:45,492 INFO L93 Difference]: Finished difference Result 179 states and 256 transitions. [2025-03-16 23:26:45,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 23:26:45,494 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 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 186 [2025-03-16 23:26:45,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:26:45,495 INFO L225 Difference]: With dead ends: 179 [2025-03-16 23:26:45,495 INFO L226 Difference]: Without dead ends: 177 [2025-03-16 23:26:45,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-03-16 23:26:45,495 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 68 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 23:26:45,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 614 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 23:26:45,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-03-16 23:26:45,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 120. [2025-03-16 23:26:45,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 78 states have (on average 1.3205128205128205) internal successors, (103), 79 states have internal predecessors, (103), 39 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-16 23:26:45,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 181 transitions. [2025-03-16 23:26:45,504 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 181 transitions. Word has length 186 [2025-03-16 23:26:45,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:26:45,505 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 181 transitions. [2025-03-16 23:26:45,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 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-16 23:26:45,505 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 181 transitions. [2025-03-16 23:26:45,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-16 23:26:45,506 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:26:45,506 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] [2025-03-16 23:26:45,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 23:26:45,506 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:26:45,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:26:45,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1525179897, now seen corresponding path program 1 times [2025-03-16 23:26:45,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:26:45,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015281866] [2025-03-16 23:26:45,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:26:45,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:26:45,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-16 23:26:45,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-16 23:26:45,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:26:45,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:26:49,351 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-16 23:26:49,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:26:49,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015281866] [2025-03-16 23:26:49,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015281866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:26:49,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:26:49,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-16 23:26:49,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842823300] [2025-03-16 23:26:49,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:26:49,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 23:26:49,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:26:49,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 23:26:49,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-03-16 23:26:49,353 INFO L87 Difference]: Start difference. First operand 120 states and 181 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 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-16 23:26:50,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:26:50,216 INFO L93 Difference]: Finished difference Result 179 states and 256 transitions. [2025-03-16 23:26:50,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 23:26:50,216 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 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 186 [2025-03-16 23:26:50,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:26:50,218 INFO L225 Difference]: With dead ends: 179 [2025-03-16 23:26:50,218 INFO L226 Difference]: Without dead ends: 177 [2025-03-16 23:26:50,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-03-16 23:26:50,218 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 71 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 23:26:50,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 619 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 23:26:50,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-03-16 23:26:50,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 120. [2025-03-16 23:26:50,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 78 states have (on average 1.3205128205128205) internal successors, (103), 79 states have internal predecessors, (103), 39 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-16 23:26:50,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 181 transitions. [2025-03-16 23:26:50,231 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 181 transitions. Word has length 186 [2025-03-16 23:26:50,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:26:50,231 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 181 transitions. [2025-03-16 23:26:50,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 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-16 23:26:50,231 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 181 transitions. [2025-03-16 23:26:50,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-16 23:26:50,232 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:26:50,232 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] [2025-03-16 23:26:50,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 23:26:50,234 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:26:50,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:26:50,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1735331066, now seen corresponding path program 1 times [2025-03-16 23:26:50,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:26:50,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596950115] [2025-03-16 23:26:50,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:26:50,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:26:50,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-16 23:26:50,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-16 23:26:50,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:26:50,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:26:53,553 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-16 23:26:53,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:26:53,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596950115] [2025-03-16 23:26:53,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596950115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:26:53,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:26:53,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-16 23:26:53,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099169955] [2025-03-16 23:26:53,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:26:53,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 23:26:53,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:26:53,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 23:26:53,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-03-16 23:26:53,554 INFO L87 Difference]: Start difference. First operand 120 states and 181 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 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-16 23:26:54,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:26:54,430 INFO L93 Difference]: Finished difference Result 193 states and 274 transitions. [2025-03-16 23:26:54,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 23:26:54,431 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 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 186 [2025-03-16 23:26:54,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:26:54,432 INFO L225 Difference]: With dead ends: 193 [2025-03-16 23:26:54,432 INFO L226 Difference]: Without dead ends: 191 [2025-03-16 23:26:54,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2025-03-16 23:26:54,433 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 107 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 23:26:54,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 610 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 23:26:54,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-03-16 23:26:54,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 121. [2025-03-16 23:26:54,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 79 states have (on average 1.3291139240506329) internal successors, (105), 80 states have internal predecessors, (105), 39 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-16 23:26:54,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 183 transitions. [2025-03-16 23:26:54,447 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 183 transitions. Word has length 186 [2025-03-16 23:26:54,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:26:54,448 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 183 transitions. [2025-03-16 23:26:54,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 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-16 23:26:54,448 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 183 transitions. [2025-03-16 23:26:54,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-16 23:26:54,449 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:26:54,449 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] [2025-03-16 23:26:54,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 23:26:54,449 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:26:54,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:26:54,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1538817561, now seen corresponding path program 1 times [2025-03-16 23:26:54,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:26:54,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828974272] [2025-03-16 23:26:54,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:26:54,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:26:54,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-16 23:26:54,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-16 23:26:54,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:26:54,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:26:56,469 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-16 23:26:56,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:26:56,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828974272] [2025-03-16 23:26:56,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828974272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:26:56,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:26:56,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 23:26:56,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485498807] [2025-03-16 23:26:56,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:26:56,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 23:26:56,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:26:56,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 23:26:56,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-16 23:26:56,471 INFO L87 Difference]: Start difference. First operand 121 states and 183 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 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-16 23:26:56,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:26:56,901 INFO L93 Difference]: Finished difference Result 315 states and 460 transitions. [2025-03-16 23:26:56,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 23:26:56,905 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 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 186 [2025-03-16 23:26:56,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:26:56,906 INFO L225 Difference]: With dead ends: 315 [2025-03-16 23:26:56,906 INFO L226 Difference]: Without dead ends: 195 [2025-03-16 23:26:56,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2025-03-16 23:26:56,907 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 141 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 23:26:56,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 527 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 23:26:56,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-03-16 23:26:56,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 131. [2025-03-16 23:26:56,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 89 states have (on average 1.3370786516853932) internal successors, (119), 90 states have internal predecessors, (119), 39 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-16 23:26:56,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 197 transitions. [2025-03-16 23:26:56,914 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 197 transitions. Word has length 186 [2025-03-16 23:26:56,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:26:56,915 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 197 transitions. [2025-03-16 23:26:56,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 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-16 23:26:56,915 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 197 transitions. [2025-03-16 23:26:56,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-16 23:26:56,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:26:56,916 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] [2025-03-16 23:26:56,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 23:26:56,916 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:26:56,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:26:56,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1317319771, now seen corresponding path program 1 times [2025-03-16 23:26:56,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:26:56,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251907601] [2025-03-16 23:26:56,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:26:56,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:26:56,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-16 23:26:56,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-16 23:26:56,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:26:56,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:26:59,348 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-16 23:26:59,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:26:59,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251907601] [2025-03-16 23:26:59,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251907601] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:26:59,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:26:59,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-16 23:26:59,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408418993] [2025-03-16 23:26:59,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:26:59,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 23:26:59,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:26:59,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 23:26:59,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-03-16 23:26:59,350 INFO L87 Difference]: Start difference. First operand 131 states and 197 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 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-16 23:27:00,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:27:00,005 INFO L93 Difference]: Finished difference Result 209 states and 298 transitions. [2025-03-16 23:27:00,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 23:27:00,006 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 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 186 [2025-03-16 23:27:00,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:27:00,007 INFO L225 Difference]: With dead ends: 209 [2025-03-16 23:27:00,007 INFO L226 Difference]: Without dead ends: 207 [2025-03-16 23:27:00,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2025-03-16 23:27:00,008 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 124 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 23:27:00,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 672 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 23:27:00,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-03-16 23:27:00,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 142. [2025-03-16 23:27:00,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 100 states have (on average 1.34) internal successors, (134), 101 states have internal predecessors, (134), 39 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-16 23:27:00,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 212 transitions. [2025-03-16 23:27:00,016 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 212 transitions. Word has length 186 [2025-03-16 23:27:00,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:27:00,018 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 212 transitions. [2025-03-16 23:27:00,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 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-16 23:27:00,018 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 212 transitions. [2025-03-16 23:27:00,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-16 23:27:00,019 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:27:00,019 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] [2025-03-16 23:27:00,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 23:27:00,019 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:27:00,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:27:00,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1234837190, now seen corresponding path program 1 times [2025-03-16 23:27:00,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:27:00,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853340849] [2025-03-16 23:27:00,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:27:00,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:27:00,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-16 23:27:00,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-16 23:27:00,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:27:00,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:27:07,009 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-16 23:27:07,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:27:07,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853340849] [2025-03-16 23:27:07,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853340849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:27:07,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:27:07,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-16 23:27:07,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030959752] [2025-03-16 23:27:07,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:27:07,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 23:27:07,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:27:07,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 23:27:07,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-03-16 23:27:07,012 INFO L87 Difference]: Start difference. First operand 142 states and 212 transitions. Second operand has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 1 states have call successors, (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-16 23:27:09,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:27:09,622 INFO L93 Difference]: Finished difference Result 213 states and 303 transitions. [2025-03-16 23:27:09,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 23:27:09,623 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 1 states have call successors, (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 186 [2025-03-16 23:27:09,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:27:09,624 INFO L225 Difference]: With dead ends: 213 [2025-03-16 23:27:09,624 INFO L226 Difference]: Without dead ends: 211 [2025-03-16 23:27:09,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2025-03-16 23:27:09,625 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 109 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-16 23:27:09,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 811 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-16 23:27:09,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-03-16 23:27:09,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 142. [2025-03-16 23:27:09,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 100 states have (on average 1.34) internal successors, (134), 101 states have internal predecessors, (134), 39 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-16 23:27:09,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 212 transitions. [2025-03-16 23:27:09,634 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 212 transitions. Word has length 186 [2025-03-16 23:27:09,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:27:09,635 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 212 transitions. [2025-03-16 23:27:09,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 1 states have call successors, (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-16 23:27:09,635 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 212 transitions. [2025-03-16 23:27:09,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-16 23:27:09,635 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:27:09,636 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] [2025-03-16 23:27:09,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 23:27:09,636 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:27:09,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:27:09,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1729670954, now seen corresponding path program 1 times [2025-03-16 23:27:09,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:27:09,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139355627] [2025-03-16 23:27:09,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:27:09,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:27:09,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-16 23:27:09,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-16 23:27:09,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:27:09,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:27:12,073 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-16 23:27:12,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:27:12,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139355627] [2025-03-16 23:27:12,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139355627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:27:12,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:27:12,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-16 23:27:12,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417125680] [2025-03-16 23:27:12,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:27:12,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 23:27:12,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:27:12,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 23:27:12,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-03-16 23:27:12,075 INFO L87 Difference]: Start difference. First operand 142 states and 212 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 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-16 23:27:13,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:27:13,198 INFO L93 Difference]: Finished difference Result 201 states and 286 transitions. [2025-03-16 23:27:13,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 23:27:13,200 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 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 186 [2025-03-16 23:27:13,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:27:13,201 INFO L225 Difference]: With dead ends: 201 [2025-03-16 23:27:13,201 INFO L226 Difference]: Without dead ends: 199 [2025-03-16 23:27:13,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-03-16 23:27:13,202 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 84 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:27:13,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 697 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 23:27:13,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-03-16 23:27:13,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 149. [2025-03-16 23:27:13,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 107 states have (on average 1.3457943925233644) internal successors, (144), 108 states have internal predecessors, (144), 39 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-16 23:27:13,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 222 transitions. [2025-03-16 23:27:13,213 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 222 transitions. Word has length 186 [2025-03-16 23:27:13,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:27:13,213 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 222 transitions. [2025-03-16 23:27:13,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 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-16 23:27:13,213 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 222 transitions. [2025-03-16 23:27:13,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-16 23:27:13,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:27:13,214 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] [2025-03-16 23:27:13,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 23:27:13,215 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:27:13,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:27:13,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1729641163, now seen corresponding path program 1 times [2025-03-16 23:27:13,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:27:13,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754868771] [2025-03-16 23:27:13,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:27:13,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:27:13,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-16 23:27:13,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-16 23:27:13,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:27:13,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:27:15,466 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-16 23:27:15,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:27:15,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754868771] [2025-03-16 23:27:15,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754868771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:27:15,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:27:15,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-16 23:27:15,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109279782] [2025-03-16 23:27:15,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:27:15,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 23:27:15,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:27:15,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 23:27:15,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-03-16 23:27:15,468 INFO L87 Difference]: Start difference. First operand 149 states and 222 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 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-16 23:27:16,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:27:16,835 INFO L93 Difference]: Finished difference Result 199 states and 284 transitions. [2025-03-16 23:27:16,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 23:27:16,835 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 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 186 [2025-03-16 23:27:16,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:27:16,837 INFO L225 Difference]: With dead ends: 199 [2025-03-16 23:27:16,837 INFO L226 Difference]: Without dead ends: 197 [2025-03-16 23:27:16,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-03-16 23:27:16,837 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 92 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 23:27:16,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 579 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 23:27:16,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-03-16 23:27:16,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 146. [2025-03-16 23:27:16,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 104 states have (on average 1.3365384615384615) internal successors, (139), 105 states have internal predecessors, (139), 39 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-16 23:27:16,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 217 transitions. [2025-03-16 23:27:16,843 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 217 transitions. Word has length 186 [2025-03-16 23:27:16,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:27:16,844 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 217 transitions. [2025-03-16 23:27:16,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 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-16 23:27:16,844 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 217 transitions. [2025-03-16 23:27:16,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-16 23:27:16,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:27:16,845 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] [2025-03-16 23:27:16,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 23:27:16,845 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:27:16,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:27:16,845 INFO L85 PathProgramCache]: Analyzing trace with hash 990992121, now seen corresponding path program 1 times [2025-03-16 23:27:16,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:27:16,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108539815] [2025-03-16 23:27:16,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:27:16,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:27:16,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-16 23:27:16,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-16 23:27:16,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:27:16,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:27:19,055 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-16 23:27:19,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:27:19,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108539815] [2025-03-16 23:27:19,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108539815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:27:19,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:27:19,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-16 23:27:19,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976997806] [2025-03-16 23:27:19,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:27:19,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 23:27:19,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:27:19,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 23:27:19,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-03-16 23:27:19,056 INFO L87 Difference]: Start difference. First operand 146 states and 217 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 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-16 23:27:19,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:27:19,606 INFO L93 Difference]: Finished difference Result 202 states and 289 transitions. [2025-03-16 23:27:19,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 23:27:19,607 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 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 186 [2025-03-16 23:27:19,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:27:19,608 INFO L225 Difference]: With dead ends: 202 [2025-03-16 23:27:19,608 INFO L226 Difference]: Without dead ends: 200 [2025-03-16 23:27:19,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-03-16 23:27:19,608 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 83 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 23:27:19,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 584 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 23:27:19,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-03-16 23:27:19,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 147. [2025-03-16 23:27:19,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 105 states have (on average 1.3428571428571427) internal successors, (141), 106 states have internal predecessors, (141), 39 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-16 23:27:19,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 219 transitions. [2025-03-16 23:27:19,615 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 219 transitions. Word has length 186 [2025-03-16 23:27:19,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:27:19,615 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 219 transitions. [2025-03-16 23:27:19,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 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-16 23:27:19,615 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 219 transitions. [2025-03-16 23:27:19,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-16 23:27:19,616 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:27:19,616 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] [2025-03-16 23:27:19,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 23:27:19,617 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:27:19,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:27:19,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1019621272, now seen corresponding path program 1 times [2025-03-16 23:27:19,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:27:19,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129975705] [2025-03-16 23:27:19,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:27:19,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:27:19,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-16 23:27:19,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-16 23:27:19,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:27:19,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:27:21,543 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-16 23:27:21,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:27:21,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129975705] [2025-03-16 23:27:21,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129975705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:27:21,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:27:21,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-16 23:27:21,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922121783] [2025-03-16 23:27:21,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:27:21,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 23:27:21,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:27:21,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 23:27:21,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-03-16 23:27:21,544 INFO L87 Difference]: Start difference. First operand 147 states and 219 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 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-16 23:27:22,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:27:22,404 INFO L93 Difference]: Finished difference Result 202 states and 289 transitions. [2025-03-16 23:27:22,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 23:27:22,405 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 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 186 [2025-03-16 23:27:22,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:27:22,406 INFO L225 Difference]: With dead ends: 202 [2025-03-16 23:27:22,406 INFO L226 Difference]: Without dead ends: 200 [2025-03-16 23:27:22,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-03-16 23:27:22,407 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 110 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 23:27:22,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 702 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 23:27:22,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-03-16 23:27:22,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 142. [2025-03-16 23:27:22,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 100 states have (on average 1.34) internal successors, (134), 101 states have internal predecessors, (134), 39 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-16 23:27:22,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 212 transitions. [2025-03-16 23:27:22,416 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 212 transitions. Word has length 186 [2025-03-16 23:27:22,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:27:22,416 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 212 transitions. [2025-03-16 23:27:22,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 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-16 23:27:22,416 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 212 transitions. [2025-03-16 23:27:22,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-16 23:27:22,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:27:22,417 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] [2025-03-16 23:27:22,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 23:27:22,417 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:27:22,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:27:22,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1229772441, now seen corresponding path program 1 times [2025-03-16 23:27:22,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:27:22,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009850415] [2025-03-16 23:27:22,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:27:22,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:27:22,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-16 23:27:22,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-16 23:27:22,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:27:22,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:27:26,307 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-16 23:27:26,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:27:26,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009850415] [2025-03-16 23:27:26,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009850415] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:27:26,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:27:26,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-16 23:27:26,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826084795] [2025-03-16 23:27:26,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:27:26,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 23:27:26,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:27:26,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 23:27:26,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-03-16 23:27:26,309 INFO L87 Difference]: Start difference. First operand 142 states and 212 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 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-16 23:27:28,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:27:28,110 INFO L93 Difference]: Finished difference Result 216 states and 307 transitions. [2025-03-16 23:27:28,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 23:27:28,111 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 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 186 [2025-03-16 23:27:28,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:27:28,112 INFO L225 Difference]: With dead ends: 216 [2025-03-16 23:27:28,112 INFO L226 Difference]: Without dead ends: 214 [2025-03-16 23:27:28,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2025-03-16 23:27:28,113 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 106 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 23:27:28,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 755 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 23:27:28,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-03-16 23:27:28,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 142. [2025-03-16 23:27:28,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 100 states have (on average 1.34) internal successors, (134), 101 states have internal predecessors, (134), 39 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-16 23:27:28,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 212 transitions. [2025-03-16 23:27:28,120 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 212 transitions. Word has length 186 [2025-03-16 23:27:28,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:27:28,121 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 212 transitions. [2025-03-16 23:27:28,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 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-16 23:27:28,121 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 212 transitions. [2025-03-16 23:27:28,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-16 23:27:28,122 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:27:28,122 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] [2025-03-16 23:27:28,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 23:27:28,122 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:27:28,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:27:28,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1033258936, now seen corresponding path program 1 times [2025-03-16 23:27:28,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:27:28,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933517213] [2025-03-16 23:27:28,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:27:28,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:27:28,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-16 23:27:28,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-16 23:27:28,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:27:28,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:27:30,347 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-16 23:27:30,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:27:30,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933517213] [2025-03-16 23:27:30,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933517213] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:27:30,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:27:30,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-16 23:27:30,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957763524] [2025-03-16 23:27:30,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:27:30,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 23:27:30,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:27:30,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 23:27:30,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-03-16 23:27:30,349 INFO L87 Difference]: Start difference. First operand 142 states and 212 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 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-16 23:27:31,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:27:31,109 INFO L93 Difference]: Finished difference Result 359 states and 522 transitions. [2025-03-16 23:27:31,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 23:27:31,110 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 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 186 [2025-03-16 23:27:31,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:27:31,111 INFO L225 Difference]: With dead ends: 359 [2025-03-16 23:27:31,111 INFO L226 Difference]: Without dead ends: 218 [2025-03-16 23:27:31,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2025-03-16 23:27:31,112 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 123 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 23:27:31,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 908 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 23:27:31,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-03-16 23:27:31,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 135. [2025-03-16 23:27:31,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 93 states have (on average 1.3333333333333333) internal successors, (124), 94 states have internal predecessors, (124), 39 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-16 23:27:31,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 202 transitions. [2025-03-16 23:27:31,120 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 202 transitions. Word has length 186 [2025-03-16 23:27:31,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:27:31,121 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 202 transitions. [2025-03-16 23:27:31,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 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-16 23:27:31,121 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 202 transitions. [2025-03-16 23:27:31,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-16 23:27:31,122 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:27:31,122 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] [2025-03-16 23:27:31,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 23:27:31,122 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:27:31,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:27:31,123 INFO L85 PathProgramCache]: Analyzing trace with hash 811761146, now seen corresponding path program 1 times [2025-03-16 23:27:31,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:27:31,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730361870] [2025-03-16 23:27:31,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:27:31,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:27:31,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-16 23:27:31,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-16 23:27:31,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:27:31,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat