./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-14.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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-14.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 fc4d3fa2ecedd768012cc7751a736db9e672ba88ad0e6eb887b83762ab048578 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:41:03,365 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:41:03,422 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:41:03,428 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:41:03,429 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:41:03,447 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:41:03,448 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:41:03,448 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:41:03,448 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:41:03,448 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:41:03,448 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:41:03,448 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:41:03,448 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:41:03,449 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:41:03,449 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:41:03,450 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:41:03,450 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:41:03,450 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:41:03,450 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:41:03,450 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:41:03,450 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:41:03,450 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:41:03,450 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:41:03,450 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:41:03,450 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:41:03,450 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:41:03,450 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:41:03,450 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:41:03,451 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:41:03,451 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:41:03,451 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:41:03,451 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:41:03,451 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:41:03,451 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:41:03,451 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:41:03,451 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:41:03,451 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:41:03,451 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:41:03,451 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:41:03,451 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:41:03,451 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:41:03,451 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:41:03,451 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:41:03,451 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 -> fc4d3fa2ecedd768012cc7751a736db9e672ba88ad0e6eb887b83762ab048578 [2025-03-08 15:41:03,642 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:41:03,648 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:41:03,649 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:41:03,650 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:41:03,651 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:41:03,652 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-14.i [2025-03-08 15:41:04,746 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbfebea79/c2b50ddc7d08493785457e5c8055fd61/FLAG66b3f7868 [2025-03-08 15:41:05,085 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:41:05,086 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-14.i [2025-03-08 15:41:05,098 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbfebea79/c2b50ddc7d08493785457e5c8055fd61/FLAG66b3f7868 [2025-03-08 15:41:05,109 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbfebea79/c2b50ddc7d08493785457e5c8055fd61 [2025-03-08 15:41:05,111 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:41:05,112 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:41:05,113 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:41:05,113 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:41:05,116 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:41:05,116 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:41:05" (1/1) ... [2025-03-08 15:41:05,117 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c7367a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:41:05, skipping insertion in model container [2025-03-08 15:41:05,117 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:41:05" (1/1) ... [2025-03-08 15:41:05,142 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:41:05,234 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-14.i[916,929] [2025-03-08 15:41:05,393 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:41:05,403 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:41:05,413 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-14.i[916,929] [2025-03-08 15:41:05,489 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:41:05,503 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:41:05,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:41:05 WrapperNode [2025-03-08 15:41:05,504 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:41:05,505 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:41:05,506 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:41:05,506 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:41:05,510 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:41:05" (1/1) ... [2025-03-08 15:41:05,531 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:41:05" (1/1) ... [2025-03-08 15:41:05,618 INFO L138 Inliner]: procedures = 26, calls = 97, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 874 [2025-03-08 15:41:05,618 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:41:05,619 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:41:05,619 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:41:05,619 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:41:05,626 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:41:05" (1/1) ... [2025-03-08 15:41:05,626 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:41:05" (1/1) ... [2025-03-08 15:41:05,640 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:41:05" (1/1) ... [2025-03-08 15:41:05,716 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-08 15:41:05,717 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:41:05" (1/1) ... [2025-03-08 15:41:05,718 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:41:05" (1/1) ... [2025-03-08 15:41:05,746 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:41:05" (1/1) ... [2025-03-08 15:41:05,753 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:41:05" (1/1) ... [2025-03-08 15:41:05,762 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:41:05" (1/1) ... [2025-03-08 15:41:05,766 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:41:05" (1/1) ... [2025-03-08 15:41:05,777 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:41:05,778 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:41:05,779 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:41:05,779 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:41:05,779 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:41:05" (1/1) ... [2025-03-08 15:41:05,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:41:05,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:41:05,803 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-08 15:41:05,808 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-08 15:41:05,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:41:05,822 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:41:05,823 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:41:05,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:41:05,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:41:05,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:41:05,934 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:41:05,935 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:41:06,884 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L676: havoc property_#t~ite67#1;havoc property_#t~ite65#1;havoc property_#t~bitwise62#1;havoc property_#t~ite64#1;havoc property_#t~bitwise63#1;havoc property_#t~bitwise66#1;havoc property_#t~short68#1;havoc property_#t~ite71#1;havoc property_#t~ite70#1;havoc property_#t~bitwise69#1;havoc property_#t~short72#1;havoc property_#t~bitwise73#1;havoc property_#t~short74#1;havoc property_#t~ite76#1;havoc property_#t~bitwise75#1;havoc property_#t~short77#1;havoc property_#t~ite80#1;havoc property_#t~ite79#1;havoc property_#t~bitwise78#1;havoc property_#t~short81#1;havoc property_#t~ite84#1;havoc property_#t~ite83#1;havoc property_#t~bitwise82#1;havoc property_#t~short85#1;havoc property_#t~ite87#1;havoc property_#t~bitwise86#1;havoc property_#t~short88#1; [2025-03-08 15:41:07,026 INFO L? ?]: Removed 103 outVars from TransFormulas that were not future-live. [2025-03-08 15:41:07,026 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:41:07,051 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:41:07,052 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-08 15:41:07,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:41:07 BoogieIcfgContainer [2025-03-08 15:41:07,052 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:41:07,054 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:41:07,054 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:41:07,059 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:41:07,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:41:05" (1/3) ... [2025-03-08 15:41:07,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6393bea1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:41:07, skipping insertion in model container [2025-03-08 15:41:07,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:41:05" (2/3) ... [2025-03-08 15:41:07,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6393bea1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:41:07, skipping insertion in model container [2025-03-08 15:41:07,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:41:07" (3/3) ... [2025-03-08 15:41:07,062 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-14.i [2025-03-08 15:41:07,072 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:41:07,074 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-14.i that has 2 procedures, 359 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:41:07,126 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:41:07,133 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;@5bafc95a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:41:07,133 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:41:07,138 INFO L276 IsEmpty]: Start isEmpty. Operand has 359 states, 272 states have (on average 1.525735294117647) internal successors, (415), 273 states have internal predecessors, (415), 84 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-08 15:41:07,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2025-03-08 15:41:07,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:41:07,163 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:41:07,163 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:41:07,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:41:07,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1539324908, now seen corresponding path program 1 times [2025-03-08 15:41:07,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:41:07,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447320223] [2025-03-08 15:41:07,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:41:07,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:41:07,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 574 statements into 1 equivalence classes. [2025-03-08 15:41:07,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 574 of 574 statements. [2025-03-08 15:41:07,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:41:07,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:41:07,807 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 166 refuted. 0 times theorem prover too weak. 13778 trivial. 0 not checked. [2025-03-08 15:41:07,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:41:07,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447320223] [2025-03-08 15:41:07,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447320223] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:41:07,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573582163] [2025-03-08 15:41:07,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:41:07,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:41:07,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:41:07,811 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-08 15:41:07,813 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-08 15:41:07,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 574 statements into 1 equivalence classes. [2025-03-08 15:41:08,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 574 of 574 statements. [2025-03-08 15:41:08,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:41:08,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:41:08,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 1370 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:41:08,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:41:08,239 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 13778 trivial. 0 not checked. [2025-03-08 15:41:08,239 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:41:08,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573582163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:41:08,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:41:08,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:41:08,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325554372] [2025-03-08 15:41:08,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:41:08,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:41:08,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:41:08,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:41:08,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:41:08,267 INFO L87 Difference]: Start difference. First operand has 359 states, 272 states have (on average 1.525735294117647) internal successors, (415), 273 states have internal predecessors, (415), 84 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) Second operand has 2 states, 2 states have (on average 79.5) internal successors, (159), 2 states have internal predecessors, (159), 2 states have call successors, (84), 2 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 2 states have call successors, (84) [2025-03-08 15:41:08,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:41:08,341 INFO L93 Difference]: Finished difference Result 712 states and 1245 transitions. [2025-03-08 15:41:08,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:41:08,343 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 79.5) internal successors, (159), 2 states have internal predecessors, (159), 2 states have call successors, (84), 2 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 2 states have call successors, (84) Word has length 574 [2025-03-08 15:41:08,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:41:08,351 INFO L225 Difference]: With dead ends: 712 [2025-03-08 15:41:08,352 INFO L226 Difference]: Without dead ends: 356 [2025-03-08 15:41:08,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 575 GetRequests, 575 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-08 15:41:08,360 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:41:08,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 560 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:41:08,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-03-08 15:41:08,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2025-03-08 15:41:08,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 270 states have (on average 1.5185185185185186) internal successors, (410), 270 states have internal predecessors, (410), 84 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-08 15:41:08,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 578 transitions. [2025-03-08 15:41:08,434 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 578 transitions. Word has length 574 [2025-03-08 15:41:08,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:41:08,436 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 578 transitions. [2025-03-08 15:41:08,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 79.5) internal successors, (159), 2 states have internal predecessors, (159), 2 states have call successors, (84), 2 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 2 states have call successors, (84) [2025-03-08 15:41:08,436 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 578 transitions. [2025-03-08 15:41:08,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2025-03-08 15:41:08,448 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:41:08,448 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:41:08,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 15:41:08,653 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-08 15:41:08,653 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:41:08,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:41:08,654 INFO L85 PathProgramCache]: Analyzing trace with hash -175471910, now seen corresponding path program 1 times [2025-03-08 15:41:08,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:41:08,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864233905] [2025-03-08 15:41:08,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:41:08,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:41:08,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 574 statements into 1 equivalence classes. [2025-03-08 15:41:08,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 574 of 574 statements. [2025-03-08 15:41:08,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:41:08,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:41:09,311 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-03-08 15:41:09,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:41:09,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864233905] [2025-03-08 15:41:09,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864233905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:41:09,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:41:09,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:41:09,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547199010] [2025-03-08 15:41:09,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:41:09,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:41:09,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:41:09,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:41:09,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:41:09,316 INFO L87 Difference]: Start difference. First operand 356 states and 578 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-08 15:41:09,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:41:09,475 INFO L93 Difference]: Finished difference Result 960 states and 1557 transitions. [2025-03-08 15:41:09,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:41:09,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 574 [2025-03-08 15:41:09,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:41:09,482 INFO L225 Difference]: With dead ends: 960 [2025-03-08 15:41:09,482 INFO L226 Difference]: Without dead ends: 607 [2025-03-08 15:41:09,483 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-08 15:41:09,483 INFO L435 NwaCegarLoop]: 802 mSDtfsCounter, 395 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 1344 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:41:09,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 1344 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:41:09,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2025-03-08 15:41:09,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 604. [2025-03-08 15:41:09,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 480 states have (on average 1.5354166666666667) internal successors, (737), 481 states have internal predecessors, (737), 121 states have call successors, (121), 2 states have call predecessors, (121), 2 states have return successors, (121), 120 states have call predecessors, (121), 121 states have call successors, (121) [2025-03-08 15:41:09,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 979 transitions. [2025-03-08 15:41:09,538 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 979 transitions. Word has length 574 [2025-03-08 15:41:09,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:41:09,539 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 979 transitions. [2025-03-08 15:41:09,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-08 15:41:09,539 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 979 transitions. [2025-03-08 15:41:09,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2025-03-08 15:41:09,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:41:09,547 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:41:09,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 15:41:09,548 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:41:09,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:41:09,548 INFO L85 PathProgramCache]: Analyzing trace with hash 607907065, now seen corresponding path program 1 times [2025-03-08 15:41:09,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:41:09,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209981607] [2025-03-08 15:41:09,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:41:09,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:41:09,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 574 statements into 1 equivalence classes. [2025-03-08 15:41:09,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 574 of 574 statements. [2025-03-08 15:41:09,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:41:09,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:41:09,875 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-03-08 15:41:09,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:41:09,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209981607] [2025-03-08 15:41:09,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209981607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:41:09,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:41:09,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:41:09,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279886360] [2025-03-08 15:41:09,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:41:09,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:41:09,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:41:09,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:41:09,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:41:09,879 INFO L87 Difference]: Start difference. First operand 604 states and 979 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-08 15:41:10,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:41:10,072 INFO L93 Difference]: Finished difference Result 1743 states and 2821 transitions. [2025-03-08 15:41:10,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:41:10,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 574 [2025-03-08 15:41:10,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:41:10,084 INFO L225 Difference]: With dead ends: 1743 [2025-03-08 15:41:10,086 INFO L226 Difference]: Without dead ends: 1142 [2025-03-08 15:41:10,088 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-08 15:41:10,090 INFO L435 NwaCegarLoop]: 933 mSDtfsCounter, 486 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:41:10,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 1440 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:41:10,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2025-03-08 15:41:10,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 820. [2025-03-08 15:41:10,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 820 states, 696 states have (on average 1.5747126436781609) internal successors, (1096), 697 states have internal predecessors, (1096), 121 states have call successors, (121), 2 states have call predecessors, (121), 2 states have return successors, (121), 120 states have call predecessors, (121), 121 states have call successors, (121) [2025-03-08 15:41:10,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1338 transitions. [2025-03-08 15:41:10,163 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1338 transitions. Word has length 574 [2025-03-08 15:41:10,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:41:10,166 INFO L471 AbstractCegarLoop]: Abstraction has 820 states and 1338 transitions. [2025-03-08 15:41:10,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-08 15:41:10,167 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1338 transitions. [2025-03-08 15:41:10,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2025-03-08 15:41:10,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:41:10,174 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:41:10,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 15:41:10,175 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:41:10,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:41:10,175 INFO L85 PathProgramCache]: Analyzing trace with hash 78988026, now seen corresponding path program 1 times [2025-03-08 15:41:10,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:41:10,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393562952] [2025-03-08 15:41:10,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:41:10,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:41:10,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 574 statements into 1 equivalence classes. [2025-03-08 15:41:10,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 574 of 574 statements. [2025-03-08 15:41:10,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:41:10,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:41:10,472 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-03-08 15:41:10,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:41:10,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393562952] [2025-03-08 15:41:10,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393562952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:41:10,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:41:10,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:41:10,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468964006] [2025-03-08 15:41:10,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:41:10,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:41:10,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:41:10,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:41:10,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:41:10,475 INFO L87 Difference]: Start difference. First operand 820 states and 1338 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-08 15:41:10,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:41:10,583 INFO L93 Difference]: Finished difference Result 2371 states and 3869 transitions. [2025-03-08 15:41:10,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:41:10,584 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 574 [2025-03-08 15:41:10,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:41:10,592 INFO L225 Difference]: With dead ends: 2371 [2025-03-08 15:41:10,593 INFO L226 Difference]: Without dead ends: 1554 [2025-03-08 15:41:10,595 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-08 15:41:10,596 INFO L435 NwaCegarLoop]: 871 mSDtfsCounter, 422 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 1403 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:41:10,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 1403 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:41:10,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2025-03-08 15:41:10,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1551. [2025-03-08 15:41:10,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1551 states, 1327 states have (on average 1.573474001507159) internal successors, (2088), 1330 states have internal predecessors, (2088), 219 states have call successors, (219), 4 states have call predecessors, (219), 4 states have return successors, (219), 216 states have call predecessors, (219), 219 states have call successors, (219) [2025-03-08 15:41:10,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1551 states to 1551 states and 2526 transitions. [2025-03-08 15:41:10,710 INFO L78 Accepts]: Start accepts. Automaton has 1551 states and 2526 transitions. Word has length 574 [2025-03-08 15:41:10,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:41:10,711 INFO L471 AbstractCegarLoop]: Abstraction has 1551 states and 2526 transitions. [2025-03-08 15:41:10,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-08 15:41:10,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1551 states and 2526 transitions. [2025-03-08 15:41:10,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2025-03-08 15:41:10,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:41:10,720 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:41:10,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 15:41:10,720 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:41:10,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:41:10,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1406067525, now seen corresponding path program 1 times [2025-03-08 15:41:10,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:41:10,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087977130] [2025-03-08 15:41:10,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:41:10,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:41:10,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 574 statements into 1 equivalence classes. [2025-03-08 15:41:10,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 574 of 574 statements. [2025-03-08 15:41:10,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:41:10,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:41:11,245 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-03-08 15:41:11,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:41:11,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087977130] [2025-03-08 15:41:11,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087977130] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:41:11,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:41:11,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:41:11,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406327014] [2025-03-08 15:41:11,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:41:11,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:41:11,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:41:11,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:41:11,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:41:11,248 INFO L87 Difference]: Start difference. First operand 1551 states and 2526 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-08 15:41:11,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:41:11,966 INFO L93 Difference]: Finished difference Result 9883 states and 16108 transitions. [2025-03-08 15:41:11,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 15:41:11,966 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 574 [2025-03-08 15:41:11,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:41:11,998 INFO L225 Difference]: With dead ends: 9883 [2025-03-08 15:41:11,998 INFO L226 Difference]: Without dead ends: 8335 [2025-03-08 15:41:12,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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-08 15:41:12,006 INFO L435 NwaCegarLoop]: 1675 mSDtfsCounter, 1816 mSDsluCounter, 2899 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1816 SdHoareTripleChecker+Valid, 4574 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:41:12,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1816 Valid, 4574 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 15:41:12,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8335 states. [2025-03-08 15:41:12,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8335 to 6189. [2025-03-08 15:41:12,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6189 states, 5296 states have (on average 1.5657099697885197) internal successors, (8292), 5308 states have internal predecessors, (8292), 876 states have call successors, (876), 16 states have call predecessors, (876), 16 states have return successors, (876), 864 states have call predecessors, (876), 876 states have call successors, (876) [2025-03-08 15:41:12,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6189 states to 6189 states and 10044 transitions. [2025-03-08 15:41:12,465 INFO L78 Accepts]: Start accepts. Automaton has 6189 states and 10044 transitions. Word has length 574 [2025-03-08 15:41:12,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:41:12,466 INFO L471 AbstractCegarLoop]: Abstraction has 6189 states and 10044 transitions. [2025-03-08 15:41:12,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-08 15:41:12,466 INFO L276 IsEmpty]: Start isEmpty. Operand 6189 states and 10044 transitions. [2025-03-08 15:41:12,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2025-03-08 15:41:12,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:41:12,478 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:41:12,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 15:41:12,479 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:41:12,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:41:12,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1690164506, now seen corresponding path program 1 times [2025-03-08 15:41:12,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:41:12,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988078299] [2025-03-08 15:41:12,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:41:12,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:41:12,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 574 statements into 1 equivalence classes. [2025-03-08 15:41:12,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 574 of 574 statements. [2025-03-08 15:41:12,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:41:12,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:41:12,836 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-03-08 15:41:12,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:41:12,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988078299] [2025-03-08 15:41:12,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988078299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:41:12,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:41:12,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:41:12,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420187574] [2025-03-08 15:41:12,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:41:12,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:41:12,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:41:12,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:41:12,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:41:12,839 INFO L87 Difference]: Start difference. First operand 6189 states and 10044 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-08 15:41:13,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:41:13,084 INFO L93 Difference]: Finished difference Result 13923 states and 22608 transitions. [2025-03-08 15:41:13,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:41:13,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 574 [2025-03-08 15:41:13,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:41:13,119 INFO L225 Difference]: With dead ends: 13923 [2025-03-08 15:41:13,119 INFO L226 Difference]: Without dead ends: 7737 [2025-03-08 15:41:13,134 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-08 15:41:13,135 INFO L435 NwaCegarLoop]: 867 mSDtfsCounter, 393 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 1399 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:41:13,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 1399 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:41:13,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7737 states. [2025-03-08 15:41:13,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7737 to 4643. [2025-03-08 15:41:13,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4643 states, 3973 states have (on average 1.5625471935565065) internal successors, (6208), 3982 states have internal predecessors, (6208), 657 states have call successors, (657), 12 states have call predecessors, (657), 12 states have return successors, (657), 648 states have call predecessors, (657), 657 states have call successors, (657) [2025-03-08 15:41:13,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4643 states to 4643 states and 7522 transitions. [2025-03-08 15:41:13,417 INFO L78 Accepts]: Start accepts. Automaton has 4643 states and 7522 transitions. Word has length 574 [2025-03-08 15:41:13,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:41:13,418 INFO L471 AbstractCegarLoop]: Abstraction has 4643 states and 7522 transitions. [2025-03-08 15:41:13,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-08 15:41:13,419 INFO L276 IsEmpty]: Start isEmpty. Operand 4643 states and 7522 transitions. [2025-03-08 15:41:13,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 576 [2025-03-08 15:41:13,429 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:41:13,430 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:41:13,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 15:41:13,430 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:41:13,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:41:13,431 INFO L85 PathProgramCache]: Analyzing trace with hash -762033411, now seen corresponding path program 1 times [2025-03-08 15:41:13,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:41:13,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336332635] [2025-03-08 15:41:13,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:41:13,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:41:13,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 575 statements into 1 equivalence classes. [2025-03-08 15:41:13,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 575 of 575 statements. [2025-03-08 15:41:13,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:41:13,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:41:14,186 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-03-08 15:41:14,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:41:14,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336332635] [2025-03-08 15:41:14,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336332635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:41:14,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:41:14,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:41:14,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835072126] [2025-03-08 15:41:14,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:41:14,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:41:14,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:41:14,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:41:14,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:41:14,190 INFO L87 Difference]: Start difference. First operand 4643 states and 7522 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-08 15:41:14,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:41:14,692 INFO L93 Difference]: Finished difference Result 11676 states and 18904 transitions. [2025-03-08 15:41:14,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:41:14,693 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 575 [2025-03-08 15:41:14,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:41:14,725 INFO L225 Difference]: With dead ends: 11676 [2025-03-08 15:41:14,726 INFO L226 Difference]: Without dead ends: 7036 [2025-03-08 15:41:14,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:41:14,738 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 428 mSDsluCounter, 1090 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 1646 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:41:14,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 1646 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:41:14,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7036 states. [2025-03-08 15:41:14,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7036 to 6786. [2025-03-08 15:41:14,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6786 states, 6030 states have (on average 1.5849087893864013) internal successors, (9557), 6039 states have internal predecessors, (9557), 741 states have call successors, (741), 14 states have call predecessors, (741), 14 states have return successors, (741), 732 states have call predecessors, (741), 741 states have call successors, (741) [2025-03-08 15:41:15,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6786 states to 6786 states and 11039 transitions. [2025-03-08 15:41:15,023 INFO L78 Accepts]: Start accepts. Automaton has 6786 states and 11039 transitions. Word has length 575 [2025-03-08 15:41:15,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:41:15,023 INFO L471 AbstractCegarLoop]: Abstraction has 6786 states and 11039 transitions. [2025-03-08 15:41:15,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-08 15:41:15,024 INFO L276 IsEmpty]: Start isEmpty. Operand 6786 states and 11039 transitions. [2025-03-08 15:41:15,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2025-03-08 15:41:15,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:41:15,029 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:41:15,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 15:41:15,030 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:41:15,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:41:15,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1480739917, now seen corresponding path program 1 times [2025-03-08 15:41:15,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:41:15,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926593849] [2025-03-08 15:41:15,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:41:15,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:41:15,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 576 statements into 1 equivalence classes. [2025-03-08 15:41:15,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 576 of 576 statements. [2025-03-08 15:41:15,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:41:15,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:41:19,690 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-03-08 15:41:19,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:41:19,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926593849] [2025-03-08 15:41:19,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926593849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:41:19,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:41:19,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-08 15:41:19,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272493271] [2025-03-08 15:41:19,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:41:19,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 15:41:19,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:41:19,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 15:41:19,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2025-03-08 15:41:19,697 INFO L87 Difference]: Start difference. First operand 6786 states and 11039 transitions. Second operand has 18 states, 18 states have (on average 8.833333333333334) internal successors, (159), 18 states have internal predecessors, (159), 4 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 4 states have call predecessors, (84), 4 states have call successors, (84) [2025-03-08 15:41:25,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:41:25,438 INFO L93 Difference]: Finished difference Result 24766 states and 39537 transitions. [2025-03-08 15:41:25,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-08 15:41:25,439 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 8.833333333333334) internal successors, (159), 18 states have internal predecessors, (159), 4 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 4 states have call predecessors, (84), 4 states have call successors, (84) Word has length 576 [2025-03-08 15:41:25,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:41:25,491 INFO L225 Difference]: With dead ends: 24766 [2025-03-08 15:41:25,492 INFO L226 Difference]: Without dead ends: 18982 [2025-03-08 15:41:25,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=321, Invalid=1161, Unknown=0, NotChecked=0, Total=1482 [2025-03-08 15:41:25,507 INFO L435 NwaCegarLoop]: 747 mSDtfsCounter, 5552 mSDsluCounter, 7156 mSDsCounter, 0 mSdLazyCounter, 4180 mSolverCounterSat, 750 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5552 SdHoareTripleChecker+Valid, 7903 SdHoareTripleChecker+Invalid, 4930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 750 IncrementalHoareTripleChecker+Valid, 4180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:41:25,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5552 Valid, 7903 Invalid, 4930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [750 Valid, 4180 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-03-08 15:41:25,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18982 states. [2025-03-08 15:41:26,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18982 to 17562. [2025-03-08 15:41:26,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17562 states, 15557 states have (on average 1.550684579289066) internal successors, (24124), 15606 states have internal predecessors, (24124), 1925 states have call successors, (1925), 79 states have call predecessors, (1925), 79 states have return successors, (1925), 1876 states have call predecessors, (1925), 1925 states have call successors, (1925) [2025-03-08 15:41:26,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17562 states to 17562 states and 27974 transitions. [2025-03-08 15:41:26,228 INFO L78 Accepts]: Start accepts. Automaton has 17562 states and 27974 transitions. Word has length 576 [2025-03-08 15:41:26,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:41:26,230 INFO L471 AbstractCegarLoop]: Abstraction has 17562 states and 27974 transitions. [2025-03-08 15:41:26,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 8.833333333333334) internal successors, (159), 18 states have internal predecessors, (159), 4 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 4 states have call predecessors, (84), 4 states have call successors, (84) [2025-03-08 15:41:26,230 INFO L276 IsEmpty]: Start isEmpty. Operand 17562 states and 27974 transitions. [2025-03-08 15:41:26,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2025-03-08 15:41:26,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:41:26,249 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:41:26,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 15:41:26,250 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:41:26,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:41:26,250 INFO L85 PathProgramCache]: Analyzing trace with hash -787638220, now seen corresponding path program 1 times [2025-03-08 15:41:26,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:41:26,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109061768] [2025-03-08 15:41:26,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:41:26,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:41:26,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 576 statements into 1 equivalence classes. [2025-03-08 15:41:26,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 576 of 576 statements. [2025-03-08 15:41:26,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:41:26,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:41:30,485 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-03-08 15:41:30,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:41:30,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109061768] [2025-03-08 15:41:30,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109061768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:41:30,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:41:30,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-08 15:41:30,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195528653] [2025-03-08 15:41:30,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:41:30,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 15:41:30,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:41:30,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 15:41:30,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2025-03-08 15:41:30,489 INFO L87 Difference]: Start difference. First operand 17562 states and 27974 transitions. Second operand has 19 states, 19 states have (on average 8.368421052631579) internal successors, (159), 19 states have internal predecessors, (159), 5 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 5 states have call predecessors, (84), 5 states have call successors, (84) [2025-03-08 15:41:37,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:41:37,788 INFO L93 Difference]: Finished difference Result 35046 states and 55285 transitions. [2025-03-08 15:41:37,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-08 15:41:37,789 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 8.368421052631579) internal successors, (159), 19 states have internal predecessors, (159), 5 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 5 states have call predecessors, (84), 5 states have call successors, (84) Word has length 576 [2025-03-08 15:41:37,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:41:37,858 INFO L225 Difference]: With dead ends: 35046 [2025-03-08 15:41:37,859 INFO L226 Difference]: Without dead ends: 28946 [2025-03-08 15:41:37,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=340, Invalid=1220, Unknown=0, NotChecked=0, Total=1560 [2025-03-08 15:41:37,877 INFO L435 NwaCegarLoop]: 1110 mSDtfsCounter, 5408 mSDsluCounter, 8076 mSDsCounter, 0 mSdLazyCounter, 6725 mSolverCounterSat, 786 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5408 SdHoareTripleChecker+Valid, 9186 SdHoareTripleChecker+Invalid, 7511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 786 IncrementalHoareTripleChecker+Valid, 6725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:41:37,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5408 Valid, 9186 Invalid, 7511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [786 Valid, 6725 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2025-03-08 15:41:37,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28946 states. [2025-03-08 15:41:39,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28946 to 18810. [2025-03-08 15:41:39,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18810 states, 16741 states have (on average 1.5490114091153455) internal successors, (25932), 16798 states have internal predecessors, (25932), 1981 states have call successors, (1981), 87 states have call predecessors, (1981), 87 states have return successors, (1981), 1924 states have call predecessors, (1981), 1981 states have call successors, (1981) [2025-03-08 15:41:39,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18810 states to 18810 states and 29894 transitions. [2025-03-08 15:41:39,088 INFO L78 Accepts]: Start accepts. Automaton has 18810 states and 29894 transitions. Word has length 576 [2025-03-08 15:41:39,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:41:39,090 INFO L471 AbstractCegarLoop]: Abstraction has 18810 states and 29894 transitions. [2025-03-08 15:41:39,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 8.368421052631579) internal successors, (159), 19 states have internal predecessors, (159), 5 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 5 states have call predecessors, (84), 5 states have call successors, (84) [2025-03-08 15:41:39,090 INFO L276 IsEmpty]: Start isEmpty. Operand 18810 states and 29894 transitions. [2025-03-08 15:41:39,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2025-03-08 15:41:39,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:41:39,111 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:41:39,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 15:41:39,111 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:41:39,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:41:39,112 INFO L85 PathProgramCache]: Analyzing trace with hash -2088816780, now seen corresponding path program 1 times [2025-03-08 15:41:39,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:41:39,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245290071] [2025-03-08 15:41:39,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:41:39,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:41:39,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 576 statements into 1 equivalence classes. [2025-03-08 15:41:40,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 576 of 576 statements. [2025-03-08 15:41:40,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:41:40,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:41:42,554 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-03-08 15:41:42,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:41:42,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245290071] [2025-03-08 15:41:42,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245290071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:41:42,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:41:42,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 15:41:42,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024031100] [2025-03-08 15:41:42,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:41:42,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 15:41:42,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:41:42,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 15:41:42,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:41:42,557 INFO L87 Difference]: Start difference. First operand 18810 states and 29894 transitions. Second operand has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 2 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 2 states have call predecessors, (84), 2 states have call successors, (84) [2025-03-08 15:41:43,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:41:43,858 INFO L93 Difference]: Finished difference Result 41434 states and 65595 transitions. [2025-03-08 15:41:43,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:41:43,859 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 2 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 2 states have call predecessors, (84), 2 states have call successors, (84) Word has length 576 [2025-03-08 15:41:43,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:41:43,915 INFO L225 Difference]: With dead ends: 41434 [2025-03-08 15:41:43,915 INFO L226 Difference]: Without dead ends: 24902 [2025-03-08 15:41:43,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 15:41:43,940 INFO L435 NwaCegarLoop]: 563 mSDtfsCounter, 1164 mSDsluCounter, 2310 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 459 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1164 SdHoareTripleChecker+Valid, 2873 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 459 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 15:41:43,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1164 Valid, 2873 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [459 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 15:41:43,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24902 states. [2025-03-08 15:41:44,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24902 to 18810. [2025-03-08 15:41:44,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18810 states, 16741 states have (on average 1.5485335404097724) internal successors, (25924), 16798 states have internal predecessors, (25924), 1981 states have call successors, (1981), 87 states have call predecessors, (1981), 87 states have return successors, (1981), 1924 states have call predecessors, (1981), 1981 states have call successors, (1981) [2025-03-08 15:41:44,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18810 states to 18810 states and 29886 transitions. [2025-03-08 15:41:44,783 INFO L78 Accepts]: Start accepts. Automaton has 18810 states and 29886 transitions. Word has length 576 [2025-03-08 15:41:44,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:41:44,784 INFO L471 AbstractCegarLoop]: Abstraction has 18810 states and 29886 transitions. [2025-03-08 15:41:44,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 2 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 2 states have call predecessors, (84), 2 states have call successors, (84) [2025-03-08 15:41:44,784 INFO L276 IsEmpty]: Start isEmpty. Operand 18810 states and 29886 transitions. [2025-03-08 15:41:44,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2025-03-08 15:41:44,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:41:44,800 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:41:44,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 15:41:44,801 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:41:44,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:41:44,801 INFO L85 PathProgramCache]: Analyzing trace with hash -525218638, now seen corresponding path program 1 times [2025-03-08 15:41:44,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:41:44,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211288608] [2025-03-08 15:41:44,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:41:44,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:41:44,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 576 statements into 1 equivalence classes. [2025-03-08 15:41:45,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 576 of 576 statements. [2025-03-08 15:41:45,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:41:45,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:41:47,223 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-03-08 15:41:47,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:41:47,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211288608] [2025-03-08 15:41:47,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211288608] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:41:47,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:41:47,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 15:41:47,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624142665] [2025-03-08 15:41:47,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:41:47,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 15:41:47,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:41:47,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 15:41:47,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 15:41:47,229 INFO L87 Difference]: Start difference. First operand 18810 states and 29886 transitions. Second operand has 13 states, 13 states have (on average 12.23076923076923) internal successors, (159), 13 states have internal predecessors, (159), 3 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 3 states have call predecessors, (84), 3 states have call successors, (84) [2025-03-08 15:41:50,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:41:50,816 INFO L93 Difference]: Finished difference Result 48220 states and 76212 transitions. [2025-03-08 15:41:50,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 15:41:50,817 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 12.23076923076923) internal successors, (159), 13 states have internal predecessors, (159), 3 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 3 states have call predecessors, (84), 3 states have call successors, (84) Word has length 576 [2025-03-08 15:41:50,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:41:50,923 INFO L225 Difference]: With dead ends: 48220 [2025-03-08 15:41:50,923 INFO L226 Difference]: Without dead ends: 42092 [2025-03-08 15:41:50,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=166, Invalid=484, Unknown=0, NotChecked=0, Total=650 [2025-03-08 15:41:50,940 INFO L435 NwaCegarLoop]: 611 mSDtfsCounter, 2659 mSDsluCounter, 3880 mSDsCounter, 0 mSdLazyCounter, 2380 mSolverCounterSat, 574 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2659 SdHoareTripleChecker+Valid, 4491 SdHoareTripleChecker+Invalid, 2954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 574 IncrementalHoareTripleChecker+Valid, 2380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:41:50,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2659 Valid, 4491 Invalid, 2954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [574 Valid, 2380 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-08 15:41:50,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42092 states. [2025-03-08 15:41:52,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42092 to 34364. [2025-03-08 15:41:52,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34364 states, 31825 states have (on average 1.5704634721131185) internal successors, (49980), 31890 states have internal predecessors, (49980), 2417 states have call successors, (2417), 121 states have call predecessors, (2417), 121 states have return successors, (2417), 2352 states have call predecessors, (2417), 2417 states have call successors, (2417) [2025-03-08 15:41:52,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34364 states to 34364 states and 54814 transitions. [2025-03-08 15:41:52,324 INFO L78 Accepts]: Start accepts. Automaton has 34364 states and 54814 transitions. Word has length 576 [2025-03-08 15:41:52,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:41:52,325 INFO L471 AbstractCegarLoop]: Abstraction has 34364 states and 54814 transitions. [2025-03-08 15:41:52,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.23076923076923) internal successors, (159), 13 states have internal predecessors, (159), 3 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 3 states have call predecessors, (84), 3 states have call successors, (84) [2025-03-08 15:41:52,325 INFO L276 IsEmpty]: Start isEmpty. Operand 34364 states and 54814 transitions. [2025-03-08 15:41:52,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2025-03-08 15:41:52,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:41:52,451 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:41:52,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 15:41:52,451 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:41:52,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:41:52,452 INFO L85 PathProgramCache]: Analyzing trace with hash 167883059, now seen corresponding path program 1 times [2025-03-08 15:41:52,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:41:52,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913648206] [2025-03-08 15:41:52,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:41:52,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:41:52,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 576 statements into 1 equivalence classes. [2025-03-08 15:41:52,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 576 of 576 statements. [2025-03-08 15:41:52,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:41:52,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:41:53,164 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-03-08 15:41:53,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:41:53,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913648206] [2025-03-08 15:41:53,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913648206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:41:53,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:41:53,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 15:41:53,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026436419] [2025-03-08 15:41:53,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:41:53,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 15:41:53,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:41:53,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 15:41:53,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:41:53,167 INFO L87 Difference]: Start difference. First operand 34364 states and 54814 transitions. Second operand has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 2 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 2 states have call predecessors, (84), 2 states have call successors, (84) [2025-03-08 15:41:54,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:41:54,226 INFO L93 Difference]: Finished difference Result 68482 states and 109235 transitions. [2025-03-08 15:41:54,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:41:54,226 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 2 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 2 states have call predecessors, (84), 2 states have call successors, (84) Word has length 576 [2025-03-08 15:41:54,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:41:54,309 INFO L225 Difference]: With dead ends: 68482 [2025-03-08 15:41:54,309 INFO L226 Difference]: Without dead ends: 34364 [2025-03-08 15:41:54,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:41:54,342 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 779 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 287 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 287 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:41:54,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [779 Valid, 549 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [287 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:41:54,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34364 states. [2025-03-08 15:41:55,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34364 to 34364. [2025-03-08 15:41:55,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34364 states, 31825 states have (on average 1.5694579732914375) internal successors, (49948), 31890 states have internal predecessors, (49948), 2417 states have call successors, (2417), 121 states have call predecessors, (2417), 121 states have return successors, (2417), 2352 states have call predecessors, (2417), 2417 states have call successors, (2417) [2025-03-08 15:41:55,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34364 states to 34364 states and 54782 transitions. [2025-03-08 15:41:55,451 INFO L78 Accepts]: Start accepts. Automaton has 34364 states and 54782 transitions. Word has length 576 [2025-03-08 15:41:55,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:41:55,451 INFO L471 AbstractCegarLoop]: Abstraction has 34364 states and 54782 transitions. [2025-03-08 15:41:55,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 2 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 2 states have call predecessors, (84), 2 states have call successors, (84) [2025-03-08 15:41:55,452 INFO L276 IsEmpty]: Start isEmpty. Operand 34364 states and 54782 transitions. [2025-03-08 15:41:55,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2025-03-08 15:41:55,476 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:41:55,476 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:41:55,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 15:41:55,476 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:41:55,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:41:55,477 INFO L85 PathProgramCache]: Analyzing trace with hash -640815656, now seen corresponding path program 1 times [2025-03-08 15:41:55,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:41:55,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601224826] [2025-03-08 15:41:55,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:41:55,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:41:55,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 577 statements into 1 equivalence classes. [2025-03-08 15:41:55,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 577 of 577 statements. [2025-03-08 15:41:55,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:41:55,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:41:58,397 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-03-08 15:41:58,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:41:58,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601224826] [2025-03-08 15:41:58,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601224826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:41:58,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:41:58,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 15:41:58,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194027393] [2025-03-08 15:41:58,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:41:58,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 15:41:58,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:41:58,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 15:41:58,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 15:41:58,400 INFO L87 Difference]: Start difference. First operand 34364 states and 54782 transitions. Second operand has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 3 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 3 states have call predecessors, (84), 3 states have call successors, (84) [2025-03-08 15:42:01,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:42:01,743 INFO L93 Difference]: Finished difference Result 59174 states and 93802 transitions. [2025-03-08 15:42:01,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 15:42:01,744 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 3 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 3 states have call predecessors, (84), 3 states have call successors, (84) Word has length 577 [2025-03-08 15:42:01,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:42:01,835 INFO L225 Difference]: With dead ends: 59174 [2025-03-08 15:42:01,835 INFO L226 Difference]: Without dead ends: 42552 [2025-03-08 15:42:01,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=484, Unknown=0, NotChecked=0, Total=650 [2025-03-08 15:42:01,870 INFO L435 NwaCegarLoop]: 835 mSDtfsCounter, 2207 mSDsluCounter, 3988 mSDsCounter, 0 mSdLazyCounter, 2304 mSolverCounterSat, 586 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2207 SdHoareTripleChecker+Valid, 4823 SdHoareTripleChecker+Invalid, 2890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 586 IncrementalHoareTripleChecker+Valid, 2304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:42:01,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2207 Valid, 4823 Invalid, 2890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [586 Valid, 2304 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-08 15:42:01,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42552 states. [2025-03-08 15:42:02,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42552 to 36740. [2025-03-08 15:42:02,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36740 states, 34169 states have (on average 1.5689074892446369) internal successors, (53608), 34238 states have internal predecessors, (53608), 2445 states have call successors, (2445), 125 states have call predecessors, (2445), 125 states have return successors, (2445), 2376 states have call predecessors, (2445), 2445 states have call successors, (2445) [2025-03-08 15:42:02,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36740 states to 36740 states and 58498 transitions. [2025-03-08 15:42:02,951 INFO L78 Accepts]: Start accepts. Automaton has 36740 states and 58498 transitions. Word has length 577 [2025-03-08 15:42:02,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:42:02,951 INFO L471 AbstractCegarLoop]: Abstraction has 36740 states and 58498 transitions. [2025-03-08 15:42:02,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 3 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 3 states have call predecessors, (84), 3 states have call successors, (84) [2025-03-08 15:42:02,951 INFO L276 IsEmpty]: Start isEmpty. Operand 36740 states and 58498 transitions. [2025-03-08 15:42:02,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2025-03-08 15:42:02,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:42:02,977 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:42:02,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 15:42:02,978 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:42:02,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:42:02,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1941994216, now seen corresponding path program 1 times [2025-03-08 15:42:02,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:42:02,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925565018] [2025-03-08 15:42:02,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:42:02,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:42:03,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 577 statements into 1 equivalence classes. [2025-03-08 15:42:03,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 577 of 577 statements. [2025-03-08 15:42:03,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:42:03,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:42:04,901 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-03-08 15:42:04,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:42:04,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925565018] [2025-03-08 15:42:04,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925565018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:42:04,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:42:04,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 15:42:04,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018067406] [2025-03-08 15:42:04,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:42:04,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 15:42:04,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:42:04,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 15:42:04,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:42:04,902 INFO L87 Difference]: Start difference. First operand 36740 states and 58498 transitions. Second operand has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-08 15:42:07,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:42:07,549 INFO L93 Difference]: Finished difference Result 122960 states and 194742 transitions. [2025-03-08 15:42:07,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 15:42:07,550 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 577 [2025-03-08 15:42:07,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:42:07,755 INFO L225 Difference]: With dead ends: 122960 [2025-03-08 15:42:07,756 INFO L226 Difference]: Without dead ends: 102282 [2025-03-08 15:42:07,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:42:07,814 INFO L435 NwaCegarLoop]: 650 mSDtfsCounter, 608 mSDsluCounter, 1208 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 608 SdHoareTripleChecker+Valid, 1858 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 15:42:07,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [608 Valid, 1858 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 15:42:07,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102282 states. [2025-03-08 15:42:09,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102282 to 58032. [2025-03-08 15:42:09,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58032 states, 55245 states have (on average 1.5802335052945968) internal successors, (87300), 55350 states have internal predecessors, (87300), 2625 states have call successors, (2625), 161 states have call predecessors, (2625), 161 states have return successors, (2625), 2520 states have call predecessors, (2625), 2625 states have call successors, (2625) [2025-03-08 15:42:10,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58032 states to 58032 states and 92550 transitions. [2025-03-08 15:42:10,056 INFO L78 Accepts]: Start accepts. Automaton has 58032 states and 92550 transitions. Word has length 577 [2025-03-08 15:42:10,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:42:10,057 INFO L471 AbstractCegarLoop]: Abstraction has 58032 states and 92550 transitions. [2025-03-08 15:42:10,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-03-08 15:42:10,057 INFO L276 IsEmpty]: Start isEmpty. Operand 58032 states and 92550 transitions. [2025-03-08 15:42:10,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2025-03-08 15:42:10,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:42:10,110 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:42:10,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 15:42:10,110 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:42:10,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:42:10,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1248892519, now seen corresponding path program 1 times [2025-03-08 15:42:10,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:42:10,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478719525] [2025-03-08 15:42:10,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:42:10,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:42:10,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 577 statements into 1 equivalence classes. [2025-03-08 15:42:10,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 577 of 577 statements. [2025-03-08 15:42:10,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:42:10,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:42:11,824 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-03-08 15:42:11,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:42:11,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478719525] [2025-03-08 15:42:11,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478719525] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:42:11,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:42:11,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 15:42:11,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903085166] [2025-03-08 15:42:11,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:42:11,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 15:42:11,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:42:11,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 15:42:11,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 15:42:11,826 INFO L87 Difference]: Start difference. First operand 58032 states and 92550 transitions. Second operand has 9 states, 9 states have (on average 17.77777777777778) internal successors, (160), 9 states have internal predecessors, (160), 3 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 3 states have call predecessors, (84), 3 states have call successors, (84)