./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-97.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_operatoramount_amount500_file-97.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 27b7d41c83bd27c4821a45cf0c1b489a71375b91c18644eeffdc9ad906f09c11 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 04:55:59,552 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 04:55:59,603 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 04:55:59,608 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 04:55:59,608 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 04:55:59,631 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 04:55:59,632 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 04:55:59,632 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 04:55:59,632 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 04:55:59,633 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 04:55:59,633 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 04:55:59,633 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 04:55:59,633 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 04:55:59,633 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 04:55:59,633 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 04:55:59,633 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 04:55:59,633 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 04:55:59,634 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 04:55:59,634 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 04:55:59,634 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 04:55:59,634 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 04:55:59,634 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 04:55:59,634 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 04:55:59,634 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 04:55:59,634 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 04:55:59,634 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 04:55:59,634 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 04:55:59,634 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 04:55:59,634 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 04:55:59,635 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 04:55:59,635 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 04:55:59,635 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 04:55:59,635 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:55:59,635 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 04:55:59,635 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 04:55:59,635 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 04:55:59,635 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 04:55:59,635 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 04:55:59,635 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 04:55:59,635 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 04:55:59,635 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 04:55:59,635 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 04:55:59,635 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 04:55:59,635 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 -> 27b7d41c83bd27c4821a45cf0c1b489a71375b91c18644eeffdc9ad906f09c11 [2025-03-17 04:55:59,861 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 04:55:59,869 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 04:55:59,870 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 04:55:59,871 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 04:55:59,871 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 04:55:59,872 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-97.i [2025-03-17 04:56:01,026 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d0e8e9a9/99b4aff18fe4465bb62db83876562010/FLAG2b1641880 [2025-03-17 04:56:01,314 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 04:56:01,314 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-97.i [2025-03-17 04:56:01,329 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d0e8e9a9/99b4aff18fe4465bb62db83876562010/FLAG2b1641880 [2025-03-17 04:56:01,345 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d0e8e9a9/99b4aff18fe4465bb62db83876562010 [2025-03-17 04:56:01,349 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 04:56:01,350 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 04:56:01,351 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 04:56:01,351 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 04:56:01,354 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 04:56:01,355 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:56:01" (1/1) ... [2025-03-17 04:56:01,355 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3867afc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:56:01, skipping insertion in model container [2025-03-17 04:56:01,356 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:56:01" (1/1) ... [2025-03-17 04:56:01,387 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 04:56:01,498 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_operatoramount_amount500_file-97.i[916,929] [2025-03-17 04:56:01,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:56:01,663 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 04:56:01,670 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_operatoramount_amount500_file-97.i[916,929] [2025-03-17 04:56:01,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:56:01,773 INFO L204 MainTranslator]: Completed translation [2025-03-17 04:56:01,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:56:01 WrapperNode [2025-03-17 04:56:01,774 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 04:56:01,775 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 04:56:01,775 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 04:56:01,776 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 04:56:01,780 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:56:01" (1/1) ... [2025-03-17 04:56:01,802 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:56:01" (1/1) ... [2025-03-17 04:56:01,880 INFO L138 Inliner]: procedures = 26, calls = 85, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 818 [2025-03-17 04:56:01,881 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 04:56:01,881 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 04:56:01,881 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 04:56:01,881 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 04:56:01,889 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:56:01" (1/1) ... [2025-03-17 04:56:01,890 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:56:01" (1/1) ... [2025-03-17 04:56:01,904 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:56:01" (1/1) ... [2025-03-17 04:56:01,986 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 04:56:01,987 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:56:01" (1/1) ... [2025-03-17 04:56:01,987 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:56:01" (1/1) ... [2025-03-17 04:56:02,014 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:56:01" (1/1) ... [2025-03-17 04:56:02,019 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:56:01" (1/1) ... [2025-03-17 04:56:02,029 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:56:01" (1/1) ... [2025-03-17 04:56:02,035 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:56:01" (1/1) ... [2025-03-17 04:56:02,050 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 04:56:02,051 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 04:56:02,051 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 04:56:02,052 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 04:56:02,052 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:56:01" (1/1) ... [2025-03-17 04:56:02,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:56:02,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:56:02,078 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 04:56:02,080 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 04:56:02,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 04:56:02,097 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 04:56:02,097 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 04:56:02,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 04:56:02,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 04:56:02,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 04:56:02,209 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 04:56:02,210 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 04:56:03,089 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L650: havoc property_#t~bitwise52#1;havoc property_#t~short53#1;havoc property_#t~bitwise54#1;havoc property_#t~short55#1;havoc property_#t~bitwise56#1;havoc property_#t~short57#1;havoc property_#t~ite60#1;havoc property_#t~ite59#1;havoc property_#t~bitwise58#1;havoc property_#t~short61#1;havoc property_#t~bitwise62#1;havoc property_#t~short63#1;havoc property_#t~bitwise64#1;havoc property_#t~bitwise65#1;havoc property_#t~ite68#1;havoc property_#t~ite67#1;havoc property_#t~bitwise66#1;havoc property_#t~short69#1;havoc property_#t~bitwise70#1;havoc property_#t~short71#1;havoc property_#t~ite73#1;havoc property_#t~bitwise72#1;havoc property_#t~short74#1; [2025-03-17 04:56:03,223 INFO L? ?]: Removed 100 outVars from TransFormulas that were not future-live. [2025-03-17 04:56:03,223 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 04:56:03,256 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 04:56:03,256 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 04:56:03,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:56:03 BoogieIcfgContainer [2025-03-17 04:56:03,257 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 04:56:03,261 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 04:56:03,261 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 04:56:03,265 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 04:56:03,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:56:01" (1/3) ... [2025-03-17 04:56:03,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15836c11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:56:03, skipping insertion in model container [2025-03-17 04:56:03,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:56:01" (2/3) ... [2025-03-17 04:56:03,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15836c11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:56:03, skipping insertion in model container [2025-03-17 04:56:03,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:56:03" (3/3) ... [2025-03-17 04:56:03,267 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-97.i [2025-03-17 04:56:03,278 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 04:56:03,282 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-97.i that has 2 procedures, 320 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 04:56:03,334 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 04:56:03,343 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;@6347a6a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 04:56:03,344 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 04:56:03,348 INFO L276 IsEmpty]: Start isEmpty. Operand has 320 states, 245 states have (on average 1.5591836734693878) internal successors, (382), 246 states have internal predecessors, (382), 72 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-17 04:56:03,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2025-03-17 04:56:03,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:56:03,372 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:56:03,372 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:56:03,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:56:03,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1382470642, now seen corresponding path program 1 times [2025-03-17 04:56:03,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:56:03,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967946586] [2025-03-17 04:56:03,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:56:03,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:56:03,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 500 statements into 1 equivalence classes. [2025-03-17 04:56:03,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 500 of 500 statements. [2025-03-17 04:56:03,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:56:03,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:56:03,880 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 10082 trivial. 0 not checked. [2025-03-17 04:56:03,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:56:03,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967946586] [2025-03-17 04:56:03,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967946586] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:56:03,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681464853] [2025-03-17 04:56:03,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:56:03,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:56:03,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:56:03,884 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 04:56:03,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 04:56:04,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 500 statements into 1 equivalence classes. [2025-03-17 04:56:04,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 500 of 500 statements. [2025-03-17 04:56:04,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:56:04,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:56:04,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 1264 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 04:56:04,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:56:04,273 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 10082 trivial. 0 not checked. [2025-03-17 04:56:04,275 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:56:04,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681464853] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:56:04,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 04:56:04,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 04:56:04,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325292986] [2025-03-17 04:56:04,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:56:04,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 04:56:04,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:56:04,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 04:56:04,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:56:04,298 INFO L87 Difference]: Start difference. First operand has 320 states, 245 states have (on average 1.5591836734693878) internal successors, (382), 246 states have internal predecessors, (382), 72 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) Second operand has 2 states, 2 states have (on average 72.5) internal successors, (145), 2 states have internal predecessors, (145), 2 states have call successors, (72), 2 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 2 states have call successors, (72) [2025-03-17 04:56:04,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:56:04,375 INFO L93 Difference]: Finished difference Result 637 states and 1122 transitions. [2025-03-17 04:56:04,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 04:56:04,378 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 72.5) internal successors, (145), 2 states have internal predecessors, (145), 2 states have call successors, (72), 2 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 2 states have call successors, (72) Word has length 500 [2025-03-17 04:56:04,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:56:04,384 INFO L225 Difference]: With dead ends: 637 [2025-03-17 04:56:04,385 INFO L226 Difference]: Without dead ends: 318 [2025-03-17 04:56:04,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 501 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 04:56:04,391 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:56:04,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 499 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:56:04,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-03-17 04:56:04,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2025-03-17 04:56:04,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 244 states have (on average 1.5368852459016393) internal successors, (375), 244 states have internal predecessors, (375), 72 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-17 04:56:04,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 519 transitions. [2025-03-17 04:56:04,460 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 519 transitions. Word has length 500 [2025-03-17 04:56:04,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:56:04,461 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 519 transitions. [2025-03-17 04:56:04,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 72.5) internal successors, (145), 2 states have internal predecessors, (145), 2 states have call successors, (72), 2 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 2 states have call successors, (72) [2025-03-17 04:56:04,462 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 519 transitions. [2025-03-17 04:56:04,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2025-03-17 04:56:04,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:56:04,474 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:56:04,483 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 04:56:04,674 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 04:56:04,675 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:56:04,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:56:04,676 INFO L85 PathProgramCache]: Analyzing trace with hash 706120498, now seen corresponding path program 1 times [2025-03-17 04:56:04,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:56:04,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843710629] [2025-03-17 04:56:04,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:56:04,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:56:04,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 500 statements into 1 equivalence classes. [2025-03-17 04:56:04,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 500 of 500 statements. [2025-03-17 04:56:04,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:56:04,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:56:05,812 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-03-17 04:56:05,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:56:05,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843710629] [2025-03-17 04:56:05,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843710629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:56:05,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:56:05,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:56:05,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969727962] [2025-03-17 04:56:05,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:56:05,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:56:05,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:56:05,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:56:05,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:56:05,816 INFO L87 Difference]: Start difference. First operand 318 states and 519 transitions. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-17 04:56:05,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:56:05,896 INFO L93 Difference]: Finished difference Result 637 states and 1040 transitions. [2025-03-17 04:56:05,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:56:05,897 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 500 [2025-03-17 04:56:05,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:56:05,900 INFO L225 Difference]: With dead ends: 637 [2025-03-17 04:56:05,900 INFO L226 Difference]: Without dead ends: 320 [2025-03-17 04:56:05,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 04:56:05,904 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 0 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1485 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:56:05,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1485 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:56:05,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2025-03-17 04:56:05,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2025-03-17 04:56:05,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 246 states have (on average 1.532520325203252) internal successors, (377), 246 states have internal predecessors, (377), 72 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-17 04:56:05,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 521 transitions. [2025-03-17 04:56:05,934 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 521 transitions. Word has length 500 [2025-03-17 04:56:05,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:56:05,937 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 521 transitions. [2025-03-17 04:56:05,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-17 04:56:05,938 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 521 transitions. [2025-03-17 04:56:05,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2025-03-17 04:56:05,943 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:56:05,943 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:56:05,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 04:56:05,944 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:56:05,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:56:05,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1297090450, now seen corresponding path program 1 times [2025-03-17 04:56:05,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:56:05,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106805211] [2025-03-17 04:56:05,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:56:05,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:56:05,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 501 statements into 1 equivalence classes. [2025-03-17 04:56:06,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 501 of 501 statements. [2025-03-17 04:56:06,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:56:06,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:56:07,571 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-03-17 04:56:07,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:56:07,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106805211] [2025-03-17 04:56:07,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106805211] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:56:07,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:56:07,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 04:56:07,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193144478] [2025-03-17 04:56:07,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:56:07,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 04:56:07,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:56:07,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 04:56:07,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 04:56:07,577 INFO L87 Difference]: Start difference. First operand 320 states and 521 transitions. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-17 04:56:08,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:56:08,260 INFO L93 Difference]: Finished difference Result 1557 states and 2536 transitions. [2025-03-17 04:56:08,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 04:56:08,260 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 501 [2025-03-17 04:56:08,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:56:08,271 INFO L225 Difference]: With dead ends: 1557 [2025-03-17 04:56:08,272 INFO L226 Difference]: Without dead ends: 1238 [2025-03-17 04:56:08,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-17 04:56:08,274 INFO L435 NwaCegarLoop]: 997 mSDtfsCounter, 1367 mSDsluCounter, 3161 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 296 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1367 SdHoareTripleChecker+Valid, 4158 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 296 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 04:56:08,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1367 Valid, 4158 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [296 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 04:56:08,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2025-03-17 04:56:08,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 694. [2025-03-17 04:56:08,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 509 states have (on average 1.5029469548133596) internal successors, (765), 510 states have internal predecessors, (765), 180 states have call successors, (180), 4 states have call predecessors, (180), 4 states have return successors, (180), 179 states have call predecessors, (180), 180 states have call successors, (180) [2025-03-17 04:56:08,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1125 transitions. [2025-03-17 04:56:08,343 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 1125 transitions. Word has length 501 [2025-03-17 04:56:08,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:56:08,344 INFO L471 AbstractCegarLoop]: Abstraction has 694 states and 1125 transitions. [2025-03-17 04:56:08,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-17 04:56:08,345 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1125 transitions. [2025-03-17 04:56:08,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2025-03-17 04:56:08,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:56:08,351 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:56:08,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 04:56:08,351 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:56:08,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:56:08,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1972783059, now seen corresponding path program 1 times [2025-03-17 04:56:08,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:56:08,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492379526] [2025-03-17 04:56:08,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:56:08,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:56:08,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 501 statements into 1 equivalence classes. [2025-03-17 04:56:08,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 501 of 501 statements. [2025-03-17 04:56:08,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:56:08,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:56:09,774 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-03-17 04:56:09,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:56:09,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492379526] [2025-03-17 04:56:09,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492379526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:56:09,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:56:09,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 04:56:09,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168621859] [2025-03-17 04:56:09,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:56:09,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:56:09,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:56:09,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:56:09,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:56:09,778 INFO L87 Difference]: Start difference. First operand 694 states and 1125 transitions. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-17 04:56:10,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:56:10,402 INFO L93 Difference]: Finished difference Result 3130 states and 5013 transitions. [2025-03-17 04:56:10,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 04:56:10,402 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 501 [2025-03-17 04:56:10,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:56:10,420 INFO L225 Difference]: With dead ends: 3130 [2025-03-17 04:56:10,420 INFO L226 Difference]: Without dead ends: 2610 [2025-03-17 04:56:10,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-17 04:56:10,427 INFO L435 NwaCegarLoop]: 1098 mSDtfsCounter, 1932 mSDsluCounter, 1986 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1932 SdHoareTripleChecker+Valid, 3084 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 04:56:10,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1932 Valid, 3084 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 04:56:10,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2610 states. [2025-03-17 04:56:10,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2610 to 2242. [2025-03-17 04:56:10,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2242 states, 1727 states have (on average 1.5130283729009844) internal successors, (2613), 1731 states have internal predecessors, (2613), 504 states have call successors, (504), 10 states have call predecessors, (504), 10 states have return successors, (504), 500 states have call predecessors, (504), 504 states have call successors, (504) [2025-03-17 04:56:10,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2242 states to 2242 states and 3621 transitions. [2025-03-17 04:56:10,639 INFO L78 Accepts]: Start accepts. Automaton has 2242 states and 3621 transitions. Word has length 501 [2025-03-17 04:56:10,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:56:10,640 INFO L471 AbstractCegarLoop]: Abstraction has 2242 states and 3621 transitions. [2025-03-17 04:56:10,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-17 04:56:10,640 INFO L276 IsEmpty]: Start isEmpty. Operand 2242 states and 3621 transitions. [2025-03-17 04:56:10,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2025-03-17 04:56:10,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:56:10,645 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:56:10,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 04:56:10,645 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:56:10,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:56:10,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1163295602, now seen corresponding path program 1 times [2025-03-17 04:56:10,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:56:10,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796323221] [2025-03-17 04:56:10,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:56:10,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:56:10,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 501 statements into 1 equivalence classes. [2025-03-17 04:56:11,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 501 of 501 statements. [2025-03-17 04:56:11,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:56:11,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:56:11,898 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-03-17 04:56:11,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:56:11,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796323221] [2025-03-17 04:56:11,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796323221] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:56:11,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:56:11,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:56:11,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497880009] [2025-03-17 04:56:11,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:56:11,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:56:11,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:56:11,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:56:11,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:56:11,902 INFO L87 Difference]: Start difference. First operand 2242 states and 3621 transitions. Second operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-17 04:56:12,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:56:12,400 INFO L93 Difference]: Finished difference Result 5335 states and 8597 transitions. [2025-03-17 04:56:12,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:56:12,400 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 501 [2025-03-17 04:56:12,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:56:12,416 INFO L225 Difference]: With dead ends: 5335 [2025-03-17 04:56:12,416 INFO L226 Difference]: Without dead ends: 3257 [2025-03-17 04:56:12,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 04:56:12,422 INFO L435 NwaCegarLoop]: 530 mSDtfsCounter, 881 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 881 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 04:56:12,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [881 Valid, 972 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 04:56:12,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3257 states. [2025-03-17 04:56:12,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3257 to 2955. [2025-03-17 04:56:12,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2955 states, 2432 states have (on average 1.5476973684210527) internal successors, (3764), 2436 states have internal predecessors, (3764), 504 states have call successors, (504), 18 states have call predecessors, (504), 18 states have return successors, (504), 500 states have call predecessors, (504), 504 states have call successors, (504) [2025-03-17 04:56:12,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2955 states to 2955 states and 4772 transitions. [2025-03-17 04:56:12,635 INFO L78 Accepts]: Start accepts. Automaton has 2955 states and 4772 transitions. Word has length 501 [2025-03-17 04:56:12,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:56:12,636 INFO L471 AbstractCegarLoop]: Abstraction has 2955 states and 4772 transitions. [2025-03-17 04:56:12,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-17 04:56:12,637 INFO L276 IsEmpty]: Start isEmpty. Operand 2955 states and 4772 transitions. [2025-03-17 04:56:12,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2025-03-17 04:56:12,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:56:12,643 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:56:12,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 04:56:12,644 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:56:12,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:56:12,645 INFO L85 PathProgramCache]: Analyzing trace with hash 599803728, now seen corresponding path program 1 times [2025-03-17 04:56:12,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:56:12,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484148483] [2025-03-17 04:56:12,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:56:12,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:56:12,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 501 statements into 1 equivalence classes. [2025-03-17 04:56:12,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 501 of 501 statements. [2025-03-17 04:56:12,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:56:12,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:56:12,850 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-03-17 04:56:12,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:56:12,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484148483] [2025-03-17 04:56:12,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484148483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:56:12,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:56:12,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:56:12,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766773430] [2025-03-17 04:56:12,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:56:12,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:56:12,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:56:12,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:56:12,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:56:12,853 INFO L87 Difference]: Start difference. First operand 2955 states and 4772 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-17 04:56:13,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:56:13,180 INFO L93 Difference]: Finished difference Result 7766 states and 12490 transitions. [2025-03-17 04:56:13,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:56:13,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 501 [2025-03-17 04:56:13,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:56:13,206 INFO L225 Difference]: With dead ends: 7766 [2025-03-17 04:56:13,206 INFO L226 Difference]: Without dead ends: 4997 [2025-03-17 04:56:13,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:56:13,213 INFO L435 NwaCegarLoop]: 508 mSDtfsCounter, 496 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:56:13,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 988 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:56:13,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4997 states. [2025-03-17 04:56:13,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4997 to 3021. [2025-03-17 04:56:13,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3021 states, 2498 states have (on average 1.5516413130504403) internal successors, (3876), 2502 states have internal predecessors, (3876), 504 states have call successors, (504), 18 states have call predecessors, (504), 18 states have return successors, (504), 500 states have call predecessors, (504), 504 states have call successors, (504) [2025-03-17 04:56:13,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3021 states to 3021 states and 4884 transitions. [2025-03-17 04:56:13,412 INFO L78 Accepts]: Start accepts. Automaton has 3021 states and 4884 transitions. Word has length 501 [2025-03-17 04:56:13,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:56:13,414 INFO L471 AbstractCegarLoop]: Abstraction has 3021 states and 4884 transitions. [2025-03-17 04:56:13,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-17 04:56:13,414 INFO L276 IsEmpty]: Start isEmpty. Operand 3021 states and 4884 transitions. [2025-03-17 04:56:13,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2025-03-17 04:56:13,419 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:56:13,419 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:56:13,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 04:56:13,420 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:56:13,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:56:13,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1586989532, now seen corresponding path program 1 times [2025-03-17 04:56:13,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:56:13,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556331536] [2025-03-17 04:56:13,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:56:13,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:56:13,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 502 statements into 1 equivalence classes. [2025-03-17 04:56:13,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 502 of 502 statements. [2025-03-17 04:56:13,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:56:13,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:56:14,463 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-03-17 04:56:14,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:56:14,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556331536] [2025-03-17 04:56:14,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556331536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:56:14,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:56:14,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 04:56:14,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727727720] [2025-03-17 04:56:14,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:56:14,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:56:14,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:56:14,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:56:14,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:56:14,466 INFO L87 Difference]: Start difference. First operand 3021 states and 4884 transitions. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-17 04:56:15,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:56:15,223 INFO L93 Difference]: Finished difference Result 7715 states and 12406 transitions. [2025-03-17 04:56:15,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 04:56:15,225 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 502 [2025-03-17 04:56:15,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:56:15,250 INFO L225 Difference]: With dead ends: 7715 [2025-03-17 04:56:15,251 INFO L226 Difference]: Without dead ends: 4895 [2025-03-17 04:56:15,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:56:15,260 INFO L435 NwaCegarLoop]: 654 mSDtfsCounter, 1319 mSDsluCounter, 1302 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1319 SdHoareTripleChecker+Valid, 1956 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 04:56:15,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1319 Valid, 1956 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 04:56:15,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4895 states. [2025-03-17 04:56:15,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4895 to 2876. [2025-03-17 04:56:15,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2876 states, 2501 states have (on average 1.5953618552578968) internal successors, (3990), 2501 states have internal predecessors, (3990), 360 states have call successors, (360), 14 states have call predecessors, (360), 14 states have return successors, (360), 360 states have call predecessors, (360), 360 states have call successors, (360) [2025-03-17 04:56:15,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2876 states to 2876 states and 4710 transitions. [2025-03-17 04:56:15,422 INFO L78 Accepts]: Start accepts. Automaton has 2876 states and 4710 transitions. Word has length 502 [2025-03-17 04:56:15,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:56:15,423 INFO L471 AbstractCegarLoop]: Abstraction has 2876 states and 4710 transitions. [2025-03-17 04:56:15,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-17 04:56:15,424 INFO L276 IsEmpty]: Start isEmpty. Operand 2876 states and 4710 transitions. [2025-03-17 04:56:15,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2025-03-17 04:56:15,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:56:15,428 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:56:15,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 04:56:15,428 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:56:15,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:56:15,429 INFO L85 PathProgramCache]: Analyzing trace with hash -522043717, now seen corresponding path program 1 times [2025-03-17 04:56:15,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:56:15,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085044963] [2025-03-17 04:56:15,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:56:15,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:56:15,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 502 statements into 1 equivalence classes. [2025-03-17 04:56:15,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 502 of 502 statements. [2025-03-17 04:56:15,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:56:15,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:56:15,965 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-03-17 04:56:15,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:56:15,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085044963] [2025-03-17 04:56:15,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085044963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:56:15,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:56:15,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 04:56:15,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041740820] [2025-03-17 04:56:15,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:56:15,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:56:15,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:56:15,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:56:15,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:56:15,966 INFO L87 Difference]: Start difference. First operand 2876 states and 4710 transitions. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-17 04:56:16,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:56:16,810 INFO L93 Difference]: Finished difference Result 10832 states and 17699 transitions. [2025-03-17 04:56:16,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 04:56:16,811 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 502 [2025-03-17 04:56:16,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:56:16,852 INFO L225 Difference]: With dead ends: 10832 [2025-03-17 04:56:16,854 INFO L226 Difference]: Without dead ends: 8157 [2025-03-17 04:56:16,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 04:56:16,866 INFO L435 NwaCegarLoop]: 907 mSDtfsCounter, 843 mSDsluCounter, 1708 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 843 SdHoareTripleChecker+Valid, 2615 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 04:56:16,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [843 Valid, 2615 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 04:56:16,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8157 states. [2025-03-17 04:56:17,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8157 to 8153. [2025-03-17 04:56:17,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8153 states, 7178 states have (on average 1.5777375313457789) internal successors, (11325), 7178 states have internal predecessors, (11325), 936 states have call successors, (936), 38 states have call predecessors, (936), 38 states have return successors, (936), 936 states have call predecessors, (936), 936 states have call successors, (936) [2025-03-17 04:56:17,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8153 states to 8153 states and 13197 transitions. [2025-03-17 04:56:17,246 INFO L78 Accepts]: Start accepts. Automaton has 8153 states and 13197 transitions. Word has length 502 [2025-03-17 04:56:17,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:56:17,246 INFO L471 AbstractCegarLoop]: Abstraction has 8153 states and 13197 transitions. [2025-03-17 04:56:17,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-17 04:56:17,247 INFO L276 IsEmpty]: Start isEmpty. Operand 8153 states and 13197 transitions. [2025-03-17 04:56:17,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2025-03-17 04:56:17,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:56:17,254 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:56:17,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 04:56:17,255 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:56:17,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:56:17,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1599162565, now seen corresponding path program 1 times [2025-03-17 04:56:17,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:56:17,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737999695] [2025-03-17 04:56:17,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:56:17,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:56:17,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 502 statements into 1 equivalence classes. [2025-03-17 04:56:17,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 502 of 502 statements. [2025-03-17 04:56:17,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:56:17,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:56:18,232 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-03-17 04:56:18,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:56:18,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737999695] [2025-03-17 04:56:18,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737999695] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:56:18,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:56:18,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:56:18,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188584837] [2025-03-17 04:56:18,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:56:18,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:56:18,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:56:18,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:56:18,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:56:18,234 INFO L87 Difference]: Start difference. First operand 8153 states and 13197 transitions. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-17 04:56:18,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:56:18,800 INFO L93 Difference]: Finished difference Result 23050 states and 37173 transitions. [2025-03-17 04:56:18,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:56:18,801 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 502 [2025-03-17 04:56:18,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:56:18,843 INFO L225 Difference]: With dead ends: 23050 [2025-03-17 04:56:18,843 INFO L226 Difference]: Without dead ends: 15117 [2025-03-17 04:56:18,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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 04:56:18,867 INFO L435 NwaCegarLoop]: 567 mSDtfsCounter, 525 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 1526 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 04:56:18,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 1526 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 04:56:18,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15117 states. [2025-03-17 04:56:19,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15117 to 13628. [2025-03-17 04:56:19,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13628 states, 12479 states have (on average 1.5897107139995192) internal successors, (19838), 12485 states have internal predecessors, (19838), 1092 states have call successors, (1092), 56 states have call predecessors, (1092), 56 states have return successors, (1092), 1086 states have call predecessors, (1092), 1092 states have call successors, (1092) [2025-03-17 04:56:19,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13628 states to 13628 states and 22022 transitions. [2025-03-17 04:56:19,350 INFO L78 Accepts]: Start accepts. Automaton has 13628 states and 22022 transitions. Word has length 502 [2025-03-17 04:56:19,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:56:19,352 INFO L471 AbstractCegarLoop]: Abstraction has 13628 states and 22022 transitions. [2025-03-17 04:56:19,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-17 04:56:19,353 INFO L276 IsEmpty]: Start isEmpty. Operand 13628 states and 22022 transitions. [2025-03-17 04:56:19,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2025-03-17 04:56:19,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:56:19,363 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:56:19,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 04:56:19,363 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:56:19,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:56:19,364 INFO L85 PathProgramCache]: Analyzing trace with hash 584514362, now seen corresponding path program 1 times [2025-03-17 04:56:19,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:56:19,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102764591] [2025-03-17 04:56:19,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:56:19,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:56:19,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 502 statements into 1 equivalence classes. [2025-03-17 04:56:19,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 502 of 502 statements. [2025-03-17 04:56:19,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:56:19,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:56:20,310 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-03-17 04:56:20,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:56:20,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102764591] [2025-03-17 04:56:20,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102764591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:56:20,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:56:20,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 04:56:20,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60096621] [2025-03-17 04:56:20,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:56:20,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:56:20,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:56:20,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:56:20,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:56:20,313 INFO L87 Difference]: Start difference. First operand 13628 states and 22022 transitions. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-17 04:56:21,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:56:21,393 INFO L93 Difference]: Finished difference Result 49415 states and 80058 transitions. [2025-03-17 04:56:21,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 04:56:21,394 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 502 [2025-03-17 04:56:21,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:56:21,482 INFO L225 Difference]: With dead ends: 49415 [2025-03-17 04:56:21,482 INFO L226 Difference]: Without dead ends: 34133 [2025-03-17 04:56:21,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:56:21,519 INFO L435 NwaCegarLoop]: 659 mSDtfsCounter, 1111 mSDsluCounter, 1253 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1111 SdHoareTripleChecker+Valid, 1912 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 04:56:21,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1111 Valid, 1912 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 04:56:21,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34133 states. [2025-03-17 04:56:22,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34133 to 19205. [2025-03-17 04:56:22,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19205 states, 18056 states have (on average 1.6150310146211786) internal successors, (29161), 18062 states have internal predecessors, (29161), 1092 states have call successors, (1092), 56 states have call predecessors, (1092), 56 states have return successors, (1092), 1086 states have call predecessors, (1092), 1092 states have call successors, (1092) [2025-03-17 04:56:22,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19205 states to 19205 states and 31345 transitions. [2025-03-17 04:56:22,364 INFO L78 Accepts]: Start accepts. Automaton has 19205 states and 31345 transitions. Word has length 502 [2025-03-17 04:56:22,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:56:22,365 INFO L471 AbstractCegarLoop]: Abstraction has 19205 states and 31345 transitions. [2025-03-17 04:56:22,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-17 04:56:22,365 INFO L276 IsEmpty]: Start isEmpty. Operand 19205 states and 31345 transitions. [2025-03-17 04:56:22,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2025-03-17 04:56:22,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:56:22,379 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:56:22,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 04:56:22,379 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:56:22,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:56:22,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1161153062, now seen corresponding path program 1 times [2025-03-17 04:56:22,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:56:22,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159415645] [2025-03-17 04:56:22,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:56:22,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:56:22,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 502 statements into 1 equivalence classes. [2025-03-17 04:56:23,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 502 of 502 statements. [2025-03-17 04:56:23,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:56:23,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:56:32,252 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-03-17 04:56:32,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:56:32,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159415645] [2025-03-17 04:56:32,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159415645] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:56:32,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:56:32,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2025-03-17 04:56:32,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721463885] [2025-03-17 04:56:32,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:56:32,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-17 04:56:32,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:56:32,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-17 04:56:32,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=563, Unknown=0, NotChecked=0, Total=650 [2025-03-17 04:56:32,256 INFO L87 Difference]: Start difference. First operand 19205 states and 31345 transitions. Second operand has 26 states, 26 states have (on average 5.576923076923077) internal successors, (145), 26 states have internal predecessors, (145), 7 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 7 states have call predecessors, (72), 7 states have call successors, (72) [2025-03-17 04:56:46,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:56:46,651 INFO L93 Difference]: Finished difference Result 118116 states and 192220 transitions. [2025-03-17 04:56:46,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 04:56:46,652 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.576923076923077) internal successors, (145), 26 states have internal predecessors, (145), 7 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 7 states have call predecessors, (72), 7 states have call successors, (72) Word has length 502 [2025-03-17 04:56:46,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:56:47,027 INFO L225 Difference]: With dead ends: 118116 [2025-03-17 04:56:47,028 INFO L226 Difference]: Without dead ends: 99193 [2025-03-17 04:56:47,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=389, Invalid=1171, Unknown=0, NotChecked=0, Total=1560 [2025-03-17 04:56:47,120 INFO L435 NwaCegarLoop]: 456 mSDtfsCounter, 13461 mSDsluCounter, 5612 mSDsCounter, 0 mSdLazyCounter, 5368 mSolverCounterSat, 1006 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13461 SdHoareTripleChecker+Valid, 6068 SdHoareTripleChecker+Invalid, 6374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1006 IncrementalHoareTripleChecker+Valid, 5368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2025-03-17 04:56:47,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13461 Valid, 6068 Invalid, 6374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1006 Valid, 5368 Invalid, 0 Unknown, 0 Unchecked, 9.5s Time] [2025-03-17 04:56:47,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99193 states. [2025-03-17 04:56:49,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99193 to 64495. [2025-03-17 04:56:49,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64495 states, 62124 states have (on average 1.6235110424312664) internal successors, (100859), 62154 states have internal predecessors, (100859), 2184 states have call successors, (2184), 186 states have call predecessors, (2184), 186 states have return successors, (2184), 2154 states have call predecessors, (2184), 2184 states have call successors, (2184) [2025-03-17 04:56:49,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64495 states to 64495 states and 105227 transitions. [2025-03-17 04:56:49,523 INFO L78 Accepts]: Start accepts. Automaton has 64495 states and 105227 transitions. Word has length 502 [2025-03-17 04:56:49,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:56:49,526 INFO L471 AbstractCegarLoop]: Abstraction has 64495 states and 105227 transitions. [2025-03-17 04:56:49,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.576923076923077) internal successors, (145), 26 states have internal predecessors, (145), 7 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 7 states have call predecessors, (72), 7 states have call successors, (72) [2025-03-17 04:56:49,527 INFO L276 IsEmpty]: Start isEmpty. Operand 64495 states and 105227 transitions. [2025-03-17 04:56:49,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2025-03-17 04:56:49,572 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:56:49,573 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:56:49,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 04:56:49,573 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:56:49,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:56:49,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1463300665, now seen corresponding path program 1 times [2025-03-17 04:56:49,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:56:49,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979873928] [2025-03-17 04:56:49,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:56:49,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:56:49,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 502 statements into 1 equivalence classes. [2025-03-17 04:56:52,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 502 of 502 statements. [2025-03-17 04:56:52,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:56:52,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:56:54,104 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 24 proven. 189 refuted. 0 times theorem prover too weak. 10011 trivial. 0 not checked. [2025-03-17 04:56:54,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:56:54,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979873928] [2025-03-17 04:56:54,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979873928] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:56:54,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606603035] [2025-03-17 04:56:54,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:56:54,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:56:54,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:56:54,108 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 04:56:54,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 04:56:54,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 502 statements into 1 equivalence classes. [2025-03-17 04:56:54,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 502 of 502 statements. [2025-03-17 04:56:54,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:56:54,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:56:54,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 1271 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 04:56:54,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:56:55,092 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 4127 proven. 57 refuted. 0 times theorem prover too weak. 6040 trivial. 0 not checked. [2025-03-17 04:56:55,093 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 04:56:55,763 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 156 proven. 57 refuted. 0 times theorem prover too weak. 10011 trivial. 0 not checked. [2025-03-17 04:56:55,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606603035] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 04:56:55,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 04:56:55,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 8] total 18 [2025-03-17 04:56:55,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542686772] [2025-03-17 04:56:55,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 04:56:55,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 04:56:55,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:56:55,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 04:56:55,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2025-03-17 04:56:55,767 INFO L87 Difference]: Start difference. First operand 64495 states and 105227 transitions. Second operand has 18 states, 18 states have (on average 15.88888888888889) internal successors, (286), 18 states have internal predecessors, (286), 6 states have call successors, (216), 3 states have call predecessors, (216), 6 states have return successors, (216), 6 states have call predecessors, (216), 6 states have call successors, (216) [2025-03-17 04:57:02,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:57:02,019 INFO L93 Difference]: Finished difference Result 175531 states and 283723 transitions. [2025-03-17 04:57:02,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2025-03-17 04:57:02,023 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 15.88888888888889) internal successors, (286), 18 states have internal predecessors, (286), 6 states have call successors, (216), 3 states have call predecessors, (216), 6 states have return successors, (216), 6 states have call predecessors, (216), 6 states have call successors, (216) Word has length 502 [2025-03-17 04:57:02,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:57:02,245 INFO L225 Difference]: With dead ends: 175531 [2025-03-17 04:57:02,246 INFO L226 Difference]: Without dead ends: 111191 [2025-03-17 04:57:02,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1079 GetRequests, 1003 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2093 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1212, Invalid=4794, Unknown=0, NotChecked=0, Total=6006 [2025-03-17 04:57:02,303 INFO L435 NwaCegarLoop]: 503 mSDtfsCounter, 11454 mSDsluCounter, 4202 mSDsCounter, 0 mSdLazyCounter, 3210 mSolverCounterSat, 1788 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11463 SdHoareTripleChecker+Valid, 4705 SdHoareTripleChecker+Invalid, 4998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1788 IncrementalHoareTripleChecker+Valid, 3210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-03-17 04:57:02,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11463 Valid, 4705 Invalid, 4998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1788 Valid, 3210 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-03-17 04:57:02,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111191 states. [2025-03-17 04:57:04,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111191 to 93731. [2025-03-17 04:57:04,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93731 states, 91132 states have (on average 1.6012597111881666) internal successors, (145926), 91205 states have internal predecessors, (145926), 2316 states have call successors, (2316), 282 states have call predecessors, (2316), 282 states have return successors, (2316), 2243 states have call predecessors, (2316), 2316 states have call successors, (2316) [2025-03-17 04:57:04,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93731 states to 93731 states and 150558 transitions. [2025-03-17 04:57:04,829 INFO L78 Accepts]: Start accepts. Automaton has 93731 states and 150558 transitions. Word has length 502 [2025-03-17 04:57:04,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:57:04,831 INFO L471 AbstractCegarLoop]: Abstraction has 93731 states and 150558 transitions. [2025-03-17 04:57:04,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 15.88888888888889) internal successors, (286), 18 states have internal predecessors, (286), 6 states have call successors, (216), 3 states have call predecessors, (216), 6 states have return successors, (216), 6 states have call predecessors, (216), 6 states have call successors, (216) [2025-03-17 04:57:04,831 INFO L276 IsEmpty]: Start isEmpty. Operand 93731 states and 150558 transitions. [2025-03-17 04:57:04,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2025-03-17 04:57:04,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:57:04,870 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:57:04,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 04:57:05,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-17 04:57:05,074 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:57:05,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:57:05,076 INFO L85 PathProgramCache]: Analyzing trace with hash 959566329, now seen corresponding path program 1 times [2025-03-17 04:57:05,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:57:05,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588465679] [2025-03-17 04:57:05,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:57:05,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:57:05,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 502 statements into 1 equivalence classes.