./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-81.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_fillercode_fillercodestructure_filler-pr-co_file-81.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 d402cd14beee6851ca97c58b2a2589220820214ac9c394c1c5bdac6dbc1a1025 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 01:50:25,651 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 01:50:25,719 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 01:50:25,724 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 01:50:25,725 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 01:50:25,746 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 01:50:25,747 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 01:50:25,747 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 01:50:25,747 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 01:50:25,748 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 01:50:25,748 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 01:50:25,749 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 01:50:25,749 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 01:50:25,749 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 01:50:25,749 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 01:50:25,750 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 01:50:25,750 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 01:50:25,750 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 01:50:25,750 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 01:50:25,750 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 01:50:25,750 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 01:50:25,750 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 01:50:25,750 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 01:50:25,750 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 01:50:25,750 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 01:50:25,750 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 01:50:25,750 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 01:50:25,751 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 01:50:25,751 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 01:50:25,751 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 01:50:25,751 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 01:50:25,751 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 01:50:25,751 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:50:25,751 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 01:50:25,752 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 01:50:25,752 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 01:50:25,752 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 01:50:25,752 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 01:50:25,752 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 01:50:25,752 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 01:50:25,752 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 01:50:25,752 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 01:50:25,752 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 01:50:25,752 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 -> d402cd14beee6851ca97c58b2a2589220820214ac9c394c1c5bdac6dbc1a1025 [2025-03-17 01:50:25,995 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 01:50:26,001 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 01:50:26,003 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 01:50:26,004 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 01:50:26,004 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 01:50:26,005 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-81.i [2025-03-17 01:50:27,166 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd537e662/63499b39a7844d02a726d44d54ebf2c7/FLAG9754c6bbc [2025-03-17 01:50:27,390 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 01:50:27,391 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-81.i [2025-03-17 01:50:27,408 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd537e662/63499b39a7844d02a726d44d54ebf2c7/FLAG9754c6bbc [2025-03-17 01:50:27,431 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd537e662/63499b39a7844d02a726d44d54ebf2c7 [2025-03-17 01:50:27,433 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 01:50:27,434 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 01:50:27,435 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 01:50:27,435 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 01:50:27,439 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 01:50:27,440 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:50:27" (1/1) ... [2025-03-17 01:50:27,442 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e3f5dff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:50:27, skipping insertion in model container [2025-03-17 01:50:27,442 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:50:27" (1/1) ... [2025-03-17 01:50:27,461 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 01:50:27,568 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-81.i[919,932] [2025-03-17 01:50:27,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:50:27,663 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 01:50:27,673 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-81.i[919,932] [2025-03-17 01:50:27,714 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:50:27,729 INFO L204 MainTranslator]: Completed translation [2025-03-17 01:50:27,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:50:27 WrapperNode [2025-03-17 01:50:27,730 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 01:50:27,731 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 01:50:27,731 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 01:50:27,731 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 01:50:27,735 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:50:27" (1/1) ... [2025-03-17 01:50:27,745 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:50:27" (1/1) ... [2025-03-17 01:50:27,781 INFO L138 Inliner]: procedures = 26, calls = 61, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 299 [2025-03-17 01:50:27,782 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 01:50:27,782 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 01:50:27,782 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 01:50:27,782 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 01:50:27,788 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:50:27" (1/1) ... [2025-03-17 01:50:27,788 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:50:27" (1/1) ... [2025-03-17 01:50:27,794 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:50:27" (1/1) ... [2025-03-17 01:50:27,818 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 01:50:27,819 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:50:27" (1/1) ... [2025-03-17 01:50:27,820 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:50:27" (1/1) ... [2025-03-17 01:50:27,833 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:50:27" (1/1) ... [2025-03-17 01:50:27,835 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:50:27" (1/1) ... [2025-03-17 01:50:27,839 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:50:27" (1/1) ... [2025-03-17 01:50:27,843 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:50:27" (1/1) ... [2025-03-17 01:50:27,848 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 01:50:27,850 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 01:50:27,850 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 01:50:27,850 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 01:50:27,851 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:50:27" (1/1) ... [2025-03-17 01:50:27,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:50:27,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:50:27,876 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 01:50:27,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 01:50:27,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 01:50:27,898 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 01:50:27,898 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 01:50:27,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 01:50:27,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 01:50:27,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 01:50:27,970 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 01:50:27,972 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 01:50:28,372 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L220: havoc property_#t~bitwise33#1;havoc property_#t~short34#1; [2025-03-17 01:50:28,418 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-17 01:50:28,418 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 01:50:28,438 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 01:50:28,438 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 01:50:28,438 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:50:28 BoogieIcfgContainer [2025-03-17 01:50:28,438 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 01:50:28,440 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 01:50:28,442 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 01:50:28,445 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 01:50:28,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 01:50:27" (1/3) ... [2025-03-17 01:50:28,446 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5652e17d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:50:28, skipping insertion in model container [2025-03-17 01:50:28,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:50:27" (2/3) ... [2025-03-17 01:50:28,446 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5652e17d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:50:28, skipping insertion in model container [2025-03-17 01:50:28,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:50:28" (3/3) ... [2025-03-17 01:50:28,446 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-81.i [2025-03-17 01:50:28,457 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 01:50:28,460 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-81.i that has 2 procedures, 126 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 01:50:28,504 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 01:50:28,511 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;@53385a19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 01:50:28,512 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 01:50:28,515 INFO L276 IsEmpty]: Start isEmpty. Operand has 126 states, 75 states have (on average 1.44) internal successors, (108), 76 states have internal predecessors, (108), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-17 01:50:28,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2025-03-17 01:50:28,541 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:50:28,542 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:50:28,542 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:50:28,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:50:28,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1741064452, now seen corresponding path program 1 times [2025-03-17 01:50:28,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:50:28,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266525650] [2025-03-17 01:50:28,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:50:28,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:50:28,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-03-17 01:50:28,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-03-17 01:50:28,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:50:28,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:50:28,878 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 4418 trivial. 0 not checked. [2025-03-17 01:50:28,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:50:28,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266525650] [2025-03-17 01:50:28,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266525650] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:50:28,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483926111] [2025-03-17 01:50:28,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:50:28,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:50:28,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:50:28,884 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 01:50:28,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 01:50:28,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-03-17 01:50:29,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-03-17 01:50:29,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:50:29,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:50:29,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 01:50:29,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:50:29,120 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 4418 trivial. 0 not checked. [2025-03-17 01:50:29,120 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:50:29,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483926111] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:50:29,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 01:50:29,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 01:50:29,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094923532] [2025-03-17 01:50:29,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:50:29,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 01:50:29,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:50:29,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 01:50:29,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 01:50:29,147 INFO L87 Difference]: Start difference. First operand has 126 states, 75 states have (on average 1.44) internal successors, (108), 76 states have internal predecessors, (108), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) Second operand has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (48), 2 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2025-03-17 01:50:29,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:50:29,181 INFO L93 Difference]: Finished difference Result 249 states and 454 transitions. [2025-03-17 01:50:29,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 01:50:29,182 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (48), 2 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) Word has length 292 [2025-03-17 01:50:29,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:50:29,187 INFO L225 Difference]: With dead ends: 249 [2025-03-17 01:50:29,187 INFO L226 Difference]: Without dead ends: 124 [2025-03-17 01:50:29,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 01:50:29,192 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:50:29,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 196 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:50:29,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-03-17 01:50:29,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2025-03-17 01:50:29,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 74 states have (on average 1.4054054054054055) internal successors, (104), 74 states have internal predecessors, (104), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-17 01:50:29,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 200 transitions. [2025-03-17 01:50:29,248 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 200 transitions. Word has length 292 [2025-03-17 01:50:29,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:50:29,249 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 200 transitions. [2025-03-17 01:50:29,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (48), 2 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2025-03-17 01:50:29,249 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 200 transitions. [2025-03-17 01:50:29,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2025-03-17 01:50:29,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:50:29,255 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:50:29,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 01:50:29,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 01:50:29,456 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:50:29,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:50:29,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1402675064, now seen corresponding path program 1 times [2025-03-17 01:50:29,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:50:29,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016323567] [2025-03-17 01:50:29,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:50:29,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:50:29,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-03-17 01:50:29,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-03-17 01:50:29,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:50:29,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:50:32,016 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-17 01:50:32,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:50:32,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016323567] [2025-03-17 01:50:32,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016323567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:50:32,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:50:32,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 01:50:32,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206559423] [2025-03-17 01:50:32,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:50:32,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 01:50:32,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:50:32,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 01:50:32,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-17 01:50:32,021 INFO L87 Difference]: Start difference. First operand 124 states and 200 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-17 01:50:33,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:50:33,105 INFO L93 Difference]: Finished difference Result 552 states and 889 transitions. [2025-03-17 01:50:33,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 01:50:33,106 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 292 [2025-03-17 01:50:33,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:50:33,113 INFO L225 Difference]: With dead ends: 552 [2025-03-17 01:50:33,113 INFO L226 Difference]: Without dead ends: 429 [2025-03-17 01:50:33,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2025-03-17 01:50:33,116 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 1311 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1311 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 01:50:33,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1311 Valid, 888 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 01:50:33,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2025-03-17 01:50:33,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 223. [2025-03-17 01:50:33,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 124 states have (on average 1.3629032258064515) internal successors, (169), 124 states have internal predecessors, (169), 96 states have call successors, (96), 2 states have call predecessors, (96), 2 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-17 01:50:33,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 361 transitions. [2025-03-17 01:50:33,169 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 361 transitions. Word has length 292 [2025-03-17 01:50:33,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:50:33,171 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 361 transitions. [2025-03-17 01:50:33,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-17 01:50:33,172 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 361 transitions. [2025-03-17 01:50:33,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2025-03-17 01:50:33,175 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:50:33,175 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:50:33,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 01:50:33,176 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:50:33,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:50:33,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1538982535, now seen corresponding path program 1 times [2025-03-17 01:50:33,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:50:33,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928484811] [2025-03-17 01:50:33,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:50:33,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:50:33,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-03-17 01:50:33,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-03-17 01:50:33,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:50:33,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:50:44,472 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-17 01:50:44,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:50:44,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928484811] [2025-03-17 01:50:44,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928484811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:50:44,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:50:44,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 01:50:44,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816274541] [2025-03-17 01:50:44,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:50:44,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 01:50:44,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:50:44,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 01:50:44,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-17 01:50:44,474 INFO L87 Difference]: Start difference. First operand 223 states and 361 transitions. Second operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-17 01:50:48,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:50:48,824 INFO L93 Difference]: Finished difference Result 584 states and 942 transitions. [2025-03-17 01:50:48,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 01:50:48,825 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 292 [2025-03-17 01:50:48,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:50:48,828 INFO L225 Difference]: With dead ends: 584 [2025-03-17 01:50:48,828 INFO L226 Difference]: Without dead ends: 461 [2025-03-17 01:50:48,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=148, Invalid=404, Unknown=0, NotChecked=0, Total=552 [2025-03-17 01:50:48,829 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 1379 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1379 SdHoareTripleChecker+Valid, 1018 SdHoareTripleChecker+Invalid, 1026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-17 01:50:48,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1379 Valid, 1018 Invalid, 1026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 877 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-17 01:50:48,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2025-03-17 01:50:48,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 263. [2025-03-17 01:50:48,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 164 states have (on average 1.4451219512195121) internal successors, (237), 164 states have internal predecessors, (237), 96 states have call successors, (96), 2 states have call predecessors, (96), 2 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-17 01:50:48,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 429 transitions. [2025-03-17 01:50:48,864 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 429 transitions. Word has length 292 [2025-03-17 01:50:48,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:50:48,865 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 429 transitions. [2025-03-17 01:50:48,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-17 01:50:48,866 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 429 transitions. [2025-03-17 01:50:48,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2025-03-17 01:50:48,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:50:48,869 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:50:48,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 01:50:48,869 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:50:48,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:50:48,870 INFO L85 PathProgramCache]: Analyzing trace with hash -2044541160, now seen corresponding path program 1 times [2025-03-17 01:50:48,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:50:48,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353309835] [2025-03-17 01:50:48,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:50:48,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:50:48,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-03-17 01:50:48,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-03-17 01:50:48,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:50:48,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:50:49,090 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-17 01:50:49,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:50:49,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353309835] [2025-03-17 01:50:49,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353309835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:50:49,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:50:49,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 01:50:49,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969495373] [2025-03-17 01:50:49,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:50:49,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 01:50:49,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:50:49,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 01:50:49,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 01:50:49,094 INFO L87 Difference]: Start difference. First operand 263 states and 429 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-17 01:50:49,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:50:49,161 INFO L93 Difference]: Finished difference Result 453 states and 733 transitions. [2025-03-17 01:50:49,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 01:50:49,161 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 292 [2025-03-17 01:50:49,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:50:49,165 INFO L225 Difference]: With dead ends: 453 [2025-03-17 01:50:49,167 INFO L226 Difference]: Without dead ends: 323 [2025-03-17 01:50:49,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 01:50:49,168 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 71 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 01:50:49,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 577 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 01:50:49,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2025-03-17 01:50:49,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 320. [2025-03-17 01:50:49,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 216 states have (on average 1.4675925925925926) internal successors, (317), 217 states have internal predecessors, (317), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-17 01:50:49,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 517 transitions. [2025-03-17 01:50:49,190 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 517 transitions. Word has length 292 [2025-03-17 01:50:49,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:50:49,190 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 517 transitions. [2025-03-17 01:50:49,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-17 01:50:49,191 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 517 transitions. [2025-03-17 01:50:49,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2025-03-17 01:50:49,193 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:50:49,193 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:50:49,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 01:50:49,193 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:50:49,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:50:49,194 INFO L85 PathProgramCache]: Analyzing trace with hash 405602711, now seen corresponding path program 1 times [2025-03-17 01:50:49,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:50:49,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449863159] [2025-03-17 01:50:49,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:50:49,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:50:49,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-03-17 01:50:49,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-03-17 01:50:49,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:50:49,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:50:50,436 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-17 01:50:50,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:50:50,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449863159] [2025-03-17 01:50:50,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449863159] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:50:50,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:50:50,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 01:50:50,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007415078] [2025-03-17 01:50:50,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:50:50,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 01:50:50,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:50:50,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 01:50:50,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-17 01:50:50,438 INFO L87 Difference]: Start difference. First operand 320 states and 517 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2025-03-17 01:50:51,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:50:51,627 INFO L93 Difference]: Finished difference Result 773 states and 1245 transitions. [2025-03-17 01:50:51,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 01:50:51,627 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) Word has length 292 [2025-03-17 01:50:51,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:50:51,635 INFO L225 Difference]: With dead ends: 773 [2025-03-17 01:50:51,635 INFO L226 Difference]: Without dead ends: 600 [2025-03-17 01:50:51,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2025-03-17 01:50:51,636 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 822 mSDsluCounter, 1075 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 1297 SdHoareTripleChecker+Invalid, 1052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 01:50:51,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [822 Valid, 1297 Invalid, 1052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 01:50:51,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2025-03-17 01:50:51,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 331. [2025-03-17 01:50:51,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 227 states have (on average 1.4801762114537445) internal successors, (336), 228 states have internal predecessors, (336), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-17 01:50:51,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 536 transitions. [2025-03-17 01:50:51,667 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 536 transitions. Word has length 292 [2025-03-17 01:50:51,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:50:51,667 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 536 transitions. [2025-03-17 01:50:51,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2025-03-17 01:50:51,668 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 536 transitions. [2025-03-17 01:50:51,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2025-03-17 01:50:51,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:50:51,670 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:50:51,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 01:50:51,670 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:50:51,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:50:51,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1758912408, now seen corresponding path program 1 times [2025-03-17 01:50:51,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:50:51,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048916521] [2025-03-17 01:50:51,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:50:51,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:50:51,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-03-17 01:50:51,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-03-17 01:50:51,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:50:51,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:50:53,447 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-17 01:50:53,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:50:53,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048916521] [2025-03-17 01:50:53,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048916521] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:50:53,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:50:53,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 01:50:53,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501103638] [2025-03-17 01:50:53,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:50:53,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 01:50:53,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:50:53,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 01:50:53,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-17 01:50:53,449 INFO L87 Difference]: Start difference. First operand 331 states and 536 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-17 01:50:55,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:50:55,075 INFO L93 Difference]: Finished difference Result 785 states and 1261 transitions. [2025-03-17 01:50:55,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 01:50:55,075 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 292 [2025-03-17 01:50:55,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:50:55,078 INFO L225 Difference]: With dead ends: 785 [2025-03-17 01:50:55,079 INFO L226 Difference]: Without dead ends: 574 [2025-03-17 01:50:55,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-17 01:50:55,080 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 563 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 870 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 1026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 01:50:55,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 1000 Invalid, 1026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 870 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 01:50:55,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2025-03-17 01:50:55,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 361. [2025-03-17 01:50:55,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 257 states have (on average 1.4863813229571985) internal successors, (382), 258 states have internal predecessors, (382), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-17 01:50:55,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 582 transitions. [2025-03-17 01:50:55,103 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 582 transitions. Word has length 292 [2025-03-17 01:50:55,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:50:55,104 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 582 transitions. [2025-03-17 01:50:55,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-17 01:50:55,104 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 582 transitions. [2025-03-17 01:50:55,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2025-03-17 01:50:55,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:50:55,105 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:50:55,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 01:50:55,106 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:50:55,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:50:55,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1614025977, now seen corresponding path program 1 times [2025-03-17 01:50:55,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:50:55,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407579837] [2025-03-17 01:50:55,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:50:55,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:50:55,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-03-17 01:50:55,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-03-17 01:50:55,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:50:55,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:50:56,177 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-17 01:50:56,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:50:56,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407579837] [2025-03-17 01:50:56,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407579837] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:50:56,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:50:56,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 01:50:56,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748861035] [2025-03-17 01:50:56,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:50:56,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 01:50:56,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:50:56,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 01:50:56,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-17 01:50:56,179 INFO L87 Difference]: Start difference. First operand 361 states and 582 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-17 01:50:56,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:50:56,857 INFO L93 Difference]: Finished difference Result 915 states and 1460 transitions. [2025-03-17 01:50:56,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 01:50:56,857 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 292 [2025-03-17 01:50:56,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:50:56,860 INFO L225 Difference]: With dead ends: 915 [2025-03-17 01:50:56,861 INFO L226 Difference]: Without dead ends: 742 [2025-03-17 01:50:56,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-03-17 01:50:56,863 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 745 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 01:50:56,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 970 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 01:50:56,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2025-03-17 01:50:56,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 376. [2025-03-17 01:50:56,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 272 states have (on average 1.5036764705882353) internal successors, (409), 273 states have internal predecessors, (409), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-17 01:50:56,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 609 transitions. [2025-03-17 01:50:56,895 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 609 transitions. Word has length 292 [2025-03-17 01:50:56,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:50:56,895 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 609 transitions. [2025-03-17 01:50:56,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-17 01:50:56,895 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 609 transitions. [2025-03-17 01:50:56,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2025-03-17 01:50:56,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:50:56,897 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:50:56,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 01:50:56,897 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:50:56,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:50:56,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1327631622, now seen corresponding path program 1 times [2025-03-17 01:50:56,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:50:56,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991469054] [2025-03-17 01:50:56,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:50:56,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:50:56,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-03-17 01:50:56,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-03-17 01:50:56,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:50:56,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:51:03,332 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-17 01:51:03,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:51:03,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991469054] [2025-03-17 01:51:03,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991469054] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:51:03,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:51:03,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 01:51:03,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021655094] [2025-03-17 01:51:03,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:51:03,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 01:51:03,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:51:03,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 01:51:03,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-17 01:51:03,334 INFO L87 Difference]: Start difference. First operand 376 states and 609 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-17 01:51:04,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:51:04,734 INFO L93 Difference]: Finished difference Result 636 states and 1018 transitions. [2025-03-17 01:51:04,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 01:51:04,735 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 292 [2025-03-17 01:51:04,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:51:04,737 INFO L225 Difference]: With dead ends: 636 [2025-03-17 01:51:04,737 INFO L226 Difference]: Without dead ends: 463 [2025-03-17 01:51:04,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-17 01:51:04,739 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 467 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 01:51:04,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 637 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 01:51:04,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2025-03-17 01:51:04,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 384. [2025-03-17 01:51:04,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 280 states have (on average 1.5107142857142857) internal successors, (423), 281 states have internal predecessors, (423), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-17 01:51:04,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 623 transitions. [2025-03-17 01:51:04,769 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 623 transitions. Word has length 292 [2025-03-17 01:51:04,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:51:04,769 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 623 transitions. [2025-03-17 01:51:04,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-17 01:51:04,769 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 623 transitions. [2025-03-17 01:51:04,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2025-03-17 01:51:04,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:51:04,771 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:51:04,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 01:51:04,771 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:51:04,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:51:04,772 INFO L85 PathProgramCache]: Analyzing trace with hash 616953624, now seen corresponding path program 1 times [2025-03-17 01:51:04,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:51:04,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128174076] [2025-03-17 01:51:04,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:51:04,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:51:04,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-03-17 01:51:04,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-03-17 01:51:04,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:51:04,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:51:05,596 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-17 01:51:05,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:51:05,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128174076] [2025-03-17 01:51:05,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128174076] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:51:05,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:51:05,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 01:51:05,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396847035] [2025-03-17 01:51:05,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:51:05,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 01:51:05,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:51:05,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 01:51:05,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 01:51:05,598 INFO L87 Difference]: Start difference. First operand 384 states and 623 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-17 01:51:06,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:51:06,701 INFO L93 Difference]: Finished difference Result 796 states and 1275 transitions. [2025-03-17 01:51:06,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 01:51:06,702 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 292 [2025-03-17 01:51:06,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:51:06,705 INFO L225 Difference]: With dead ends: 796 [2025-03-17 01:51:06,705 INFO L226 Difference]: Without dead ends: 600 [2025-03-17 01:51:06,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2025-03-17 01:51:06,706 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 557 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 1095 SdHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 01:51:06,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 1095 Invalid, 1031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 885 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 01:51:06,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2025-03-17 01:51:06,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 388. [2025-03-17 01:51:06,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 284 states have (on average 1.5140845070422535) internal successors, (430), 285 states have internal predecessors, (430), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-17 01:51:06,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 630 transitions. [2025-03-17 01:51:06,731 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 630 transitions. Word has length 292 [2025-03-17 01:51:06,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:51:06,732 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 630 transitions. [2025-03-17 01:51:06,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-17 01:51:06,732 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 630 transitions. [2025-03-17 01:51:06,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2025-03-17 01:51:06,733 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:51:06,733 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:51:06,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 01:51:06,733 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:51:06,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:51:06,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1970263321, now seen corresponding path program 1 times [2025-03-17 01:51:06,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:51:06,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911532785] [2025-03-17 01:51:06,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:51:06,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:51:06,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-03-17 01:51:06,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-03-17 01:51:06,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:51:06,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:51:07,156 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-17 01:51:07,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:51:07,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911532785] [2025-03-17 01:51:07,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911532785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:51:07,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:51:07,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 01:51:07,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999978189] [2025-03-17 01:51:07,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:51:07,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 01:51:07,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:51:07,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 01:51:07,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 01:51:07,158 INFO L87 Difference]: Start difference. First operand 388 states and 630 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-17 01:51:07,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:51:07,691 INFO L93 Difference]: Finished difference Result 842 states and 1359 transitions. [2025-03-17 01:51:07,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 01:51:07,691 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 292 [2025-03-17 01:51:07,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:51:07,694 INFO L225 Difference]: With dead ends: 842 [2025-03-17 01:51:07,695 INFO L226 Difference]: Without dead ends: 601 [2025-03-17 01:51:07,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-03-17 01:51:07,696 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 354 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 01:51:07,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 764 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 01:51:07,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-03-17 01:51:07,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 391. [2025-03-17 01:51:07,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 287 states have (on average 1.5121951219512195) internal successors, (434), 288 states have internal predecessors, (434), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-17 01:51:07,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 634 transitions. [2025-03-17 01:51:07,723 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 634 transitions. Word has length 292 [2025-03-17 01:51:07,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:51:07,724 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 634 transitions. [2025-03-17 01:51:07,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-17 01:51:07,724 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 634 transitions. [2025-03-17 01:51:07,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2025-03-17 01:51:07,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:51:07,725 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:51:07,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 01:51:07,726 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:51:07,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:51:07,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1008626742, now seen corresponding path program 1 times [2025-03-17 01:51:07,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:51:07,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035593604] [2025-03-17 01:51:07,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:51:07,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:51:07,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-03-17 01:51:07,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-03-17 01:51:07,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:51:07,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:51:15,186 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-17 01:51:15,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:51:15,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035593604] [2025-03-17 01:51:15,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035593604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:51:15,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:51:15,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 01:51:15,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118210240] [2025-03-17 01:51:15,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:51:15,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 01:51:15,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:51:15,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 01:51:15,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-17 01:51:15,188 INFO L87 Difference]: Start difference. First operand 391 states and 634 transitions. Second operand has 13 states, 12 states have (on average 4.666666666666667) internal successors, (56), 13 states have internal predecessors, (56), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2025-03-17 01:51:16,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:51:16,817 INFO L93 Difference]: Finished difference Result 961 states and 1528 transitions. [2025-03-17 01:51:16,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 01:51:16,818 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.666666666666667) internal successors, (56), 13 states have internal predecessors, (56), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) Word has length 293 [2025-03-17 01:51:16,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:51:16,821 INFO L225 Difference]: With dead ends: 961 [2025-03-17 01:51:16,821 INFO L226 Difference]: Without dead ends: 765 [2025-03-17 01:51:16,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=148, Invalid=404, Unknown=0, NotChecked=0, Total=552 [2025-03-17 01:51:16,823 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 711 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 01:51:16,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 1198 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 860 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 01:51:16,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2025-03-17 01:51:16,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 408. [2025-03-17 01:51:16,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 304 states have (on average 1.5328947368421053) internal successors, (466), 305 states have internal predecessors, (466), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-17 01:51:16,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 666 transitions. [2025-03-17 01:51:16,850 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 666 transitions. Word has length 293 [2025-03-17 01:51:16,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:51:16,850 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 666 transitions. [2025-03-17 01:51:16,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.666666666666667) internal successors, (56), 13 states have internal predecessors, (56), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2025-03-17 01:51:16,850 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 666 transitions. [2025-03-17 01:51:16,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2025-03-17 01:51:16,851 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:51:16,852 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:51:16,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 01:51:16,853 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:51:16,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:51:16,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1514185367, now seen corresponding path program 1 times [2025-03-17 01:51:16,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:51:16,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40057773] [2025-03-17 01:51:16,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:51:16,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:51:16,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-03-17 01:51:16,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-03-17 01:51:16,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:51:16,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:51:20,667 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-17 01:51:20,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:51:20,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40057773] [2025-03-17 01:51:20,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40057773] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:51:20,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:51:20,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 01:51:20,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213866011] [2025-03-17 01:51:20,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:51:20,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 01:51:20,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:51:20,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 01:51:20,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-17 01:51:20,669 INFO L87 Difference]: Start difference. First operand 408 states and 666 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-17 01:51:21,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:51:21,326 INFO L93 Difference]: Finished difference Result 849 states and 1366 transitions. [2025-03-17 01:51:21,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 01:51:21,327 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 293 [2025-03-17 01:51:21,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:51:21,330 INFO L225 Difference]: With dead ends: 849 [2025-03-17 01:51:21,330 INFO L226 Difference]: Without dead ends: 653 [2025-03-17 01:51:21,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-17 01:51:21,332 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 253 mSDsluCounter, 892 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 1107 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 01:51:21,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 1107 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 01:51:21,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2025-03-17 01:51:21,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 462. [2025-03-17 01:51:21,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 358 states have (on average 1.558659217877095) internal successors, (558), 359 states have internal predecessors, (558), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-17 01:51:21,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 758 transitions. [2025-03-17 01:51:21,357 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 758 transitions. Word has length 293 [2025-03-17 01:51:21,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:51:21,358 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 758 transitions. [2025-03-17 01:51:21,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-17 01:51:21,358 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 758 transitions. [2025-03-17 01:51:21,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2025-03-17 01:51:21,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:51:21,359 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:51:21,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 01:51:21,360 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:51:21,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:51:21,360 INFO L85 PathProgramCache]: Analyzing trace with hash -797275829, now seen corresponding path program 1 times [2025-03-17 01:51:21,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:51:21,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922405357] [2025-03-17 01:51:21,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:51:21,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:51:21,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-03-17 01:51:21,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-03-17 01:51:21,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:51:21,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:51:28,105 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-17 01:51:28,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:51:28,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922405357] [2025-03-17 01:51:28,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922405357] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:51:28,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:51:28,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 01:51:28,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032757963] [2025-03-17 01:51:28,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:51:28,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 01:51:28,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:51:28,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 01:51:28,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-17 01:51:28,107 INFO L87 Difference]: Start difference. First operand 462 states and 758 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-17 01:51:29,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:51:29,036 INFO L93 Difference]: Finished difference Result 820 states and 1324 transitions. [2025-03-17 01:51:29,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 01:51:29,037 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 293 [2025-03-17 01:51:29,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:51:29,040 INFO L225 Difference]: With dead ends: 820 [2025-03-17 01:51:29,040 INFO L226 Difference]: Without dead ends: 592 [2025-03-17 01:51:29,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-17 01:51:29,041 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 382 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 01:51:29,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 585 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 01:51:29,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-03-17 01:51:29,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 446. [2025-03-17 01:51:29,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 342 states have (on average 1.543859649122807) internal successors, (528), 343 states have internal predecessors, (528), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-17 01:51:29,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 728 transitions. [2025-03-17 01:51:29,069 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 728 transitions. Word has length 293 [2025-03-17 01:51:29,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:51:29,070 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 728 transitions. [2025-03-17 01:51:29,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-17 01:51:29,070 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 728 transitions. [2025-03-17 01:51:29,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2025-03-17 01:51:29,071 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:51:29,071 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:51:29,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 01:51:29,072 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:51:29,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:51:29,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1866024104, now seen corresponding path program 1 times [2025-03-17 01:51:29,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:51:29,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638734023] [2025-03-17 01:51:29,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:51:29,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:51:29,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-03-17 01:51:29,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-03-17 01:51:29,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:51:29,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:51:29,222 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-17 01:51:29,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:51:29,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638734023] [2025-03-17 01:51:29,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638734023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:51:29,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:51:29,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 01:51:29,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983371415] [2025-03-17 01:51:29,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:51:29,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 01:51:29,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:51:29,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 01:51:29,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 01:51:29,225 INFO L87 Difference]: Start difference. First operand 446 states and 728 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-17 01:51:29,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:51:29,298 INFO L93 Difference]: Finished difference Result 760 states and 1227 transitions. [2025-03-17 01:51:29,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 01:51:29,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 293 [2025-03-17 01:51:29,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:51:29,302 INFO L225 Difference]: With dead ends: 760 [2025-03-17 01:51:29,302 INFO L226 Difference]: Without dead ends: 526 [2025-03-17 01:51:29,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 01:51:29,303 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 123 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 01:51:29,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 652 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 01:51:29,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-03-17 01:51:29,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 441. [2025-03-17 01:51:29,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 340 states have (on average 1.5529411764705883) internal successors, (528), 340 states have internal predecessors, (528), 96 states have call successors, (96), 4 states have call predecessors, (96), 4 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-17 01:51:29,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 720 transitions. [2025-03-17 01:51:29,330 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 720 transitions. Word has length 293 [2025-03-17 01:51:29,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:51:29,331 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 720 transitions. [2025-03-17 01:51:29,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-17 01:51:29,331 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 720 transitions. [2025-03-17 01:51:29,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2025-03-17 01:51:29,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:51:29,333 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:51:29,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 01:51:29,333 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:51:29,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:51:29,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1360465479, now seen corresponding path program 1 times [2025-03-17 01:51:29,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:51:29,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561029335] [2025-03-17 01:51:29,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:51:29,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:51:29,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-03-17 01:51:29,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-03-17 01:51:29,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:51:29,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:51:30,832 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-17 01:51:30,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:51:30,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561029335] [2025-03-17 01:51:30,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561029335] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:51:30,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:51:30,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 01:51:30,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129900357] [2025-03-17 01:51:30,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:51:30,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 01:51:30,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:51:30,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 01:51:30,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-17 01:51:30,833 INFO L87 Difference]: Start difference. First operand 441 states and 720 transitions. Second operand has 13 states, 12 states have (on average 4.666666666666667) internal successors, (56), 13 states have internal predecessors, (56), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2025-03-17 01:51:32,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:51:32,092 INFO L93 Difference]: Finished difference Result 991 states and 1579 transitions. [2025-03-17 01:51:32,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 01:51:32,092 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.666666666666667) internal successors, (56), 13 states have internal predecessors, (56), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) Word has length 293 [2025-03-17 01:51:32,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:51:32,096 INFO L225 Difference]: With dead ends: 991 [2025-03-17 01:51:32,096 INFO L226 Difference]: Without dead ends: 776 [2025-03-17 01:51:32,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=181, Invalid=469, Unknown=0, NotChecked=0, Total=650 [2025-03-17 01:51:32,098 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 971 mSDsluCounter, 1153 mSDsCounter, 0 mSdLazyCounter, 1023 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 971 SdHoareTripleChecker+Valid, 1390 SdHoareTripleChecker+Invalid, 1276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 1023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 01:51:32,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [971 Valid, 1390 Invalid, 1276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 1023 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 01:51:32,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2025-03-17 01:51:32,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 454. [2025-03-17 01:51:32,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 353 states have (on average 1.5552407932011332) internal successors, (549), 353 states have internal predecessors, (549), 96 states have call successors, (96), 4 states have call predecessors, (96), 4 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-17 01:51:32,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 741 transitions. [2025-03-17 01:51:32,127 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 741 transitions. Word has length 293 [2025-03-17 01:51:32,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:51:32,127 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 741 transitions. [2025-03-17 01:51:32,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.666666666666667) internal successors, (56), 13 states have internal predecessors, (56), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2025-03-17 01:51:32,128 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 741 transitions. [2025-03-17 01:51:32,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2025-03-17 01:51:32,129 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:51:32,129 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:51:32,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 01:51:32,129 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:51:32,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:51:32,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1581192120, now seen corresponding path program 1 times [2025-03-17 01:51:32,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:51:32,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488816940] [2025-03-17 01:51:32,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:51:32,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:51:32,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-03-17 01:51:32,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-03-17 01:51:32,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:51:32,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:51:39,106 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-17 01:51:39,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:51:39,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488816940] [2025-03-17 01:51:39,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488816940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:51:39,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:51:39,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 01:51:39,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208337453] [2025-03-17 01:51:39,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:51:39,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 01:51:39,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:51:39,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 01:51:39,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2025-03-17 01:51:39,108 INFO L87 Difference]: Start difference. First operand 454 states and 741 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-17 01:51:39,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:51:39,824 INFO L93 Difference]: Finished difference Result 831 states and 1345 transitions. [2025-03-17 01:51:39,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 01:51:39,824 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 293 [2025-03-17 01:51:39,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:51:39,827 INFO L225 Difference]: With dead ends: 831 [2025-03-17 01:51:39,827 INFO L226 Difference]: Without dead ends: 616 [2025-03-17 01:51:39,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2025-03-17 01:51:39,828 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 408 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 1072 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 01:51:39,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 1072 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 01:51:39,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2025-03-17 01:51:39,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 463. [2025-03-17 01:51:39,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 362 states have (on average 1.5607734806629834) internal successors, (565), 362 states have internal predecessors, (565), 96 states have call successors, (96), 4 states have call predecessors, (96), 4 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-17 01:51:39,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 757 transitions. [2025-03-17 01:51:39,854 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 757 transitions. Word has length 293 [2025-03-17 01:51:39,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:51:39,855 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 757 transitions. [2025-03-17 01:51:39,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-17 01:51:39,855 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 757 transitions. [2025-03-17 01:51:39,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2025-03-17 01:51:39,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:51:39,856 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:51:39,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 01:51:39,856 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:51:39,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:51:39,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1651558760, now seen corresponding path program 1 times [2025-03-17 01:51:39,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:51:39,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698491099] [2025-03-17 01:51:39,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:51:39,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:51:39,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-03-17 01:51:39,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-03-17 01:51:39,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:51:39,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:51:40,634 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-17 01:51:40,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:51:40,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698491099] [2025-03-17 01:51:40,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698491099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:51:40,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:51:40,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 01:51:40,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277567097] [2025-03-17 01:51:40,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:51:40,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 01:51:40,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:51:40,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 01:51:40,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-17 01:51:40,636 INFO L87 Difference]: Start difference. First operand 463 states and 757 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-17 01:51:41,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:51:41,734 INFO L93 Difference]: Finished difference Result 1020 states and 1656 transitions. [2025-03-17 01:51:41,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 01:51:41,734 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 293 [2025-03-17 01:51:41,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:51:41,738 INFO L225 Difference]: With dead ends: 1020 [2025-03-17 01:51:41,738 INFO L226 Difference]: Without dead ends: 781 [2025-03-17 01:51:41,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2025-03-17 01:51:41,739 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 612 mSDsluCounter, 1035 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 347 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 1393 SdHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 347 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 01:51:41,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [612 Valid, 1393 Invalid, 946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [347 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 01:51:41,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2025-03-17 01:51:41,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 439. [2025-03-17 01:51:41,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 338 states have (on average 1.5502958579881656) internal successors, (524), 338 states have internal predecessors, (524), 96 states have call successors, (96), 4 states have call predecessors, (96), 4 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-17 01:51:41,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 716 transitions. [2025-03-17 01:51:41,771 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 716 transitions. Word has length 293 [2025-03-17 01:51:41,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:51:41,771 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 716 transitions. [2025-03-17 01:51:41,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-17 01:51:41,772 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 716 transitions. [2025-03-17 01:51:41,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2025-03-17 01:51:41,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:51:41,773 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:51:41,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 01:51:41,773 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:51:41,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:51:41,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1271608790, now seen corresponding path program 1 times [2025-03-17 01:51:41,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:51:41,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710109760] [2025-03-17 01:51:41,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:51:41,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:51:41,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-03-17 01:51:41,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-03-17 01:51:41,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:51:41,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:51:42,184 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-17 01:51:42,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:51:42,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710109760] [2025-03-17 01:51:42,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710109760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:51:42,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:51:42,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 01:51:42,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330940515] [2025-03-17 01:51:42,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:51:42,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 01:51:42,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:51:42,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 01:51:42,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 01:51:42,186 INFO L87 Difference]: Start difference. First operand 439 states and 716 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-17 01:51:42,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:51:42,639 INFO L93 Difference]: Finished difference Result 707 states and 1153 transitions. [2025-03-17 01:51:42,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 01:51:42,640 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 294 [2025-03-17 01:51:42,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:51:42,642 INFO L225 Difference]: With dead ends: 707 [2025-03-17 01:51:42,642 INFO L226 Difference]: Without dead ends: 467 [2025-03-17 01:51:42,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-17 01:51:42,643 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 187 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 01:51:42,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 797 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 01:51:42,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2025-03-17 01:51:42,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 401. [2025-03-17 01:51:42,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 300 states have (on average 1.5333333333333334) internal successors, (460), 300 states have internal predecessors, (460), 96 states have call successors, (96), 4 states have call predecessors, (96), 4 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-17 01:51:42,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 652 transitions. [2025-03-17 01:51:42,675 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 652 transitions. Word has length 294 [2025-03-17 01:51:42,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:51:42,676 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 652 transitions. [2025-03-17 01:51:42,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-17 01:51:42,676 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 652 transitions. [2025-03-17 01:51:42,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2025-03-17 01:51:42,677 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:51:42,677 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:51:42,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 01:51:42,677 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:51:42,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:51:42,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1975101655, now seen corresponding path program 1 times [2025-03-17 01:51:42,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:51:42,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760917321] [2025-03-17 01:51:42,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:51:42,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:51:42,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-03-17 01:51:42,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-03-17 01:51:42,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:51:42,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat