./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-86.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-86.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d32ec5a50162e1277d5b8e9598dff8d55e883556c57a5fb919336a65433989f7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 23:01:29,816 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 23:01:29,871 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 23:01:29,877 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 23:01:29,877 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 23:01:29,895 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 23:01:29,896 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 23:01:29,896 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 23:01:29,896 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 23:01:29,896 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 23:01:29,896 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 23:01:29,896 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 23:01:29,897 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 23:01:29,897 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 23:01:29,897 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 23:01:29,897 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 23:01:29,897 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 23:01:29,897 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 23:01:29,897 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 23:01:29,897 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 23:01:29,897 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 23:01:29,897 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 23:01:29,898 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 23:01:29,898 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 23:01:29,898 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 23:01:29,898 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 23:01:29,898 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 23:01:29,898 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 23:01:29,898 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 23:01:29,898 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 23:01:29,899 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 23:01:29,899 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 23:01:29,899 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:01:29,899 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 23:01:29,899 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 23:01:29,899 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 23:01:29,899 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 23:01:29,899 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 23:01:29,899 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 23:01:29,899 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 23:01:29,899 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 23:01:29,899 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 23:01:29,899 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 23:01:29,900 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 -> d32ec5a50162e1277d5b8e9598dff8d55e883556c57a5fb919336a65433989f7 [2025-03-16 23:01:30,102 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 23:01:30,107 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 23:01:30,112 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 23:01:30,113 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 23:01:30,113 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 23:01:30,115 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-86.i [2025-03-16 23:01:31,252 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f97903956/b9937644905846bcbfc13876a69be34b/FLAGee416f5e1 [2025-03-16 23:01:31,482 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 23:01:31,483 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-86.i [2025-03-16 23:01:31,493 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f97903956/b9937644905846bcbfc13876a69be34b/FLAGee416f5e1 [2025-03-16 23:01:31,508 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f97903956/b9937644905846bcbfc13876a69be34b [2025-03-16 23:01:31,510 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 23:01:31,511 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 23:01:31,512 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 23:01:31,513 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 23:01:31,516 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 23:01:31,517 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:01:31" (1/1) ... [2025-03-16 23:01:31,519 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@547dfb53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:01:31, skipping insertion in model container [2025-03-16 23:01:31,519 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:01:31" (1/1) ... [2025-03-16 23:01:31,533 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 23:01:31,636 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-86.i[919,932] [2025-03-16 23:01:31,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:01:31,699 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 23:01:31,707 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-86.i[919,932] [2025-03-16 23:01:31,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:01:31,737 INFO L204 MainTranslator]: Completed translation [2025-03-16 23:01:31,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:01:31 WrapperNode [2025-03-16 23:01:31,738 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 23:01:31,739 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 23:01:31,739 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 23:01:31,739 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 23:01:31,743 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:01:31" (1/1) ... [2025-03-16 23:01:31,750 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:01:31" (1/1) ... [2025-03-16 23:01:31,774 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 118 [2025-03-16 23:01:31,774 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 23:01:31,774 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 23:01:31,775 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 23:01:31,775 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 23:01:31,782 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:01:31" (1/1) ... [2025-03-16 23:01:31,782 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:01:31" (1/1) ... [2025-03-16 23:01:31,784 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:01:31" (1/1) ... [2025-03-16 23:01:31,797 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 23:01:31,798 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:01:31" (1/1) ... [2025-03-16 23:01:31,798 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:01:31" (1/1) ... [2025-03-16 23:01:31,802 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:01:31" (1/1) ... [2025-03-16 23:01:31,803 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:01:31" (1/1) ... [2025-03-16 23:01:31,804 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:01:31" (1/1) ... [2025-03-16 23:01:31,805 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:01:31" (1/1) ... [2025-03-16 23:01:31,806 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 23:01:31,807 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 23:01:31,807 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 23:01:31,807 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 23:01:31,808 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:01:31" (1/1) ... [2025-03-16 23:01:31,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:01:31,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:01:31,832 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 23:01:31,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 23:01:31,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 23:01:31,851 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 23:01:31,851 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 23:01:31,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 23:01:31,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 23:01:31,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 23:01:31,902 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 23:01:31,904 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 23:01:32,131 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-16 23:01:32,131 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 23:01:32,138 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 23:01:32,138 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 23:01:32,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:01:32 BoogieIcfgContainer [2025-03-16 23:01:32,139 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 23:01:32,140 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 23:01:32,140 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 23:01:32,145 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 23:01:32,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:01:31" (1/3) ... [2025-03-16 23:01:32,146 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61d5fa22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:01:32, skipping insertion in model container [2025-03-16 23:01:32,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:01:31" (2/3) ... [2025-03-16 23:01:32,146 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61d5fa22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:01:32, skipping insertion in model container [2025-03-16 23:01:32,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:01:32" (3/3) ... [2025-03-16 23:01:32,147 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-86.i [2025-03-16 23:01:32,158 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 23:01:32,160 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-86.i that has 2 procedures, 46 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 23:01:32,206 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 23:01:32,215 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;@602b4082, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 23:01:32,215 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 23:01:32,218 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 28 states have (on average 1.5) internal successors, (42), 29 states have internal predecessors, (42), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-16 23:01:32,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-16 23:01:32,224 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:01:32,225 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:01:32,225 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:01:32,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:01:32,228 INFO L85 PathProgramCache]: Analyzing trace with hash -929367696, now seen corresponding path program 1 times [2025-03-16 23:01:32,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:01:32,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67623640] [2025-03-16 23:01:32,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:01:32,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:01:32,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-16 23:01:32,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-16 23:01:32,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:01:32,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:01:32,461 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-16 23:01:32,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:01:32,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67623640] [2025-03-16 23:01:32,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67623640] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:01:32,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570965299] [2025-03-16 23:01:32,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:01:32,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:01:32,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:01:32,465 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 23:01:32,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 23:01:32,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-16 23:01:32,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-16 23:01:32,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:01:32,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:01:32,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 23:01:32,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:01:32,632 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-16 23:01:32,632 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:01:32,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570965299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:01:32,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 23:01:32,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-16 23:01:32,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676010699] [2025-03-16 23:01:32,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:01:32,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 23:01:32,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:01:32,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 23:01:32,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:01:32,650 INFO L87 Difference]: Start difference. First operand has 46 states, 28 states have (on average 1.5) internal successors, (42), 29 states have internal predecessors, (42), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-16 23:01:32,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:01:32,668 INFO L93 Difference]: Finished difference Result 89 states and 157 transitions. [2025-03-16 23:01:32,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 23:01:32,669 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 94 [2025-03-16 23:01:32,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:01:32,675 INFO L225 Difference]: With dead ends: 89 [2025-03-16 23:01:32,675 INFO L226 Difference]: Without dead ends: 44 [2025-03-16 23:01:32,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:01:32,681 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:01:32,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:01:32,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-16 23:01:32,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-03-16 23:01:32,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 27 states have internal predecessors, (37), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-16 23:01:32,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 67 transitions. [2025-03-16 23:01:32,715 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 67 transitions. Word has length 94 [2025-03-16 23:01:32,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:01:32,715 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 67 transitions. [2025-03-16 23:01:32,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-16 23:01:32,716 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 67 transitions. [2025-03-16 23:01:32,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-16 23:01:32,719 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:01:32,719 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:01:32,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 23:01:32,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-16 23:01:32,920 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:01:32,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:01:32,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1630413359, now seen corresponding path program 1 times [2025-03-16 23:01:32,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:01:32,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572901462] [2025-03-16 23:01:32,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:01:32,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:01:32,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-16 23:01:32,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-16 23:01:32,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:01:32,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:01:33,196 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-16 23:01:33,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:01:33,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572901462] [2025-03-16 23:01:33,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572901462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:01:33,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:01:33,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 23:01:33,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016261255] [2025-03-16 23:01:33,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:01:33,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 23:01:33,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:01:33,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 23:01:33,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 23:01:33,198 INFO L87 Difference]: Start difference. First operand 44 states and 67 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-16 23:01:33,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:01:33,328 INFO L93 Difference]: Finished difference Result 131 states and 200 transitions. [2025-03-16 23:01:33,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 23:01:33,329 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 94 [2025-03-16 23:01:33,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:01:33,330 INFO L225 Difference]: With dead ends: 131 [2025-03-16 23:01:33,330 INFO L226 Difference]: Without dead ends: 88 [2025-03-16 23:01:33,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 23:01:33,331 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 79 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 23:01:33,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 183 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 23:01:33,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-16 23:01:33,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 75. [2025-03-16 23:01:33,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-16 23:01:33,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 115 transitions. [2025-03-16 23:01:33,354 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 115 transitions. Word has length 94 [2025-03-16 23:01:33,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:01:33,354 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 115 transitions. [2025-03-16 23:01:33,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-16 23:01:33,355 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 115 transitions. [2025-03-16 23:01:33,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-16 23:01:33,357 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:01:33,358 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:01:33,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 23:01:33,358 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:01:33,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:01:33,359 INFO L85 PathProgramCache]: Analyzing trace with hash 112396976, now seen corresponding path program 1 times [2025-03-16 23:01:33,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:01:33,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098253322] [2025-03-16 23:01:33,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:01:33,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:01:33,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-16 23:01:33,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-16 23:01:33,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:01:33,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:01:39,646 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-16 23:01:39,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:01:39,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098253322] [2025-03-16 23:01:39,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098253322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:01:39,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:01:39,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 23:01:39,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665243000] [2025-03-16 23:01:39,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:01:39,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 23:01:39,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:01:39,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 23:01:39,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-16 23:01:39,648 INFO L87 Difference]: Start difference. First operand 75 states and 115 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-16 23:01:41,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:01:41,498 INFO L93 Difference]: Finished difference Result 173 states and 256 transitions. [2025-03-16 23:01:41,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 23:01:41,498 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 94 [2025-03-16 23:01:41,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:01:41,500 INFO L225 Difference]: With dead ends: 173 [2025-03-16 23:01:41,501 INFO L226 Difference]: Without dead ends: 130 [2025-03-16 23:01:41,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-16 23:01:41,502 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 67 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 23:01:41,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 231 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 23:01:41,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-16 23:01:41,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 91. [2025-03-16 23:01:41,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 58 states have internal predecessors, (78), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-16 23:01:41,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 138 transitions. [2025-03-16 23:01:41,521 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 138 transitions. Word has length 94 [2025-03-16 23:01:41,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:01:41,522 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 138 transitions. [2025-03-16 23:01:41,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-16 23:01:41,522 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 138 transitions. [2025-03-16 23:01:41,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-16 23:01:41,524 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:01:41,525 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:01:41,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 23:01:41,525 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:01:41,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:01:41,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1695057487, now seen corresponding path program 1 times [2025-03-16 23:01:41,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:01:41,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705648637] [2025-03-16 23:01:41,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:01:41,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:01:41,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-16 23:01:41,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-16 23:01:41,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:01:41,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:01:41,584 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-16 23:01:41,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:01:41,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705648637] [2025-03-16 23:01:41,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705648637] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:01:41,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:01:41,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 23:01:41,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376753417] [2025-03-16 23:01:41,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:01:41,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 23:01:41,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:01:41,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 23:01:41,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:01:41,588 INFO L87 Difference]: Start difference. First operand 91 states and 138 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-16 23:01:41,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:01:41,619 INFO L93 Difference]: Finished difference Result 193 states and 292 transitions. [2025-03-16 23:01:41,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 23:01:41,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 94 [2025-03-16 23:01:41,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:01:41,622 INFO L225 Difference]: With dead ends: 193 [2025-03-16 23:01:41,623 INFO L226 Difference]: Without dead ends: 135 [2025-03-16 23:01:41,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:01:41,624 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 59 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:01:41,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 132 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:01:41,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-16 23:01:41,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2025-03-16 23:01:41,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 84 states have internal predecessors, (110), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-16 23:01:41,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 200 transitions. [2025-03-16 23:01:41,636 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 200 transitions. Word has length 94 [2025-03-16 23:01:41,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:01:41,637 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 200 transitions. [2025-03-16 23:01:41,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-16 23:01:41,637 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 200 transitions. [2025-03-16 23:01:41,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-16 23:01:41,638 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:01:41,638 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:01:41,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 23:01:41,638 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:01:41,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:01:41,639 INFO L85 PathProgramCache]: Analyzing trace with hash -807828939, now seen corresponding path program 1 times [2025-03-16 23:01:41,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:01:41,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487219688] [2025-03-16 23:01:41,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:01:41,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:01:41,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-16 23:01:41,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-16 23:01:41,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:01:41,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:01:47,713 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-16 23:01:47,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:01:47,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487219688] [2025-03-16 23:01:47,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487219688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:01:47,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:01:47,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 23:01:47,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808520485] [2025-03-16 23:01:47,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:01:47,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 23:01:47,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:01:47,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 23:01:47,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2025-03-16 23:01:47,715 INFO L87 Difference]: Start difference. First operand 133 states and 200 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-16 23:01:49,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:01:49,524 INFO L93 Difference]: Finished difference Result 172 states and 244 transitions. [2025-03-16 23:01:49,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 23:01:49,525 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 95 [2025-03-16 23:01:49,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:01:49,526 INFO L225 Difference]: With dead ends: 172 [2025-03-16 23:01:49,526 INFO L226 Difference]: Without dead ends: 170 [2025-03-16 23:01:49,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=67, Invalid=89, Unknown=0, NotChecked=0, Total=156 [2025-03-16 23:01:49,527 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 73 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 23:01:49,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 197 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 23:01:49,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-16 23:01:49,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 134. [2025-03-16 23:01:49,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 85 states have (on average 1.3058823529411765) internal successors, (111), 85 states have internal predecessors, (111), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-16 23:01:49,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 201 transitions. [2025-03-16 23:01:49,541 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 201 transitions. Word has length 95 [2025-03-16 23:01:49,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:01:49,542 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 201 transitions. [2025-03-16 23:01:49,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-16 23:01:49,542 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 201 transitions. [2025-03-16 23:01:49,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-16 23:01:49,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:01:49,543 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:01:49,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 23:01:49,543 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:01:49,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:01:49,544 INFO L85 PathProgramCache]: Analyzing trace with hash -719200714, now seen corresponding path program 1 times [2025-03-16 23:01:49,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:01:49,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746238101] [2025-03-16 23:01:49,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:01:49,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:01:49,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-16 23:01:49,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-16 23:01:49,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:01:49,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:01:54,696 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-16 23:01:54,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:01:54,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746238101] [2025-03-16 23:01:54,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746238101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:01:54,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:01:54,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 23:01:54,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696403577] [2025-03-16 23:01:54,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:01:54,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 23:01:54,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:01:54,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 23:01:54,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-16 23:01:54,697 INFO L87 Difference]: Start difference. First operand 134 states and 201 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-16 23:01:56,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:01:56,514 INFO L93 Difference]: Finished difference Result 176 states and 248 transitions. [2025-03-16 23:01:56,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 23:01:56,514 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 95 [2025-03-16 23:01:56,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:01:56,516 INFO L225 Difference]: With dead ends: 176 [2025-03-16 23:01:56,516 INFO L226 Difference]: Without dead ends: 174 [2025-03-16 23:01:56,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2025-03-16 23:01:56,517 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 91 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 23:01:56,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 170 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 23:01:56,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-16 23:01:56,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 136. [2025-03-16 23:01:56,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 87 states have (on average 1.3103448275862069) internal successors, (114), 87 states have internal predecessors, (114), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-16 23:01:56,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 204 transitions. [2025-03-16 23:01:56,533 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 204 transitions. Word has length 95 [2025-03-16 23:01:56,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:01:56,533 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 204 transitions. [2025-03-16 23:01:56,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-16 23:01:56,533 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 204 transitions. [2025-03-16 23:01:56,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-16 23:01:56,534 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:01:56,534 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:01:56,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 23:01:56,534 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:01:56,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:01:56,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1744238764, now seen corresponding path program 1 times [2025-03-16 23:01:56,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:01:56,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395878715] [2025-03-16 23:01:56,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:01:56,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:01:56,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-16 23:01:56,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-16 23:01:56,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:01:56,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:02:02,492 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-16 23:02:02,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:02:02,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395878715] [2025-03-16 23:02:02,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395878715] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:02:02,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:02:02,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 23:02:02,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856699324] [2025-03-16 23:02:02,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:02:02,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 23:02:02,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:02:02,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 23:02:02,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-16 23:02:02,494 INFO L87 Difference]: Start difference. First operand 136 states and 204 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-16 23:02:05,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:02:05,253 INFO L93 Difference]: Finished difference Result 184 states and 260 transitions. [2025-03-16 23:02:05,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 23:02:05,254 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 95 [2025-03-16 23:02:05,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:02:05,255 INFO L225 Difference]: With dead ends: 184 [2025-03-16 23:02:05,255 INFO L226 Difference]: Without dead ends: 182 [2025-03-16 23:02:05,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2025-03-16 23:02:05,256 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 83 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-16 23:02:05,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 253 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-16 23:02:05,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-03-16 23:02:05,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 145. [2025-03-16 23:02:05,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 96 states have (on average 1.3229166666666667) internal successors, (127), 96 states have internal predecessors, (127), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-16 23:02:05,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 217 transitions. [2025-03-16 23:02:05,273 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 217 transitions. Word has length 95 [2025-03-16 23:02:05,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:02:05,274 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 217 transitions. [2025-03-16 23:02:05,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-16 23:02:05,274 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 217 transitions. [2025-03-16 23:02:05,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-16 23:02:05,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:02:05,274 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:02:05,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 23:02:05,275 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:02:05,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:02:05,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1444632266, now seen corresponding path program 1 times [2025-03-16 23:02:05,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:02:05,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720744111] [2025-03-16 23:02:05,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:02:05,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:02:05,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-16 23:02:05,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-16 23:02:05,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:02:05,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:02:05,373 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-16 23:02:05,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:02:05,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720744111] [2025-03-16 23:02:05,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720744111] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:02:05,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:02:05,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 23:02:05,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165368156] [2025-03-16 23:02:05,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:02:05,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 23:02:05,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:02:05,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 23:02:05,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 23:02:05,375 INFO L87 Difference]: Start difference. First operand 145 states and 217 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-16 23:02:05,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:02:05,442 INFO L93 Difference]: Finished difference Result 328 states and 485 transitions. [2025-03-16 23:02:05,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 23:02:05,443 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 95 [2025-03-16 23:02:05,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:02:05,447 INFO L225 Difference]: With dead ends: 328 [2025-03-16 23:02:05,447 INFO L226 Difference]: Without dead ends: 217 [2025-03-16 23:02:05,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 23:02:05,448 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 58 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:02:05,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 201 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:02:05,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-03-16 23:02:05,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 193. [2025-03-16 23:02:05,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 128 states have (on average 1.3125) internal successors, (168), 128 states have internal predecessors, (168), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-16 23:02:05,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 288 transitions. [2025-03-16 23:02:05,465 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 288 transitions. Word has length 95 [2025-03-16 23:02:05,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:02:05,466 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 288 transitions. [2025-03-16 23:02:05,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-16 23:02:05,467 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 288 transitions. [2025-03-16 23:02:05,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-16 23:02:05,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:02:05,468 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:02:05,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 23:02:05,468 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:02:05,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:02:05,469 INFO L85 PathProgramCache]: Analyzing trace with hash -817553553, now seen corresponding path program 1 times [2025-03-16 23:02:05,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:02:05,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82046631] [2025-03-16 23:02:05,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:02:05,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:02:05,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-16 23:02:05,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-16 23:02:05,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:02:05,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:02:11,722 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-16 23:02:11,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:02:11,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82046631] [2025-03-16 23:02:11,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82046631] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:02:11,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:02:11,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-16 23:02:11,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440057090] [2025-03-16 23:02:11,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:02:11,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 23:02:11,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:02:11,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 23:02:11,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-16 23:02:11,723 INFO L87 Difference]: Start difference. First operand 193 states and 288 transitions. Second operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-16 23:02:17,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:02:17,007 INFO L93 Difference]: Finished difference Result 236 states and 338 transitions. [2025-03-16 23:02:17,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 23:02:17,008 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 96 [2025-03-16 23:02:17,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:02:17,009 INFO L225 Difference]: With dead ends: 236 [2025-03-16 23:02:17,009 INFO L226 Difference]: Without dead ends: 234 [2025-03-16 23:02:17,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=195, Invalid=357, Unknown=0, NotChecked=0, Total=552 [2025-03-16 23:02:17,010 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 159 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 23:02:17,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 185 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 23:02:17,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-03-16 23:02:17,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 192. [2025-03-16 23:02:17,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 127 states have (on average 1.3070866141732282) internal successors, (166), 127 states have internal predecessors, (166), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-16 23:02:17,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 286 transitions. [2025-03-16 23:02:17,024 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 286 transitions. Word has length 96 [2025-03-16 23:02:17,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:02:17,024 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 286 transitions. [2025-03-16 23:02:17,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-16 23:02:17,025 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 286 transitions. [2025-03-16 23:02:17,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-16 23:02:17,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:02:17,025 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:02:17,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 23:02:17,026 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:02:17,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:02:17,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1766035056, now seen corresponding path program 1 times [2025-03-16 23:02:17,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:02:17,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110673908] [2025-03-16 23:02:17,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:02:17,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:02:17,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-16 23:02:17,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-16 23:02:17,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:02:17,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:02:20,576 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-16 23:02:20,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:02:20,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110673908] [2025-03-16 23:02:20,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110673908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:02:20,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:02:20,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 23:02:20,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580038945] [2025-03-16 23:02:20,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:02:20,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 23:02:20,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:02:20,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 23:02:20,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-03-16 23:02:20,578 INFO L87 Difference]: Start difference. First operand 192 states and 286 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-16 23:02:22,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:02:22,511 INFO L93 Difference]: Finished difference Result 254 states and 359 transitions. [2025-03-16 23:02:22,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 23:02:22,512 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 96 [2025-03-16 23:02:22,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:02:22,514 INFO L225 Difference]: With dead ends: 254 [2025-03-16 23:02:22,514 INFO L226 Difference]: Without dead ends: 252 [2025-03-16 23:02:22,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=79, Invalid=103, Unknown=0, NotChecked=0, Total=182 [2025-03-16 23:02:22,515 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 63 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 23:02:22,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 224 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 23:02:22,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-03-16 23:02:22,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 194. [2025-03-16 23:02:22,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 129 states have (on average 1.302325581395349) internal successors, (168), 129 states have internal predecessors, (168), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-16 23:02:22,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 288 transitions. [2025-03-16 23:02:22,532 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 288 transitions. Word has length 96 [2025-03-16 23:02:22,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:02:22,533 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 288 transitions. [2025-03-16 23:02:22,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-16 23:02:22,533 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 288 transitions. [2025-03-16 23:02:22,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-16 23:02:22,533 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:02:22,534 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:02:22,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 23:02:22,534 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:02:22,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:02:22,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1854633490, now seen corresponding path program 1 times [2025-03-16 23:02:22,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:02:22,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072882878] [2025-03-16 23:02:22,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:02:22,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:02:22,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-16 23:02:22,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-16 23:02:22,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:02:22,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:02:25,989 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-16 23:02:25,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:02:25,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072882878] [2025-03-16 23:02:25,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072882878] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:02:25,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:02:25,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 23:02:25,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481387084] [2025-03-16 23:02:25,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:02:25,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 23:02:25,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:02:25,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 23:02:25,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-16 23:02:25,990 INFO L87 Difference]: Start difference. First operand 194 states and 288 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-16 23:02:28,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:02:28,491 INFO L93 Difference]: Finished difference Result 282 states and 391 transitions. [2025-03-16 23:02:28,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 23:02:28,491 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 96 [2025-03-16 23:02:28,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:02:28,493 INFO L225 Difference]: With dead ends: 282 [2025-03-16 23:02:28,493 INFO L226 Difference]: Without dead ends: 280 [2025-03-16 23:02:28,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2025-03-16 23:02:28,493 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 151 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 23:02:28,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 210 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 23:02:28,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-03-16 23:02:28,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 246. [2025-03-16 23:02:28,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 169 states have (on average 1.2899408284023668) internal successors, (218), 171 states have internal predecessors, (218), 68 states have call successors, (68), 8 states have call predecessors, (68), 8 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-16 23:02:28,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 354 transitions. [2025-03-16 23:02:28,509 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 354 transitions. Word has length 96 [2025-03-16 23:02:28,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:02:28,509 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 354 transitions. [2025-03-16 23:02:28,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-16 23:02:28,509 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 354 transitions. [2025-03-16 23:02:28,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-16 23:02:28,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:02:28,510 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:02:28,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 23:02:28,510 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:02:28,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:02:28,510 INFO L85 PathProgramCache]: Analyzing trace with hash -269489073, now seen corresponding path program 1 times [2025-03-16 23:02:28,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:02:28,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88365425] [2025-03-16 23:02:28,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:02:28,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:02:28,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-16 23:02:28,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-16 23:02:28,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:02:28,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:02:31,646 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-16 23:02:31,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:02:31,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88365425] [2025-03-16 23:02:31,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88365425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:02:31,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:02:31,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 23:02:31,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659023988] [2025-03-16 23:02:31,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:02:31,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 23:02:31,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:02:31,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 23:02:31,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2025-03-16 23:02:31,647 INFO L87 Difference]: Start difference. First operand 246 states and 354 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-16 23:02:33,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:02:33,672 INFO L93 Difference]: Finished difference Result 328 states and 457 transitions. [2025-03-16 23:02:33,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 23:02:33,673 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 96 [2025-03-16 23:02:33,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:02:33,675 INFO L225 Difference]: With dead ends: 328 [2025-03-16 23:02:33,675 INFO L226 Difference]: Without dead ends: 326 [2025-03-16 23:02:33,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2025-03-16 23:02:33,676 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 88 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-16 23:02:33,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 336 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-16 23:02:33,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-03-16 23:02:33,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 262. [2025-03-16 23:02:33,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 185 states have (on average 1.308108108108108) internal successors, (242), 187 states have internal predecessors, (242), 68 states have call successors, (68), 8 states have call predecessors, (68), 8 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-16 23:02:33,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 378 transitions. [2025-03-16 23:02:33,692 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 378 transitions. Word has length 96 [2025-03-16 23:02:33,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:02:33,692 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 378 transitions. [2025-03-16 23:02:33,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-16 23:02:33,692 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 378 transitions. [2025-03-16 23:02:33,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-16 23:02:33,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:02:33,693 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:02:33,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 23:02:33,693 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:02:33,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:02:33,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1661925234, now seen corresponding path program 1 times [2025-03-16 23:02:33,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:02:33,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546799146] [2025-03-16 23:02:33,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:02:33,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:02:33,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 23:02:33,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 23:02:33,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:02:33,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:02:37,546 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-16 23:02:37,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:02:37,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546799146] [2025-03-16 23:02:37,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546799146] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:02:37,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:02:37,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-16 23:02:37,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279112795] [2025-03-16 23:02:37,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:02:37,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 23:02:37,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:02:37,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 23:02:37,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-03-16 23:02:37,547 INFO L87 Difference]: Start difference. First operand 262 states and 378 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-16 23:02:42,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:02:42,625 INFO L93 Difference]: Finished difference Result 294 states and 410 transitions. [2025-03-16 23:02:42,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 23:02:42,627 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 97 [2025-03-16 23:02:42,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:02:42,629 INFO L225 Difference]: With dead ends: 294 [2025-03-16 23:02:42,629 INFO L226 Difference]: Without dead ends: 292 [2025-03-16 23:02:42,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=185, Invalid=367, Unknown=0, NotChecked=0, Total=552 [2025-03-16 23:02:42,629 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 185 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-16 23:02:42,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 202 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-16 23:02:42,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-03-16 23:02:42,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 260. [2025-03-16 23:02:42,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 183 states have (on average 1.3005464480874316) internal successors, (238), 185 states have internal predecessors, (238), 68 states have call successors, (68), 8 states have call predecessors, (68), 8 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-16 23:02:42,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 374 transitions. [2025-03-16 23:02:42,665 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 374 transitions. Word has length 97 [2025-03-16 23:02:42,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:02:42,665 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 374 transitions. [2025-03-16 23:02:42,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-16 23:02:42,665 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 374 transitions. [2025-03-16 23:02:42,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-16 23:02:42,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:02:42,668 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:02:42,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 23:02:42,668 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:02:42,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:02:42,669 INFO L85 PathProgramCache]: Analyzing trace with hash 238635221, now seen corresponding path program 1 times [2025-03-16 23:02:42,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:02:42,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868483940] [2025-03-16 23:02:42,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:02:42,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:02:42,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 23:02:42,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 23:02:42,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:02:42,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:02:50,448 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-16 23:02:50,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:02:50,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868483940] [2025-03-16 23:02:50,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868483940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:02:50,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:02:50,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-16 23:02:50,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753895348] [2025-03-16 23:02:50,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:02:50,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 23:02:50,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:02:50,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 23:02:50,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-03-16 23:02:50,449 INFO L87 Difference]: Start difference. First operand 260 states and 374 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-16 23:02:58,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:02:58,254 INFO L93 Difference]: Finished difference Result 342 states and 470 transitions. [2025-03-16 23:02:58,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 23:02:58,255 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 97 [2025-03-16 23:02:58,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:02:58,257 INFO L225 Difference]: With dead ends: 342 [2025-03-16 23:02:58,257 INFO L226 Difference]: Without dead ends: 340 [2025-03-16 23:02:58,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=229, Invalid=421, Unknown=0, NotChecked=0, Total=650 [2025-03-16 23:02:58,257 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 184 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 23:02:58,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 150 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 23:02:58,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2025-03-16 23:02:58,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 262. [2025-03-16 23:02:58,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 185 states have (on average 1.2972972972972974) internal successors, (240), 187 states have internal predecessors, (240), 68 states have call successors, (68), 8 states have call predecessors, (68), 8 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-16 23:02:58,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 376 transitions. [2025-03-16 23:02:58,275 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 376 transitions. Word has length 97 [2025-03-16 23:02:58,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:02:58,275 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 376 transitions. [2025-03-16 23:02:58,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-16 23:02:58,275 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 376 transitions. [2025-03-16 23:02:58,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-16 23:02:58,276 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:02:58,276 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:02:58,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 23:02:58,276 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:02:58,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:02:58,277 INFO L85 PathProgramCache]: Analyzing trace with hash 327233655, now seen corresponding path program 1 times [2025-03-16 23:02:58,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:02:58,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389918408] [2025-03-16 23:02:58,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:02:58,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:02:58,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 23:02:58,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 23:02:58,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:02:58,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:03:05,977 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-16 23:03:05,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:03:05,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389918408] [2025-03-16 23:03:05,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389918408] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:03:05,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:03:05,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-16 23:03:05,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93047000] [2025-03-16 23:03:05,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:03:05,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 23:03:05,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:03:05,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 23:03:05,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-03-16 23:03:05,978 INFO L87 Difference]: Start difference. First operand 262 states and 376 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15)