./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-81.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-81.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c37c06019a2f7252c23194b0baf4adc5534d367e32a3abf21b53b0028081fdaa --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 01:39:20,710 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 01:39:20,767 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 01:39:20,774 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 01:39:20,777 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 01:39:20,797 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 01:39:20,798 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 01:39:20,798 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 01:39:20,798 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 01:39:20,798 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 01:39:20,798 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 01:39:20,798 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 01:39:20,799 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 01:39:20,799 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 01:39:20,799 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 01:39:20,799 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 01:39:20,799 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 01:39:20,799 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 01:39:20,799 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 01:39:20,799 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 01:39:20,799 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 01:39:20,799 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 01:39:20,799 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 01:39:20,799 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 01:39:20,799 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 01:39:20,799 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 01:39:20,800 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 01:39:20,800 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 01:39:20,800 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 01:39:20,800 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 01:39:20,800 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 01:39:20,800 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 01:39:20,800 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:39:20,800 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 01:39:20,800 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 01:39:20,800 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 01:39:20,800 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 01:39:20,800 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 01:39:20,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 01:39:20,802 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 01:39:20,802 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 01:39:20,802 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 01:39:20,802 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 01:39:20,803 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 -> c37c06019a2f7252c23194b0baf4adc5534d367e32a3abf21b53b0028081fdaa [2025-03-17 01:39:21,081 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 01:39:21,090 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 01:39:21,092 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 01:39:21,093 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 01:39:21,094 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 01:39:21,095 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-81.i [2025-03-17 01:39:22,366 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab5e6fbe6/1dcc49ef88074f248c2d76d32f217e16/FLAGdcdd4e153 [2025-03-17 01:39:22,587 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 01:39:22,587 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-81.i [2025-03-17 01:39:22,598 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab5e6fbe6/1dcc49ef88074f248c2d76d32f217e16/FLAGdcdd4e153 [2025-03-17 01:39:22,611 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab5e6fbe6/1dcc49ef88074f248c2d76d32f217e16 [2025-03-17 01:39:22,613 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 01:39:22,614 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 01:39:22,618 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 01:39:22,618 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 01:39:22,622 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 01:39:22,623 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:39:22" (1/1) ... [2025-03-17 01:39:22,625 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@757a14f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:39:22, skipping insertion in model container [2025-03-17 01:39:22,629 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:39:22" (1/1) ... [2025-03-17 01:39:22,654 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 01:39:22,763 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-81.i[919,932] [2025-03-17 01:39:22,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:39:22,858 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 01:39:22,871 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-81.i[919,932] [2025-03-17 01:39:22,915 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:39:22,930 INFO L204 MainTranslator]: Completed translation [2025-03-17 01:39:22,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:39:22 WrapperNode [2025-03-17 01:39:22,932 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 01:39:22,933 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 01:39:22,933 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 01:39:22,933 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 01:39:22,938 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:39:22" (1/1) ... [2025-03-17 01:39:22,951 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:39:22" (1/1) ... [2025-03-17 01:39:22,980 INFO L138 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 305 [2025-03-17 01:39:22,980 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 01:39:22,981 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 01:39:22,981 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 01:39:22,981 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 01:39:22,988 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:39:22" (1/1) ... [2025-03-17 01:39:22,989 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:39:22" (1/1) ... [2025-03-17 01:39:22,995 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:39:22" (1/1) ... [2025-03-17 01:39:23,028 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 01:39:23,028 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:39:22" (1/1) ... [2025-03-17 01:39:23,028 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:39:22" (1/1) ... [2025-03-17 01:39:23,039 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:39:22" (1/1) ... [2025-03-17 01:39:23,044 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:39:22" (1/1) ... [2025-03-17 01:39:23,046 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:39:22" (1/1) ... [2025-03-17 01:39:23,051 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:39:22" (1/1) ... [2025-03-17 01:39:23,057 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 01:39:23,058 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 01:39:23,059 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 01:39:23,059 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 01:39:23,060 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:39:22" (1/1) ... [2025-03-17 01:39:23,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:39:23,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:39:23,085 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 01:39:23,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 01:39:23,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 01:39:23,104 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 01:39:23,104 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 01:39:23,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 01:39:23,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 01:39:23,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 01:39:23,169 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 01:39:23,172 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 01:39:23,634 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L224: havoc property_#t~bitwise34#1;havoc property_#t~short35#1; [2025-03-17 01:39:23,684 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-17 01:39:23,685 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 01:39:23,705 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 01:39:23,706 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 01:39:23,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:39:23 BoogieIcfgContainer [2025-03-17 01:39:23,706 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 01:39:23,711 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 01:39:23,711 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 01:39:23,715 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 01:39:23,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 01:39:22" (1/3) ... [2025-03-17 01:39:23,715 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32a52e79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:39:23, skipping insertion in model container [2025-03-17 01:39:23,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:39:22" (2/3) ... [2025-03-17 01:39:23,715 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32a52e79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:39:23, skipping insertion in model container [2025-03-17 01:39:23,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:39:23" (3/3) ... [2025-03-17 01:39:23,716 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-81.i [2025-03-17 01:39:23,728 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 01:39:23,729 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-81.i that has 2 procedures, 129 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 01:39:23,782 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 01:39:23,791 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;@51edf931, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 01:39:23,791 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 01:39:23,795 INFO L276 IsEmpty]: Start isEmpty. Operand has 129 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 77 states have internal predecessors, (109), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-17 01:39:23,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2025-03-17 01:39:23,808 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:39:23,808 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:39:23,809 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:39:23,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:39:23,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1290845361, now seen corresponding path program 1 times [2025-03-17 01:39:23,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:39:23,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270736303] [2025-03-17 01:39:23,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:39:23,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:39:23,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-03-17 01:39:23,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-03-17 01:39:23,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:39:23,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:39:24,124 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 4802 trivial. 0 not checked. [2025-03-17 01:39:24,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:39:24,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270736303] [2025-03-17 01:39:24,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270736303] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:39:24,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705066357] [2025-03-17 01:39:24,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:39:24,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:39:24,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:39:24,133 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 01:39:24,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 01:39:24,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-03-17 01:39:24,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-03-17 01:39:24,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:39:24,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:39:24,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 679 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 01:39:24,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:39:24,377 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 4802 trivial. 0 not checked. [2025-03-17 01:39:24,378 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:39:24,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705066357] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:39:24,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 01:39:24,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 01:39:24,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352887776] [2025-03-17 01:39:24,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:39:24,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 01:39:24,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:39:24,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 01:39:24,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 01:39:24,404 INFO L87 Difference]: Start difference. First operand has 129 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 77 states have internal predecessors, (109), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (50), 2 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-17 01:39:24,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:39:24,461 INFO L93 Difference]: Finished difference Result 255 states and 466 transitions. [2025-03-17 01:39:24,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 01:39:24,464 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (50), 2 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) Word has length 303 [2025-03-17 01:39:24,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:39:24,471 INFO L225 Difference]: With dead ends: 255 [2025-03-17 01:39:24,471 INFO L226 Difference]: Without dead ends: 127 [2025-03-17 01:39:24,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 01:39:24,479 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:39:24,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 201 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:39:24,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-17 01:39:24,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-03-17 01:39:24,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 75 states have (on average 1.4) internal successors, (105), 75 states have internal predecessors, (105), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-17 01:39:24,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 205 transitions. [2025-03-17 01:39:24,528 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 205 transitions. Word has length 303 [2025-03-17 01:39:24,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:39:24,528 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 205 transitions. [2025-03-17 01:39:24,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (50), 2 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-17 01:39:24,529 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 205 transitions. [2025-03-17 01:39:24,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2025-03-17 01:39:24,537 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:39:24,538 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:39:24,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 01:39:24,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 01:39:24,739 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:39:24,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:39:24,739 INFO L85 PathProgramCache]: Analyzing trace with hash -858196181, now seen corresponding path program 1 times [2025-03-17 01:39:24,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:39:24,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445875241] [2025-03-17 01:39:24,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:39:24,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:39:24,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-03-17 01:39:24,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-03-17 01:39:24,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:39:24,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:39:25,696 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-17 01:39:25,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:39:25,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445875241] [2025-03-17 01:39:25,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445875241] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:39:25,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:39:25,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 01:39:25,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178413290] [2025-03-17 01:39:25,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:39:25,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 01:39:25,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:39:25,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 01:39:25,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 01:39:25,701 INFO L87 Difference]: Start difference. First operand 127 states and 205 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 01:39:26,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:39:26,032 INFO L93 Difference]: Finished difference Result 380 states and 615 transitions. [2025-03-17 01:39:26,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 01:39:26,034 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 303 [2025-03-17 01:39:26,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:39:26,039 INFO L225 Difference]: With dead ends: 380 [2025-03-17 01:39:26,039 INFO L226 Difference]: Without dead ends: 254 [2025-03-17 01:39:26,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 01:39:26,043 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 114 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 01:39:26,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 545 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 01:39:26,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-03-17 01:39:26,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 252. [2025-03-17 01:39:26,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 149 states have (on average 1.4026845637583893) internal successors, (209), 149 states have internal predecessors, (209), 100 states have call successors, (100), 2 states have call predecessors, (100), 2 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-17 01:39:26,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 409 transitions. [2025-03-17 01:39:26,113 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 409 transitions. Word has length 303 [2025-03-17 01:39:26,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:39:26,116 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 409 transitions. [2025-03-17 01:39:26,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 01:39:26,116 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 409 transitions. [2025-03-17 01:39:26,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-03-17 01:39:26,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:39:26,122 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:39:26,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 01:39:26,122 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:39:26,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:39:26,122 INFO L85 PathProgramCache]: Analyzing trace with hash 753272861, now seen corresponding path program 1 times [2025-03-17 01:39:26,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:39:26,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992841739] [2025-03-17 01:39:26,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:39:26,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:39:26,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-03-17 01:39:26,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-03-17 01:39:26,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:39:26,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:39:27,531 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-17 01:39:27,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:39:27,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992841739] [2025-03-17 01:39:27,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992841739] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:39:27,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:39:27,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 01:39:27,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138483050] [2025-03-17 01:39:27,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:39:27,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 01:39:27,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:39:27,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 01:39:27,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 01:39:27,534 INFO L87 Difference]: Start difference. First operand 252 states and 409 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 01:39:28,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:39:28,959 INFO L93 Difference]: Finished difference Result 1424 states and 2267 transitions. [2025-03-17 01:39:28,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 01:39:28,959 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 304 [2025-03-17 01:39:28,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:39:28,968 INFO L225 Difference]: With dead ends: 1424 [2025-03-17 01:39:28,968 INFO L226 Difference]: Without dead ends: 1173 [2025-03-17 01:39:28,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-17 01:39:28,970 INFO L435 NwaCegarLoop]: 603 mSDtfsCounter, 524 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 1393 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 01:39:28,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 1393 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 01:39:28,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2025-03-17 01:39:29,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 1024. [2025-03-17 01:39:29,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 599 states have (on average 1.3672787979966612) internal successors, (819), 605 states have internal predecessors, (819), 408 states have call successors, (408), 16 states have call predecessors, (408), 16 states have return successors, (408), 402 states have call predecessors, (408), 408 states have call successors, (408) [2025-03-17 01:39:29,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1635 transitions. [2025-03-17 01:39:29,147 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1635 transitions. Word has length 304 [2025-03-17 01:39:29,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:39:29,149 INFO L471 AbstractCegarLoop]: Abstraction has 1024 states and 1635 transitions. [2025-03-17 01:39:29,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 01:39:29,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1635 transitions. [2025-03-17 01:39:29,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-03-17 01:39:29,152 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:39:29,152 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:39:29,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 01:39:29,153 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:39:29,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:39:29,153 INFO L85 PathProgramCache]: Analyzing trace with hash -949510395, now seen corresponding path program 1 times [2025-03-17 01:39:29,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:39:29,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558737240] [2025-03-17 01:39:29,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:39:29,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:39:29,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-03-17 01:39:29,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-03-17 01:39:29,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:39:29,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:39:29,941 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-17 01:39:29,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:39:29,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558737240] [2025-03-17 01:39:29,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558737240] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:39:29,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:39:29,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 01:39:29,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162157172] [2025-03-17 01:39:29,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:39:29,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 01:39:29,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:39:29,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 01:39:29,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 01:39:29,944 INFO L87 Difference]: Start difference. First operand 1024 states and 1635 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-17 01:39:31,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:39:31,366 INFO L93 Difference]: Finished difference Result 3542 states and 5613 transitions. [2025-03-17 01:39:31,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 01:39:31,367 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) Word has length 304 [2025-03-17 01:39:31,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:39:31,384 INFO L225 Difference]: With dead ends: 3542 [2025-03-17 01:39:31,385 INFO L226 Difference]: Without dead ends: 2519 [2025-03-17 01:39:31,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2025-03-17 01:39:31,390 INFO L435 NwaCegarLoop]: 366 mSDtfsCounter, 552 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:39:31,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [552 Valid, 990 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 01:39:31,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2519 states. [2025-03-17 01:39:31,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2519 to 1903. [2025-03-17 01:39:31,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1903 states, 1150 states have (on average 1.382608695652174) internal successors, (1590), 1158 states have internal predecessors, (1590), 712 states have call successors, (712), 40 states have call predecessors, (712), 40 states have return successors, (712), 704 states have call predecessors, (712), 712 states have call successors, (712) [2025-03-17 01:39:31,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1903 states to 1903 states and 3014 transitions. [2025-03-17 01:39:31,671 INFO L78 Accepts]: Start accepts. Automaton has 1903 states and 3014 transitions. Word has length 304 [2025-03-17 01:39:31,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:39:31,673 INFO L471 AbstractCegarLoop]: Abstraction has 1903 states and 3014 transitions. [2025-03-17 01:39:31,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-17 01:39:31,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1903 states and 3014 transitions. [2025-03-17 01:39:31,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-03-17 01:39:31,677 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:39:31,677 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:39:31,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 01:39:31,677 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:39:31,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:39:31,679 INFO L85 PathProgramCache]: Analyzing trace with hash -820427676, now seen corresponding path program 1 times [2025-03-17 01:39:31,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:39:31,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546418186] [2025-03-17 01:39:31,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:39:31,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:39:31,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-03-17 01:39:31,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-03-17 01:39:31,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:39:31,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:39:39,922 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-17 01:39:39,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:39:39,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546418186] [2025-03-17 01:39:39,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546418186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:39:39,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:39:39,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 01:39:39,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016121217] [2025-03-17 01:39:39,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:39:39,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 01:39:39,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:39:39,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 01:39:39,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-17 01:39:39,924 INFO L87 Difference]: Start difference. First operand 1903 states and 3014 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 01:39:42,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:39:42,389 INFO L93 Difference]: Finished difference Result 6010 states and 9584 transitions. [2025-03-17 01:39:42,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 01:39:42,392 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 304 [2025-03-17 01:39:42,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:39:42,425 INFO L225 Difference]: With dead ends: 6010 [2025-03-17 01:39:42,425 INFO L226 Difference]: Without dead ends: 4108 [2025-03-17 01:39:42,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-17 01:39:42,436 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 546 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 1028 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:39:42,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 1028 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 01:39:42,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4108 states. [2025-03-17 01:39:42,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4108 to 2411. [2025-03-17 01:39:42,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2411 states, 1658 states have (on average 1.4728588661037394) internal successors, (2442), 1666 states have internal predecessors, (2442), 712 states have call successors, (712), 40 states have call predecessors, (712), 40 states have return successors, (712), 704 states have call predecessors, (712), 712 states have call successors, (712) [2025-03-17 01:39:42,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 3866 transitions. [2025-03-17 01:39:42,784 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 3866 transitions. Word has length 304 [2025-03-17 01:39:42,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:39:42,786 INFO L471 AbstractCegarLoop]: Abstraction has 2411 states and 3866 transitions. [2025-03-17 01:39:42,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 01:39:42,786 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 3866 transitions. [2025-03-17 01:39:42,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-03-17 01:39:42,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:39:42,792 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:39:42,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 01:39:42,795 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:39:42,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:39:42,796 INFO L85 PathProgramCache]: Analyzing trace with hash 687124133, now seen corresponding path program 1 times [2025-03-17 01:39:42,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:39:42,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003574499] [2025-03-17 01:39:42,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:39:42,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:39:42,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-03-17 01:39:42,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-03-17 01:39:42,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:39:42,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:39:43,048 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-17 01:39:43,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:39:43,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003574499] [2025-03-17 01:39:43,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003574499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:39:43,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:39:43,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 01:39:43,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775463271] [2025-03-17 01:39:43,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:39:43,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 01:39:43,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:39:43,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 01:39:43,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 01:39:43,051 INFO L87 Difference]: Start difference. First operand 2411 states and 3866 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 01:39:43,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:39:43,296 INFO L93 Difference]: Finished difference Result 5531 states and 8832 transitions. [2025-03-17 01:39:43,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 01:39:43,297 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 304 [2025-03-17 01:39:43,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:39:43,315 INFO L225 Difference]: With dead ends: 5531 [2025-03-17 01:39:43,316 INFO L226 Difference]: Without dead ends: 3121 [2025-03-17 01:39:43,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 01:39:43,325 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 71 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 01:39:43,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 592 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 01:39:43,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3121 states. [2025-03-17 01:39:43,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3121 to 3103. [2025-03-17 01:39:43,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3103 states, 2270 states have (on average 1.4722466960352423) internal successors, (3342), 2294 states have internal predecessors, (3342), 776 states have call successors, (776), 56 states have call predecessors, (776), 56 states have return successors, (776), 752 states have call predecessors, (776), 776 states have call successors, (776) [2025-03-17 01:39:43,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3103 states to 3103 states and 4894 transitions. [2025-03-17 01:39:43,603 INFO L78 Accepts]: Start accepts. Automaton has 3103 states and 4894 transitions. Word has length 304 [2025-03-17 01:39:43,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:39:43,603 INFO L471 AbstractCegarLoop]: Abstraction has 3103 states and 4894 transitions. [2025-03-17 01:39:43,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 01:39:43,604 INFO L276 IsEmpty]: Start isEmpty. Operand 3103 states and 4894 transitions. [2025-03-17 01:39:43,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-03-17 01:39:43,607 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:39:43,607 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:39:43,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 01:39:43,607 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:39:43,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:39:43,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1817500029, now seen corresponding path program 1 times [2025-03-17 01:39:43,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:39:43,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439120988] [2025-03-17 01:39:43,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:39:43,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:39:43,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-03-17 01:39:43,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-03-17 01:39:43,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:39:43,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:39:50,202 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-17 01:39:50,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:39:50,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439120988] [2025-03-17 01:39:50,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439120988] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:39:50,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:39:50,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 01:39:50,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035405138] [2025-03-17 01:39:50,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:39:50,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 01:39:50,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:39:50,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 01:39:50,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 01:39:50,203 INFO L87 Difference]: Start difference. First operand 3103 states and 4894 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 01:39:52,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:39:52,303 INFO L93 Difference]: Finished difference Result 7206 states and 11322 transitions. [2025-03-17 01:39:52,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 01:39:52,307 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 304 [2025-03-17 01:39:52,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:39:52,328 INFO L225 Difference]: With dead ends: 7206 [2025-03-17 01:39:52,329 INFO L226 Difference]: Without dead ends: 4104 [2025-03-17 01:39:52,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2025-03-17 01:39:52,340 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 332 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 01:39:52,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 915 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 01:39:52,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4104 states. [2025-03-17 01:39:52,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4104 to 3103. [2025-03-17 01:39:52,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3103 states, 2270 states have (on average 1.4722466960352423) internal successors, (3342), 2294 states have internal predecessors, (3342), 776 states have call successors, (776), 56 states have call predecessors, (776), 56 states have return successors, (776), 752 states have call predecessors, (776), 776 states have call successors, (776) [2025-03-17 01:39:52,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3103 states to 3103 states and 4894 transitions. [2025-03-17 01:39:52,622 INFO L78 Accepts]: Start accepts. Automaton has 3103 states and 4894 transitions. Word has length 304 [2025-03-17 01:39:52,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:39:52,624 INFO L471 AbstractCegarLoop]: Abstraction has 3103 states and 4894 transitions. [2025-03-17 01:39:52,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 01:39:52,625 INFO L276 IsEmpty]: Start isEmpty. Operand 3103 states and 4894 transitions. [2025-03-17 01:39:52,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-03-17 01:39:52,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:39:52,628 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:39:52,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 01:39:52,629 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:39:52,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:39:52,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1664899547, now seen corresponding path program 1 times [2025-03-17 01:39:52,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:39:52,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500682210] [2025-03-17 01:39:52,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:39:52,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:39:52,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-03-17 01:39:52,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-03-17 01:39:52,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:39:52,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:39:53,444 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-17 01:39:53,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:39:53,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500682210] [2025-03-17 01:39:53,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500682210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:39:53,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:39:53,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 01:39:53,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285880428] [2025-03-17 01:39:53,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:39:53,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 01:39:53,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:39:53,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 01:39:53,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-17 01:39:53,446 INFO L87 Difference]: Start difference. First operand 3103 states and 4894 transitions. Second operand has 9 states, 8 states have (on average 7.125) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-17 01:39:54,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:39:54,492 INFO L93 Difference]: Finished difference Result 7870 states and 12350 transitions. [2025-03-17 01:39:54,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 01:39:54,493 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) Word has length 304 [2025-03-17 01:39:54,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:39:54,513 INFO L225 Difference]: With dead ends: 7870 [2025-03-17 01:39:54,513 INFO L226 Difference]: Without dead ends: 4768 [2025-03-17 01:39:54,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2025-03-17 01:39:54,521 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 642 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 01:39:54,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [642 Valid, 876 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 01:39:54,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4768 states. [2025-03-17 01:39:54,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4768 to 3225. [2025-03-17 01:39:54,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3225 states, 2338 states have (on average 1.4662104362703166) internal successors, (3428), 2362 states have internal predecessors, (3428), 826 states have call successors, (826), 60 states have call predecessors, (826), 60 states have return successors, (826), 802 states have call predecessors, (826), 826 states have call successors, (826) [2025-03-17 01:39:54,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3225 states to 3225 states and 5080 transitions. [2025-03-17 01:39:54,800 INFO L78 Accepts]: Start accepts. Automaton has 3225 states and 5080 transitions. Word has length 304 [2025-03-17 01:39:54,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:39:54,800 INFO L471 AbstractCegarLoop]: Abstraction has 3225 states and 5080 transitions. [2025-03-17 01:39:54,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-17 01:39:54,801 INFO L276 IsEmpty]: Start isEmpty. Operand 3225 states and 5080 transitions. [2025-03-17 01:39:54,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-03-17 01:39:54,803 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:39:54,803 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:39:54,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 01:39:54,804 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:39:54,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:39:54,805 INFO L85 PathProgramCache]: Analyzing trace with hash 364449913, now seen corresponding path program 1 times [2025-03-17 01:39:54,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:39:54,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195948] [2025-03-17 01:39:54,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:39:54,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:39:54,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-03-17 01:39:54,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-03-17 01:39:54,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:39:54,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:40:00,200 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-17 01:40:00,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:40:00,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195948] [2025-03-17 01:40:00,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195948] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:40:00,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:40:00,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 01:40:00,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208099914] [2025-03-17 01:40:00,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:40:00,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 01:40:00,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:40:00,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 01:40:00,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-17 01:40:00,201 INFO L87 Difference]: Start difference. First operand 3225 states and 5080 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 01:40:00,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:40:00,917 INFO L93 Difference]: Finished difference Result 10023 states and 15785 transitions. [2025-03-17 01:40:00,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 01:40:00,918 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 305 [2025-03-17 01:40:00,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:40:00,952 INFO L225 Difference]: With dead ends: 10023 [2025-03-17 01:40:00,955 INFO L226 Difference]: Without dead ends: 6921 [2025-03-17 01:40:00,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-17 01:40:00,965 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 514 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 01:40:00,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 766 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 01:40:00,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6921 states. [2025-03-17 01:40:01,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6921 to 3413. [2025-03-17 01:40:01,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3413 states, 2526 states have (on average 1.496437054631829) internal successors, (3780), 2550 states have internal predecessors, (3780), 826 states have call successors, (826), 60 states have call predecessors, (826), 60 states have return successors, (826), 802 states have call predecessors, (826), 826 states have call successors, (826) [2025-03-17 01:40:01,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3413 states to 3413 states and 5432 transitions. [2025-03-17 01:40:01,266 INFO L78 Accepts]: Start accepts. Automaton has 3413 states and 5432 transitions. Word has length 305 [2025-03-17 01:40:01,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:40:01,267 INFO L471 AbstractCegarLoop]: Abstraction has 3413 states and 5432 transitions. [2025-03-17 01:40:01,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 01:40:01,267 INFO L276 IsEmpty]: Start isEmpty. Operand 3413 states and 5432 transitions. [2025-03-17 01:40:01,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-03-17 01:40:01,269 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:40:01,269 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:40:01,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 01:40:01,270 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:40:01,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:40:01,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1872001722, now seen corresponding path program 1 times [2025-03-17 01:40:01,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:40:01,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573120196] [2025-03-17 01:40:01,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:40:01,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:40:01,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-03-17 01:40:01,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-03-17 01:40:01,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:40:01,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:40:04,571 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-17 01:40:04,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:40:04,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573120196] [2025-03-17 01:40:04,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573120196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:40:04,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:40:04,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 01:40:04,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396294540] [2025-03-17 01:40:04,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:40:04,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 01:40:04,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:40:04,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 01:40:04,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-17 01:40:04,572 INFO L87 Difference]: Start difference. First operand 3413 states and 5432 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 01:40:05,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:40:05,316 INFO L93 Difference]: Finished difference Result 9951 states and 15749 transitions. [2025-03-17 01:40:05,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 01:40:05,317 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 305 [2025-03-17 01:40:05,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:40:05,338 INFO L225 Difference]: With dead ends: 9951 [2025-03-17 01:40:05,338 INFO L226 Difference]: Without dead ends: 6661 [2025-03-17 01:40:05,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-17 01:40:05,347 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 344 mSDsluCounter, 902 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 01:40:05,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 1160 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 01:40:05,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6661 states. [2025-03-17 01:40:05,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6661 to 3733. [2025-03-17 01:40:05,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3733 states, 2846 states have (on average 1.5038650737877723) internal successors, (4280), 2870 states have internal predecessors, (4280), 826 states have call successors, (826), 60 states have call predecessors, (826), 60 states have return successors, (826), 802 states have call predecessors, (826), 826 states have call successors, (826) [2025-03-17 01:40:05,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3733 states to 3733 states and 5932 transitions. [2025-03-17 01:40:05,655 INFO L78 Accepts]: Start accepts. Automaton has 3733 states and 5932 transitions. Word has length 305 [2025-03-17 01:40:05,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:40:05,656 INFO L471 AbstractCegarLoop]: Abstraction has 3733 states and 5932 transitions. [2025-03-17 01:40:05,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 01:40:05,657 INFO L276 IsEmpty]: Start isEmpty. Operand 3733 states and 5932 transitions. [2025-03-17 01:40:05,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-03-17 01:40:05,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:40:05,660 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:40:05,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 01:40:05,661 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:40:05,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:40:05,661 INFO L85 PathProgramCache]: Analyzing trace with hash -632622440, now seen corresponding path program 1 times [2025-03-17 01:40:05,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:40:05,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794227734] [2025-03-17 01:40:05,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:40:05,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:40:05,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-03-17 01:40:05,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-03-17 01:40:05,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:40:05,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:40:11,368 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-17 01:40:11,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:40:11,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794227734] [2025-03-17 01:40:11,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794227734] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:40:11,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:40:11,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 01:40:11,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611349765] [2025-03-17 01:40:11,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:40:11,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 01:40:11,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:40:11,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 01:40:11,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-17 01:40:11,370 INFO L87 Difference]: Start difference. First operand 3733 states and 5932 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 01:40:13,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:40:13,021 INFO L93 Difference]: Finished difference Result 10358 states and 16300 transitions. [2025-03-17 01:40:13,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 01:40:13,021 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 305 [2025-03-17 01:40:13,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:40:13,040 INFO L225 Difference]: With dead ends: 10358 [2025-03-17 01:40:13,040 INFO L226 Difference]: Without dead ends: 6748 [2025-03-17 01:40:13,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2025-03-17 01:40:13,046 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 827 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 01:40:13,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 1003 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 01:40:13,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6748 states. [2025-03-17 01:40:13,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6748 to 3757. [2025-03-17 01:40:13,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3757 states, 2870 states have (on average 1.5066202090592336) internal successors, (4324), 2894 states have internal predecessors, (4324), 826 states have call successors, (826), 60 states have call predecessors, (826), 60 states have return successors, (826), 802 states have call predecessors, (826), 826 states have call successors, (826) [2025-03-17 01:40:13,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3757 states to 3757 states and 5976 transitions. [2025-03-17 01:40:13,334 INFO L78 Accepts]: Start accepts. Automaton has 3757 states and 5976 transitions. Word has length 305 [2025-03-17 01:40:13,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:40:13,335 INFO L471 AbstractCegarLoop]: Abstraction has 3757 states and 5976 transitions. [2025-03-17 01:40:13,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 01:40:13,335 INFO L276 IsEmpty]: Start isEmpty. Operand 3757 states and 5976 transitions. [2025-03-17 01:40:13,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-03-17 01:40:13,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:40:13,338 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:40:13,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 01:40:13,338 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:40:13,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:40:13,339 INFO L85 PathProgramCache]: Analyzing trace with hash 874929369, now seen corresponding path program 1 times [2025-03-17 01:40:13,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:40:13,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406520613] [2025-03-17 01:40:13,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:40:13,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:40:13,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-03-17 01:40:13,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-03-17 01:40:13,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:40:13,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:40:17,994 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-17 01:40:17,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:40:17,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406520613] [2025-03-17 01:40:17,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406520613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:40:17,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:40:17,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 01:40:17,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787648449] [2025-03-17 01:40:17,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:40:17,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 01:40:17,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:40:17,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 01:40:17,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-17 01:40:17,997 INFO L87 Difference]: Start difference. First operand 3757 states and 5976 transitions. Second operand has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-17 01:40:19,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:40:19,513 INFO L93 Difference]: Finished difference Result 10202 states and 16072 transitions. [2025-03-17 01:40:19,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 01:40:19,514 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) Word has length 305 [2025-03-17 01:40:19,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:40:19,533 INFO L225 Difference]: With dead ends: 10202 [2025-03-17 01:40:19,533 INFO L226 Difference]: Without dead ends: 6592 [2025-03-17 01:40:19,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2025-03-17 01:40:19,542 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 900 mSDsluCounter, 1117 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 900 SdHoareTripleChecker+Valid, 1373 SdHoareTripleChecker+Invalid, 1066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 01:40:19,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [900 Valid, 1373 Invalid, 1066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 01:40:19,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6592 states. [2025-03-17 01:40:19,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6592 to 3741. [2025-03-17 01:40:19,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3741 states, 2854 states have (on average 1.50385423966363) internal successors, (4292), 2878 states have internal predecessors, (4292), 826 states have call successors, (826), 60 states have call predecessors, (826), 60 states have return successors, (826), 802 states have call predecessors, (826), 826 states have call successors, (826) [2025-03-17 01:40:19,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3741 states to 3741 states and 5944 transitions. [2025-03-17 01:40:19,860 INFO L78 Accepts]: Start accepts. Automaton has 3741 states and 5944 transitions. Word has length 305 [2025-03-17 01:40:19,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:40:19,861 INFO L471 AbstractCegarLoop]: Abstraction has 3741 states and 5944 transitions. [2025-03-17 01:40:19,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-17 01:40:19,861 INFO L276 IsEmpty]: Start isEmpty. Operand 3741 states and 5944 transitions. [2025-03-17 01:40:19,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-03-17 01:40:19,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:40:19,864 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:40:19,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 01:40:19,864 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:40:19,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:40:19,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1624288567, now seen corresponding path program 1 times [2025-03-17 01:40:19,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:40:19,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493589060] [2025-03-17 01:40:19,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:40:19,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:40:19,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-03-17 01:40:19,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-03-17 01:40:19,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:40:19,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:40:25,045 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-17 01:40:25,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:40:25,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493589060] [2025-03-17 01:40:25,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493589060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:40:25,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:40:25,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 01:40:25,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281988769] [2025-03-17 01:40:25,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:40:25,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 01:40:25,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:40:25,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 01:40:25,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-03-17 01:40:25,047 INFO L87 Difference]: Start difference. First operand 3741 states and 5944 transitions. Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 01:40:26,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:40:26,448 INFO L93 Difference]: Finished difference Result 9252 states and 14595 transitions. [2025-03-17 01:40:26,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 01:40:26,449 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 305 [2025-03-17 01:40:26,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:40:26,466 INFO L225 Difference]: With dead ends: 9252 [2025-03-17 01:40:26,467 INFO L226 Difference]: Without dead ends: 5642 [2025-03-17 01:40:26,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2025-03-17 01:40:26,477 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 408 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:40:26,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 1112 Invalid, 834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 01:40:26,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5642 states. [2025-03-17 01:40:26,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5642 to 3759. [2025-03-17 01:40:26,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3759 states, 2872 states have (on average 1.5069637883008355) internal successors, (4328), 2896 states have internal predecessors, (4328), 826 states have call successors, (826), 60 states have call predecessors, (826), 60 states have return successors, (826), 802 states have call predecessors, (826), 826 states have call successors, (826) [2025-03-17 01:40:26,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3759 states to 3759 states and 5980 transitions. [2025-03-17 01:40:26,795 INFO L78 Accepts]: Start accepts. Automaton has 3759 states and 5980 transitions. Word has length 305 [2025-03-17 01:40:26,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:40:26,796 INFO L471 AbstractCegarLoop]: Abstraction has 3759 states and 5980 transitions. [2025-03-17 01:40:26,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 01:40:26,796 INFO L276 IsEmpty]: Start isEmpty. Operand 3759 states and 5980 transitions. [2025-03-17 01:40:26,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-03-17 01:40:26,799 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:40:26,800 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:40:26,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 01:40:26,800 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:40:26,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:40:26,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1163126920, now seen corresponding path program 1 times [2025-03-17 01:40:26,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:40:26,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453972061] [2025-03-17 01:40:26,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:40:26,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:40:26,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-03-17 01:40:26,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-03-17 01:40:26,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:40:26,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:40:27,428 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-17 01:40:27,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:40:27,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453972061] [2025-03-17 01:40:27,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453972061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:40:27,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:40:27,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 01:40:27,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610635324] [2025-03-17 01:40:27,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:40:27,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 01:40:27,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:40:27,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 01:40:27,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 01:40:27,430 INFO L87 Difference]: Start difference. First operand 3759 states and 5980 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 01:40:28,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:40:28,374 INFO L93 Difference]: Finished difference Result 8916 states and 14079 transitions. [2025-03-17 01:40:28,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 01:40:28,374 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 305 [2025-03-17 01:40:28,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:40:28,388 INFO L225 Difference]: With dead ends: 8916 [2025-03-17 01:40:28,388 INFO L226 Difference]: Without dead ends: 5306 [2025-03-17 01:40:28,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-03-17 01:40:28,398 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 515 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 01:40:28,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 846 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 01:40:28,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5306 states. [2025-03-17 01:40:28,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5306 to 3735. [2025-03-17 01:40:28,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3735 states, 2848 states have (on average 1.5042134831460674) internal successors, (4284), 2872 states have internal predecessors, (4284), 826 states have call successors, (826), 60 states have call predecessors, (826), 60 states have return successors, (826), 802 states have call predecessors, (826), 826 states have call successors, (826) [2025-03-17 01:40:28,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3735 states to 3735 states and 5936 transitions. [2025-03-17 01:40:28,674 INFO L78 Accepts]: Start accepts. Automaton has 3735 states and 5936 transitions. Word has length 305 [2025-03-17 01:40:28,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:40:28,675 INFO L471 AbstractCegarLoop]: Abstraction has 3735 states and 5936 transitions. [2025-03-17 01:40:28,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 01:40:28,675 INFO L276 IsEmpty]: Start isEmpty. Operand 3735 states and 5936 transitions. [2025-03-17 01:40:28,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-03-17 01:40:28,678 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:40:28,678 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:40:28,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 01:40:28,679 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:40:28,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:40:28,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1712759430, now seen corresponding path program 1 times [2025-03-17 01:40:28,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:40:28,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099337260] [2025-03-17 01:40:28,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:40:28,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:40:28,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-03-17 01:40:28,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-03-17 01:40:28,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:40:28,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:40:28,843 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-17 01:40:28,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:40:28,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099337260] [2025-03-17 01:40:28,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099337260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:40:28,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:40:28,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 01:40:28,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620072369] [2025-03-17 01:40:28,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:40:28,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 01:40:28,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:40:28,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 01:40:28,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 01:40:28,845 INFO L87 Difference]: Start difference. First operand 3735 states and 5936 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 01:40:29,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:40:29,079 INFO L93 Difference]: Finished difference Result 8147 states and 12921 transitions. [2025-03-17 01:40:29,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 01:40:29,080 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 305 [2025-03-17 01:40:29,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:40:29,092 INFO L225 Difference]: With dead ends: 8147 [2025-03-17 01:40:29,092 INFO L226 Difference]: Without dead ends: 4537 [2025-03-17 01:40:29,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 01:40:29,100 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 123 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:40:29,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 666 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:40:29,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4537 states. [2025-03-17 01:40:29,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4537 to 3535. [2025-03-17 01:40:29,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3535 states, 2711 states have (on average 1.5237919586868314) internal successors, (4131), 2719 states have internal predecessors, (4131), 762 states have call successors, (762), 61 states have call predecessors, (762), 61 states have return successors, (762), 754 states have call predecessors, (762), 762 states have call successors, (762) [2025-03-17 01:40:29,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3535 states to 3535 states and 5655 transitions. [2025-03-17 01:40:29,380 INFO L78 Accepts]: Start accepts. Automaton has 3535 states and 5655 transitions. Word has length 305 [2025-03-17 01:40:29,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:40:29,381 INFO L471 AbstractCegarLoop]: Abstraction has 3535 states and 5655 transitions. [2025-03-17 01:40:29,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 01:40:29,381 INFO L276 IsEmpty]: Start isEmpty. Operand 3535 states and 5655 transitions. [2025-03-17 01:40:29,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-03-17 01:40:29,383 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:40:29,383 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:40:29,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 01:40:29,384 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:40:29,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:40:29,384 INFO L85 PathProgramCache]: Analyzing trace with hash -205207621, now seen corresponding path program 1 times [2025-03-17 01:40:29,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:40:29,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553685127] [2025-03-17 01:40:29,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:40:29,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:40:29,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-03-17 01:40:29,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-03-17 01:40:29,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:40:29,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:40:36,400 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-17 01:40:36,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:40:36,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553685127] [2025-03-17 01:40:36,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553685127] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:40:36,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:40:36,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 01:40:36,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767953858] [2025-03-17 01:40:36,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:40:36,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 01:40:36,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:40:36,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 01:40:36,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-03-17 01:40:36,402 INFO L87 Difference]: Start difference. First operand 3535 states and 5655 transitions. Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 01:40:37,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:40:37,741 INFO L93 Difference]: Finished difference Result 8496 states and 13471 transitions. [2025-03-17 01:40:37,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 01:40:37,745 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 305 [2025-03-17 01:40:37,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:40:37,759 INFO L225 Difference]: With dead ends: 8496 [2025-03-17 01:40:37,760 INFO L226 Difference]: Without dead ends: 5090 [2025-03-17 01:40:37,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2025-03-17 01:40:37,768 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 363 mSDsluCounter, 1038 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 1272 SdHoareTripleChecker+Invalid, 875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 01:40:37,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 1272 Invalid, 875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 01:40:37,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5090 states. [2025-03-17 01:40:37,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5090 to 3566. [2025-03-17 01:40:37,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3566 states, 2742 states have (on average 1.525164113785558) internal successors, (4182), 2750 states have internal predecessors, (4182), 762 states have call successors, (762), 61 states have call predecessors, (762), 61 states have return successors, (762), 754 states have call predecessors, (762), 762 states have call successors, (762) [2025-03-17 01:40:37,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3566 states to 3566 states and 5706 transitions. [2025-03-17 01:40:37,999 INFO L78 Accepts]: Start accepts. Automaton has 3566 states and 5706 transitions. Word has length 305 [2025-03-17 01:40:38,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:40:38,000 INFO L471 AbstractCegarLoop]: Abstraction has 3566 states and 5706 transitions. [2025-03-17 01:40:38,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 01:40:38,000 INFO L276 IsEmpty]: Start isEmpty. Operand 3566 states and 5706 transitions. [2025-03-17 01:40:38,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-03-17 01:40:38,003 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:40:38,003 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:40:38,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 01:40:38,003 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:40:38,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:40:38,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1202279974, now seen corresponding path program 1 times [2025-03-17 01:40:38,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:40:38,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577624532] [2025-03-17 01:40:38,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:40:38,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:40:38,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-03-17 01:40:38,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-03-17 01:40:38,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:40:38,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat