./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-26.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-26.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 efdf1b64b72144bc512d85f167c8c53d14c070e676801a1f37bb17c76e61f00f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:42:09,116 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:42:09,168 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:42:09,171 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:42:09,172 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:42:09,195 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:42:09,196 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:42:09,196 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:42:09,196 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:42:09,196 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:42:09,196 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:42:09,196 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:42:09,197 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:42:09,197 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:42:09,197 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:42:09,197 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:42:09,197 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:42:09,197 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:42:09,197 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:42:09,198 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:42:09,198 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:42:09,198 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:42:09,198 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:42:09,198 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:42:09,198 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:42:09,198 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:42:09,198 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:42:09,198 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:42:09,198 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:42:09,198 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:42:09,198 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:42:09,199 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:42:09,199 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:42:09,199 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:42:09,199 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:42:09,199 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:42:09,199 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:42:09,199 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:42:09,199 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:42:09,199 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:42:09,199 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:42:09,200 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:42:09,200 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:42:09,200 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 -> efdf1b64b72144bc512d85f167c8c53d14c070e676801a1f37bb17c76e61f00f [2025-03-08 15:42:09,423 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:42:09,430 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:42:09,432 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:42:09,434 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:42:09,434 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:42:09,435 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-26.i [2025-03-08 15:42:10,562 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1eb33af2/ab89dfecc0e7400b8e07e1470c512663/FLAGc01856cc8 [2025-03-08 15:42:10,830 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:42:10,831 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-26.i [2025-03-08 15:42:10,841 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1eb33af2/ab89dfecc0e7400b8e07e1470c512663/FLAGc01856cc8 [2025-03-08 15:42:10,852 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1eb33af2/ab89dfecc0e7400b8e07e1470c512663 [2025-03-08 15:42:10,853 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:42:10,854 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:42:10,855 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:42:10,855 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:42:10,860 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:42:10,860 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:42:10" (1/1) ... [2025-03-08 15:42:10,861 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5824e600 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:42:10, skipping insertion in model container [2025-03-08 15:42:10,862 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:42:10" (1/1) ... [2025-03-08 15:42:10,887 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:42:10,995 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-26.i[916,929] [2025-03-08 15:42:11,124 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:42:11,139 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:42:11,146 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-26.i[916,929] [2025-03-08 15:42:11,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:42:11,258 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:42:11,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:42:11 WrapperNode [2025-03-08 15:42:11,259 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:42:11,260 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:42:11,260 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:42:11,260 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:42:11,265 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:42:11" (1/1) ... [2025-03-08 15:42:11,285 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:42:11" (1/1) ... [2025-03-08 15:42:11,365 INFO L138 Inliner]: procedures = 26, calls = 95, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 799 [2025-03-08 15:42:11,365 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:42:11,366 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:42:11,366 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:42:11,367 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:42:11,373 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:42:11" (1/1) ... [2025-03-08 15:42:11,373 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:42:11" (1/1) ... [2025-03-08 15:42:11,399 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:42:11" (1/1) ... [2025-03-08 15:42:11,467 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:42:11,467 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:42:11" (1/1) ... [2025-03-08 15:42:11,467 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:42:11" (1/1) ... [2025-03-08 15:42:11,489 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:42:11" (1/1) ... [2025-03-08 15:42:11,493 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:42:11" (1/1) ... [2025-03-08 15:42:11,499 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:42:11" (1/1) ... [2025-03-08 15:42:11,509 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:42:11" (1/1) ... [2025-03-08 15:42:11,525 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:42:11,527 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:42:11,527 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:42:11,527 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:42:11,528 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:42:11" (1/1) ... [2025-03-08 15:42:11,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:42:11,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:42:11,551 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:42:11,554 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:42:11,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:42:11,571 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:42:11,571 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:42:11,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:42:11,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:42:11,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:42:11,673 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:42:11,675 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:42:12,548 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L678: havoc property_#t~ite56#1;havoc property_#t~bitwise55#1;havoc property_#t~short57#1;havoc property_#t~ite59#1;havoc property_#t~bitwise58#1;havoc property_#t~short60#1;havoc property_#t~ite62#1;havoc property_#t~bitwise61#1;havoc property_#t~short63#1;havoc property_#t~bitwise64#1;havoc property_#t~short65#1;havoc property_#t~ite67#1;havoc property_#t~bitwise66#1;havoc property_#t~short68#1;havoc property_#t~ite73#1;havoc property_#t~ite72#1;havoc property_#t~ite71#1;havoc property_#t~ite70#1;havoc property_#t~bitwise69#1;havoc property_#t~short74#1; [2025-03-08 15:42:12,711 INFO L? ?]: Removed 79 outVars from TransFormulas that were not future-live. [2025-03-08 15:42:12,711 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:42:12,739 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:42:12,739 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:42:12,740 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:42:12 BoogieIcfgContainer [2025-03-08 15:42:12,740 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:42:12,743 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:42:12,744 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:42:12,747 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:42:12,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:42:10" (1/3) ... [2025-03-08 15:42:12,748 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b30c805 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:42:12, skipping insertion in model container [2025-03-08 15:42:12,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:42:11" (2/3) ... [2025-03-08 15:42:12,748 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b30c805 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:42:12, skipping insertion in model container [2025-03-08 15:42:12,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:42:12" (3/3) ... [2025-03-08 15:42:12,749 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-26.i [2025-03-08 15:42:12,760 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:42:12,763 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-26.i that has 2 procedures, 326 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:42:12,814 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:42:12,821 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;@67580281, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:42:12,822 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:42:12,825 INFO L276 IsEmpty]: Start isEmpty. Operand has 326 states, 241 states have (on average 1.5560165975103735) internal successors, (375), 242 states have internal predecessors, (375), 82 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 82 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-08 15:42:12,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 547 [2025-03-08 15:42:12,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:42:12,847 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12,847 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:42:12,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:42:12,852 INFO L85 PathProgramCache]: Analyzing trace with hash 667765109, now seen corresponding path program 1 times [2025-03-08 15:42:12,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:42:12,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033021077] [2025-03-08 15:42:12,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:42:12,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:42:12,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 546 statements into 1 equivalence classes. [2025-03-08 15:42:13,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 546 of 546 statements. [2025-03-08 15:42:13,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:42:13,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:42:13,442 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 13122 trivial. 0 not checked. [2025-03-08 15:42:13,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:42:13,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033021077] [2025-03-08 15:42:13,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033021077] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:42:13,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103733273] [2025-03-08 15:42:13,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:42:13,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:42:13,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:42:13,448 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:42:13,450 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:42:13,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 546 statements into 1 equivalence classes. [2025-03-08 15:42:13,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 546 of 546 statements. [2025-03-08 15:42:13,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:42:13,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:42:13,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 1315 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:42:13,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:42:13,865 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 13122 trivial. 0 not checked. [2025-03-08 15:42:13,865 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:42:13,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103733273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:42:13,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:42:13,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:42:13,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634131159] [2025-03-08 15:42:13,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:42:13,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:42:13,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:42:13,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:42:13,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:42:13,894 INFO L87 Difference]: Start difference. First operand has 326 states, 241 states have (on average 1.5560165975103735) internal successors, (375), 242 states have internal predecessors, (375), 82 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 82 states have call predecessors, (82), 82 states have call successors, (82) Second operand has 2 states, 2 states have (on average 70.5) internal successors, (141), 2 states have internal predecessors, (141), 2 states have call successors, (82), 2 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 2 states have call successors, (82) [2025-03-08 15:42:13,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:42:13,970 INFO L93 Difference]: Finished difference Result 646 states and 1155 transitions. [2025-03-08 15:42:13,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:42:13,973 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 70.5) internal successors, (141), 2 states have internal predecessors, (141), 2 states have call successors, (82), 2 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 2 states have call successors, (82) Word has length 546 [2025-03-08 15:42:13,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:42:13,980 INFO L225 Difference]: With dead ends: 646 [2025-03-08 15:42:13,981 INFO L226 Difference]: Without dead ends: 323 [2025-03-08 15:42:13,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 547 GetRequests, 547 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:42:13,989 INFO L435 NwaCegarLoop]: 520 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:42:13,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 520 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:42:14,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2025-03-08 15:42:14,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2025-03-08 15:42:14,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 239 states have (on average 1.5397489539748954) internal successors, (368), 239 states have internal predecessors, (368), 82 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 82 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-08 15:42:14,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 532 transitions. [2025-03-08 15:42:14,062 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 532 transitions. Word has length 546 [2025-03-08 15:42:14,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:42:14,063 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 532 transitions. [2025-03-08 15:42:14,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 70.5) internal successors, (141), 2 states have internal predecessors, (141), 2 states have call successors, (82), 2 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 2 states have call successors, (82) [2025-03-08 15:42:14,063 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 532 transitions. [2025-03-08 15:42:14,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 547 [2025-03-08 15:42:14,076 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:42:14,076 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14,085 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:42:14,277 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:42:14,277 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:42:14,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:42:14,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1929001399, now seen corresponding path program 1 times [2025-03-08 15:42:14,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:42:14,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787651299] [2025-03-08 15:42:14,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:42:14,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:42:14,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 546 statements into 1 equivalence classes. [2025-03-08 15:42:14,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 546 of 546 statements. [2025-03-08 15:42:14,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:42:14,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:42:14,869 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-03-08 15:42:14,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:42:14,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787651299] [2025-03-08 15:42:14,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787651299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:42:14,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:42:14,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:42:14,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725955757] [2025-03-08 15:42:14,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:42:14,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:42:14,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:42:14,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:42:14,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:42:14,872 INFO L87 Difference]: Start difference. First operand 323 states and 532 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-03-08 15:42:15,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:42:15,019 INFO L93 Difference]: Finished difference Result 960 states and 1584 transitions. [2025-03-08 15:42:15,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:42:15,021 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 546 [2025-03-08 15:42:15,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:42:15,028 INFO L225 Difference]: With dead ends: 960 [2025-03-08 15:42:15,030 INFO L226 Difference]: Without dead ends: 640 [2025-03-08 15:42:15,031 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:42:15,031 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 517 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:42:15,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 1000 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:42:15,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2025-03-08 15:42:15,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 637. [2025-03-08 15:42:15,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 470 states have (on average 1.525531914893617) internal successors, (717), 470 states have internal predecessors, (717), 164 states have call successors, (164), 2 states have call predecessors, (164), 2 states have return successors, (164), 164 states have call predecessors, (164), 164 states have call successors, (164) [2025-03-08 15:42:15,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 1045 transitions. [2025-03-08 15:42:15,121 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 1045 transitions. Word has length 546 [2025-03-08 15:42:15,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:42:15,123 INFO L471 AbstractCegarLoop]: Abstraction has 637 states and 1045 transitions. [2025-03-08 15:42:15,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-03-08 15:42:15,124 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 1045 transitions. [2025-03-08 15:42:15,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 548 [2025-03-08 15:42:15,129 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:42:15,129 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 15:42:15,129 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:42:15,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:42:15,132 INFO L85 PathProgramCache]: Analyzing trace with hash -654553285, now seen corresponding path program 1 times [2025-03-08 15:42:15,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:42:15,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268686501] [2025-03-08 15:42:15,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:42:15,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:42:15,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 547 statements into 1 equivalence classes. [2025-03-08 15:42:15,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 547 of 547 statements. [2025-03-08 15:42:15,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:42:15,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:42:15,430 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-03-08 15:42:15,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:42:15,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268686501] [2025-03-08 15:42:15,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268686501] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:42:15,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:42:15,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:42:15,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461546473] [2025-03-08 15:42:15,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:42:15,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:42:15,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:42:15,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:42:15,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:42:15,433 INFO L87 Difference]: Start difference. First operand 637 states and 1045 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-03-08 15:42:15,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:42:15,604 INFO L93 Difference]: Finished difference Result 1851 states and 3034 transitions. [2025-03-08 15:42:15,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:42:15,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 547 [2025-03-08 15:42:15,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:42:15,613 INFO L225 Difference]: With dead ends: 1851 [2025-03-08 15:42:15,614 INFO L226 Difference]: Without dead ends: 1217 [2025-03-08 15:42:15,616 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:42:15,616 INFO L435 NwaCegarLoop]: 824 mSDtfsCounter, 470 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:42:15,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 1296 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:42:15,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2025-03-08 15:42:15,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 900. [2025-03-08 15:42:15,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 733 states have (on average 1.5457025920873124) internal successors, (1133), 733 states have internal predecessors, (1133), 164 states have call successors, (164), 2 states have call predecessors, (164), 2 states have return successors, (164), 164 states have call predecessors, (164), 164 states have call successors, (164) [2025-03-08 15:42:15,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1461 transitions. [2025-03-08 15:42:15,689 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1461 transitions. Word has length 547 [2025-03-08 15:42:15,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:42:15,691 INFO L471 AbstractCegarLoop]: Abstraction has 900 states and 1461 transitions. [2025-03-08 15:42:15,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-03-08 15:42:15,692 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1461 transitions. [2025-03-08 15:42:15,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2025-03-08 15:42:15,695 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:42:15,696 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 15:42:15,696 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:42:15,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:42:15,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1208981568, now seen corresponding path program 1 times [2025-03-08 15:42:15,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:42:15,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840737273] [2025-03-08 15:42:15,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:42:15,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:42:15,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 548 statements into 1 equivalence classes. [2025-03-08 15:42:15,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 548 of 548 statements. [2025-03-08 15:42:15,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:42:15,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:42:15,972 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-03-08 15:42:15,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:42:15,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840737273] [2025-03-08 15:42:15,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840737273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:42:15,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:42:15,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:42:15,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502031784] [2025-03-08 15:42:15,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:42:15,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:42:15,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:42:15,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:42:15,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:42:15,977 INFO L87 Difference]: Start difference. First operand 900 states and 1461 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-03-08 15:42:16,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:42:16,105 INFO L93 Difference]: Finished difference Result 2620 states and 4255 transitions. [2025-03-08 15:42:16,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:42:16,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 548 [2025-03-08 15:42:16,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:42:16,117 INFO L225 Difference]: With dead ends: 2620 [2025-03-08 15:42:16,117 INFO L226 Difference]: Without dead ends: 1723 [2025-03-08 15:42:16,120 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:42:16,122 INFO L435 NwaCegarLoop]: 764 mSDtfsCounter, 471 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 1259 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:42:16,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 1259 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:42:16,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1723 states. [2025-03-08 15:42:16,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1723 to 1164. [2025-03-08 15:42:16,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1164 states, 997 states have (on average 1.571715145436309) internal successors, (1567), 997 states have internal predecessors, (1567), 164 states have call successors, (164), 2 states have call predecessors, (164), 2 states have return successors, (164), 164 states have call predecessors, (164), 164 states have call successors, (164) [2025-03-08 15:42:16,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1895 transitions. [2025-03-08 15:42:16,227 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1895 transitions. Word has length 548 [2025-03-08 15:42:16,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:42:16,229 INFO L471 AbstractCegarLoop]: Abstraction has 1164 states and 1895 transitions. [2025-03-08 15:42:16,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-03-08 15:42:16,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1895 transitions. [2025-03-08 15:42:16,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 551 [2025-03-08 15:42:16,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:42:16,234 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 15:42:16,234 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:42:16,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:42:16,236 INFO L85 PathProgramCache]: Analyzing trace with hash -8185477, now seen corresponding path program 1 times [2025-03-08 15:42:16,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:42:16,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235180040] [2025-03-08 15:42:16,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:42:16,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:42:16,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 550 statements into 1 equivalence classes. [2025-03-08 15:42:16,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 550 of 550 statements. [2025-03-08 15:42:16,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:42:16,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:42:16,465 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-03-08 15:42:16,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:42:16,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235180040] [2025-03-08 15:42:16,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235180040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:42:16,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:42:16,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:42:16,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794721482] [2025-03-08 15:42:16,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:42:16,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:42:16,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:42:16,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:42:16,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:42:16,469 INFO L87 Difference]: Start difference. First operand 1164 states and 1895 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-03-08 15:42:16,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:42:16,601 INFO L93 Difference]: Finished difference Result 2946 states and 4765 transitions. [2025-03-08 15:42:16,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:42:16,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 550 [2025-03-08 15:42:16,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:42:16,610 INFO L225 Difference]: With dead ends: 2946 [2025-03-08 15:42:16,610 INFO L226 Difference]: Without dead ends: 1785 [2025-03-08 15:42:16,612 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:42:16,613 INFO L435 NwaCegarLoop]: 659 mSDtfsCounter, 500 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:42:16,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 1150 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:42:16,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1785 states. [2025-03-08 15:42:16,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1785 to 1226. [2025-03-08 15:42:16,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1226 states, 1059 states have (on average 1.551463644948064) internal successors, (1643), 1059 states have internal predecessors, (1643), 164 states have call successors, (164), 2 states have call predecessors, (164), 2 states have return successors, (164), 164 states have call predecessors, (164), 164 states have call successors, (164) [2025-03-08 15:42:16,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1971 transitions. [2025-03-08 15:42:16,696 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1971 transitions. Word has length 550 [2025-03-08 15:42:16,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:42:16,697 INFO L471 AbstractCegarLoop]: Abstraction has 1226 states and 1971 transitions. [2025-03-08 15:42:16,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-03-08 15:42:16,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1971 transitions. [2025-03-08 15:42:16,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 551 [2025-03-08 15:42:16,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:42:16,704 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 15:42:16,704 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:42:16,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:42:16,705 INFO L85 PathProgramCache]: Analyzing trace with hash -955486321, now seen corresponding path program 1 times [2025-03-08 15:42:16,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:42:16,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259277128] [2025-03-08 15:42:16,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:42:16,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:42:16,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 550 statements into 1 equivalence classes. [2025-03-08 15:42:16,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 550 of 550 statements. [2025-03-08 15:42:16,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:42:16,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:42:16,936 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-03-08 15:42:16,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:42:16,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259277128] [2025-03-08 15:42:16,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259277128] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:42:16,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:42:16,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:42:16,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069448673] [2025-03-08 15:42:16,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:42:16,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:42:16,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:42:16,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:42:16,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:42:16,939 INFO L87 Difference]: Start difference. First operand 1226 states and 1971 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-03-08 15:42:17,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:42:17,099 INFO L93 Difference]: Finished difference Result 2768 states and 4450 transitions. [2025-03-08 15:42:17,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:42:17,100 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 550 [2025-03-08 15:42:17,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:42:17,109 INFO L225 Difference]: With dead ends: 2768 [2025-03-08 15:42:17,109 INFO L226 Difference]: Without dead ends: 1545 [2025-03-08 15:42:17,112 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:42:17,112 INFO L435 NwaCegarLoop]: 536 mSDtfsCounter, 457 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:42:17,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 980 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:42:17,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1545 states. [2025-03-08 15:42:17,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1545 to 1226. [2025-03-08 15:42:17,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1226 states, 1059 states have (on average 1.5099150141643058) internal successors, (1599), 1059 states have internal predecessors, (1599), 164 states have call successors, (164), 2 states have call predecessors, (164), 2 states have return successors, (164), 164 states have call predecessors, (164), 164 states have call successors, (164) [2025-03-08 15:42:17,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1927 transitions. [2025-03-08 15:42:17,188 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1927 transitions. Word has length 550 [2025-03-08 15:42:17,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:42:17,189 INFO L471 AbstractCegarLoop]: Abstraction has 1226 states and 1927 transitions. [2025-03-08 15:42:17,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-03-08 15:42:17,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1927 transitions. [2025-03-08 15:42:17,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 552 [2025-03-08 15:42:17,193 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:42:17,194 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 15:42:17,194 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:42:17,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:42:17,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1560873294, now seen corresponding path program 1 times [2025-03-08 15:42:17,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:42:17,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116233147] [2025-03-08 15:42:17,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:42:17,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:42:17,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 551 statements into 1 equivalence classes. [2025-03-08 15:42:17,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 551 of 551 statements. [2025-03-08 15:42:17,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:42:17,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:42:18,002 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-03-08 15:42:18,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:42:18,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116233147] [2025-03-08 15:42:18,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116233147] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:42:18,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:42:18,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:42:18,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881027933] [2025-03-08 15:42:18,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:42:18,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:42:18,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:42:18,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:42:18,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:42:18,005 INFO L87 Difference]: Start difference. First operand 1226 states and 1927 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-03-08 15:42:18,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:42:18,145 INFO L93 Difference]: Finished difference Result 2889 states and 4513 transitions. [2025-03-08 15:42:18,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:42:18,146 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 551 [2025-03-08 15:42:18,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:42:18,154 INFO L225 Difference]: With dead ends: 2889 [2025-03-08 15:42:18,154 INFO L226 Difference]: Without dead ends: 1666 [2025-03-08 15:42:18,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:42:18,158 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 186 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:42:18,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 1043 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:42:18,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states. [2025-03-08 15:42:18,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1662. [2025-03-08 15:42:18,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1662 states, 1463 states have (on average 1.49419002050581) internal successors, (2186), 1465 states have internal predecessors, (2186), 194 states have call successors, (194), 4 states have call predecessors, (194), 4 states have return successors, (194), 192 states have call predecessors, (194), 194 states have call successors, (194) [2025-03-08 15:42:18,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1662 states to 1662 states and 2574 transitions. [2025-03-08 15:42:18,234 INFO L78 Accepts]: Start accepts. Automaton has 1662 states and 2574 transitions. Word has length 551 [2025-03-08 15:42:18,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:42:18,235 INFO L471 AbstractCegarLoop]: Abstraction has 1662 states and 2574 transitions. [2025-03-08 15:42:18,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-03-08 15:42:18,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1662 states and 2574 transitions. [2025-03-08 15:42:18,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 552 [2025-03-08 15:42:18,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:42:18,241 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 15:42:18,241 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:42:18,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:42:18,242 INFO L85 PathProgramCache]: Analyzing trace with hash 985182019, now seen corresponding path program 1 times [2025-03-08 15:42:18,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:42:18,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425574209] [2025-03-08 15:42:18,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:42:18,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:42:18,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 551 statements into 1 equivalence classes. [2025-03-08 15:42:18,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 551 of 551 statements. [2025-03-08 15:42:18,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:42:18,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:42:18,722 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-03-08 15:42:18,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:42:18,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425574209] [2025-03-08 15:42:18,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425574209] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:42:18,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:42:18,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:42:18,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445048018] [2025-03-08 15:42:18,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:42:18,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:42:18,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:42:18,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:42:18,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:42:18,725 INFO L87 Difference]: Start difference. First operand 1662 states and 2574 transitions. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) [2025-03-08 15:42:19,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:42:19,288 INFO L93 Difference]: Finished difference Result 5398 states and 8311 transitions. [2025-03-08 15:42:19,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:42:19,290 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) Word has length 551 [2025-03-08 15:42:19,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:42:19,308 INFO L225 Difference]: With dead ends: 5398 [2025-03-08 15:42:19,308 INFO L226 Difference]: Without dead ends: 3739 [2025-03-08 15:42:19,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 15:42:19,312 INFO L435 NwaCegarLoop]: 490 mSDtfsCounter, 1204 mSDsluCounter, 1459 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 375 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1204 SdHoareTripleChecker+Valid, 1949 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 375 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:42:19,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1204 Valid, 1949 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [375 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:42:19,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3739 states. [2025-03-08 15:42:19,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3739 to 3327. [2025-03-08 15:42:19,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3327 states, 2928 states have (on average 1.4931693989071038) internal successors, (4372), 2932 states have internal predecessors, (4372), 388 states have call successors, (388), 10 states have call predecessors, (388), 10 states have return successors, (388), 384 states have call predecessors, (388), 388 states have call successors, (388) [2025-03-08 15:42:19,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3327 states to 3327 states and 5148 transitions. [2025-03-08 15:42:19,493 INFO L78 Accepts]: Start accepts. Automaton has 3327 states and 5148 transitions. Word has length 551 [2025-03-08 15:42:19,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:42:19,493 INFO L471 AbstractCegarLoop]: Abstraction has 3327 states and 5148 transitions. [2025-03-08 15:42:19,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) [2025-03-08 15:42:19,495 INFO L276 IsEmpty]: Start isEmpty. Operand 3327 states and 5148 transitions. [2025-03-08 15:42:19,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 552 [2025-03-08 15:42:19,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:42:19,500 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 15:42:19,500 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:42:19,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:42:19,501 INFO L85 PathProgramCache]: Analyzing trace with hash 599815236, now seen corresponding path program 1 times [2025-03-08 15:42:19,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:42:19,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949005287] [2025-03-08 15:42:19,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:42:19,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:42:19,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 551 statements into 1 equivalence classes. [2025-03-08 15:42:19,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 551 of 551 statements. [2025-03-08 15:42:19,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:42:19,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:42:20,024 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-03-08 15:42:20,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:42:20,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949005287] [2025-03-08 15:42:20,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949005287] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:42:20,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:42:20,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:42:20,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671118072] [2025-03-08 15:42:20,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:42:20,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:42:20,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:42:20,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:42:20,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:42:20,026 INFO L87 Difference]: Start difference. First operand 3327 states and 5148 transitions. Second operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 2 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) [2025-03-08 15:42:20,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:42:20,584 INFO L93 Difference]: Finished difference Result 9459 states and 14582 transitions. [2025-03-08 15:42:20,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:42:20,585 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 2 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) Word has length 551 [2025-03-08 15:42:20,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:42:20,610 INFO L225 Difference]: With dead ends: 9459 [2025-03-08 15:42:20,611 INFO L226 Difference]: Without dead ends: 6135 [2025-03-08 15:42:20,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:42:20,621 INFO L435 NwaCegarLoop]: 492 mSDtfsCounter, 967 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 967 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:42:20,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [967 Valid, 814 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:42:20,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6135 states. [2025-03-08 15:42:20,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6135 to 6129. [2025-03-08 15:42:20,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6129 states, 5594 states have (on average 1.4958884519127638) internal successors, (8368), 5606 states have internal predecessors, (8368), 516 states have call successors, (516), 18 states have call predecessors, (516), 18 states have return successors, (516), 504 states have call predecessors, (516), 516 states have call successors, (516) [2025-03-08 15:42:20,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6129 states to 6129 states and 9400 transitions. [2025-03-08 15:42:20,870 INFO L78 Accepts]: Start accepts. Automaton has 6129 states and 9400 transitions. Word has length 551 [2025-03-08 15:42:20,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:42:20,871 INFO L471 AbstractCegarLoop]: Abstraction has 6129 states and 9400 transitions. [2025-03-08 15:42:20,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 2 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) [2025-03-08 15:42:20,871 INFO L276 IsEmpty]: Start isEmpty. Operand 6129 states and 9400 transitions. [2025-03-08 15:42:20,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 553 [2025-03-08 15:42:20,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:42:20,879 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 15:42:20,879 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:42:20,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:42:20,880 INFO L85 PathProgramCache]: Analyzing trace with hash 489015732, now seen corresponding path program 1 times [2025-03-08 15:42:20,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:42:20,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871144316] [2025-03-08 15:42:20,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:42:20,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:42:20,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 552 statements into 1 equivalence classes. [2025-03-08 15:42:21,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 552 of 552 statements. [2025-03-08 15:42:21,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:42:21,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:42:21,942 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-03-08 15:42:21,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:42:21,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871144316] [2025-03-08 15:42:21,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871144316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:42:21,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:42:21,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:42:21,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549099502] [2025-03-08 15:42:21,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:42:21,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:42:21,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:42:21,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:42:21,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:42:21,950 INFO L87 Difference]: Start difference. First operand 6129 states and 9400 transitions. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-03-08 15:42:22,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:42:22,650 INFO L93 Difference]: Finished difference Result 25121 states and 38404 transitions. [2025-03-08 15:42:22,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:42:22,651 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 552 [2025-03-08 15:42:22,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:42:22,714 INFO L225 Difference]: With dead ends: 25121 [2025-03-08 15:42:22,714 INFO L226 Difference]: Without dead ends: 18995 [2025-03-08 15:42:22,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:42:22,733 INFO L435 NwaCegarLoop]: 764 mSDtfsCounter, 943 mSDsluCounter, 1250 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 943 SdHoareTripleChecker+Valid, 2014 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:42:22,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [943 Valid, 2014 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:42:22,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18995 states. [2025-03-08 15:42:23,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18995 to 10469. [2025-03-08 15:42:23,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10469 states, 9400 states have (on average 1.4859574468085106) internal successors, (13968), 9424 states have internal predecessors, (13968), 1032 states have call successors, (1032), 36 states have call predecessors, (1032), 36 states have return successors, (1032), 1008 states have call predecessors, (1032), 1032 states have call successors, (1032) [2025-03-08 15:42:23,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10469 states to 10469 states and 16032 transitions. [2025-03-08 15:42:23,247 INFO L78 Accepts]: Start accepts. Automaton has 10469 states and 16032 transitions. Word has length 552 [2025-03-08 15:42:23,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:42:23,248 INFO L471 AbstractCegarLoop]: Abstraction has 10469 states and 16032 transitions. [2025-03-08 15:42:23,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-03-08 15:42:23,249 INFO L276 IsEmpty]: Start isEmpty. Operand 10469 states and 16032 transitions. [2025-03-08 15:42:23,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 553 [2025-03-08 15:42:23,259 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:42:23,260 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 15:42:23,260 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:42:23,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:42:23,261 INFO L85 PathProgramCache]: Analyzing trace with hash -96485646, now seen corresponding path program 1 times [2025-03-08 15:42:23,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:42:23,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863239196] [2025-03-08 15:42:23,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:42:23,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:42:23,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 552 statements into 1 equivalence classes. [2025-03-08 15:42:23,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 552 of 552 statements. [2025-03-08 15:42:23,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:42:23,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:42:23,868 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-03-08 15:42:23,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:42:23,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863239196] [2025-03-08 15:42:23,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863239196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:42:23,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:42:23,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:42:23,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401201680] [2025-03-08 15:42:23,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:42:23,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:42:23,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:42:23,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:42:23,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:42:23,871 INFO L87 Difference]: Start difference. First operand 10469 states and 16032 transitions. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-03-08 15:42:24,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:42:24,395 INFO L93 Difference]: Finished difference Result 23580 states and 36080 transitions. [2025-03-08 15:42:24,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:42:24,396 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 552 [2025-03-08 15:42:24,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:42:24,431 INFO L225 Difference]: With dead ends: 23580 [2025-03-08 15:42:24,432 INFO L226 Difference]: Without dead ends: 13114 [2025-03-08 15:42:24,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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:42:24,455 INFO L435 NwaCegarLoop]: 608 mSDtfsCounter, 797 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 1799 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:42:24,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 1799 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:42:24,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13114 states. [2025-03-08 15:42:24,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13114 to 10477. [2025-03-08 15:42:24,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10477 states, 9408 states have (on average 1.4855442176870748) internal successors, (13976), 9432 states have internal predecessors, (13976), 1032 states have call successors, (1032), 36 states have call predecessors, (1032), 36 states have return successors, (1032), 1008 states have call predecessors, (1032), 1032 states have call successors, (1032) [2025-03-08 15:42:24,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10477 states to 10477 states and 16040 transitions. [2025-03-08 15:42:24,931 INFO L78 Accepts]: Start accepts. Automaton has 10477 states and 16040 transitions. Word has length 552 [2025-03-08 15:42:24,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:42:24,932 INFO L471 AbstractCegarLoop]: Abstraction has 10477 states and 16040 transitions. [2025-03-08 15:42:24,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-03-08 15:42:24,932 INFO L276 IsEmpty]: Start isEmpty. Operand 10477 states and 16040 transitions. [2025-03-08 15:42:24,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 553 [2025-03-08 15:42:24,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:42:24,944 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 15:42:24,944 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:42:24,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:42:24,945 INFO L85 PathProgramCache]: Analyzing trace with hash -625404685, now seen corresponding path program 1 times [2025-03-08 15:42:24,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:42:24,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524504930] [2025-03-08 15:42:24,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:42:24,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:42:24,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 552 statements into 1 equivalence classes. [2025-03-08 15:42:25,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 552 of 552 statements. [2025-03-08 15:42:25,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:42:25,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:42:25,740 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-03-08 15:42:25,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:42:25,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524504930] [2025-03-08 15:42:25,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524504930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:42:25,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:42:25,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:42:25,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528949892] [2025-03-08 15:42:25,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:42:25,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:42:25,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:42:25,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:42:25,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:42:25,743 INFO L87 Difference]: Start difference. First operand 10477 states and 16040 transitions. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-03-08 15:42:26,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:42:26,271 INFO L93 Difference]: Finished difference Result 30587 states and 46655 transitions. [2025-03-08 15:42:26,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:42:26,271 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 552 [2025-03-08 15:42:26,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:42:26,313 INFO L225 Difference]: With dead ends: 30587 [2025-03-08 15:42:26,314 INFO L226 Difference]: Without dead ends: 20113 [2025-03-08 15:42:26,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:42:26,338 INFO L435 NwaCegarLoop]: 664 mSDtfsCounter, 491 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 1351 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:42:26,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 1351 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:42:26,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20113 states. [2025-03-08 15:42:26,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20113 to 14117. [2025-03-08 15:42:26,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14117 states, 13048 states have (on average 1.5076640098099325) internal successors, (19672), 13072 states have internal predecessors, (19672), 1032 states have call successors, (1032), 36 states have call predecessors, (1032), 36 states have return successors, (1032), 1008 states have call predecessors, (1032), 1032 states have call successors, (1032) [2025-03-08 15:42:26,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14117 states to 14117 states and 21736 transitions. [2025-03-08 15:42:26,793 INFO L78 Accepts]: Start accepts. Automaton has 14117 states and 21736 transitions. Word has length 552 [2025-03-08 15:42:26,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:42:26,794 INFO L471 AbstractCegarLoop]: Abstraction has 14117 states and 21736 transitions. [2025-03-08 15:42:26,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-03-08 15:42:26,795 INFO L276 IsEmpty]: Start isEmpty. Operand 14117 states and 21736 transitions. [2025-03-08 15:42:26,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 554 [2025-03-08 15:42:26,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:42:26,804 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 15:42:26,804 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:42:26,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:42:26,805 INFO L85 PathProgramCache]: Analyzing trace with hash -634393763, now seen corresponding path program 1 times [2025-03-08 15:42:26,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:42:26,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781626443] [2025-03-08 15:42:26,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:42:26,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:42:26,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 553 statements into 1 equivalence classes. [2025-03-08 15:42:27,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 553 of 553 statements. [2025-03-08 15:42:27,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:42:27,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:42:27,623 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-03-08 15:42:27,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:42:27,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781626443] [2025-03-08 15:42:27,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781626443] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:42:27,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:42:27,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:42:27,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596253746] [2025-03-08 15:42:27,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:42:27,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:42:27,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:42:27,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:42:27,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:42:27,625 INFO L87 Difference]: Start difference. First operand 14117 states and 21736 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-03-08 15:42:28,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:42:28,199 INFO L93 Difference]: Finished difference Result 31741 states and 48830 transitions. [2025-03-08 15:42:28,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:42:28,200 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 553 [2025-03-08 15:42:28,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:42:28,247 INFO L225 Difference]: With dead ends: 31741 [2025-03-08 15:42:28,247 INFO L226 Difference]: Without dead ends: 17627 [2025-03-08 15:42:28,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:42:28,280 INFO L435 NwaCegarLoop]: 690 mSDtfsCounter, 894 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 894 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:42:28,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [894 Valid, 1200 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:42:28,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17627 states. [2025-03-08 15:42:28,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17627 to 17525. [2025-03-08 15:42:28,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17525 states, 15918 states have (on average 1.496544792059304) internal successors, (23822), 15958 states have internal predecessors, (23822), 1548 states have call successors, (1548), 58 states have call predecessors, (1548), 58 states have return successors, (1548), 1508 states have call predecessors, (1548), 1548 states have call successors, (1548) [2025-03-08 15:42:28,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17525 states to 17525 states and 26918 transitions. [2025-03-08 15:42:28,854 INFO L78 Accepts]: Start accepts. Automaton has 17525 states and 26918 transitions. Word has length 553 [2025-03-08 15:42:28,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:42:28,855 INFO L471 AbstractCegarLoop]: Abstraction has 17525 states and 26918 transitions. [2025-03-08 15:42:28,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-03-08 15:42:28,855 INFO L276 IsEmpty]: Start isEmpty. Operand 17525 states and 26918 transitions. [2025-03-08 15:42:28,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 554 [2025-03-08 15:42:28,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:42:28,867 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 15:42:28,867 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:42:28,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:42:28,868 INFO L85 PathProgramCache]: Analyzing trace with hash -514273890, now seen corresponding path program 1 times [2025-03-08 15:42:28,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:42:28,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173641482] [2025-03-08 15:42:28,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:42:28,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:42:28,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 553 statements into 1 equivalence classes. [2025-03-08 15:42:29,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 553 of 553 statements. [2025-03-08 15:42:29,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:42:29,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:42:29,669 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-03-08 15:42:29,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:42:29,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173641482] [2025-03-08 15:42:29,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173641482] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:42:29,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:42:29,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:42:29,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897722659] [2025-03-08 15:42:29,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:42:29,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:42:29,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:42:29,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:42:29,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:42:29,672 INFO L87 Difference]: Start difference. First operand 17525 states and 26918 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-03-08 15:42:30,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:42:30,193 INFO L93 Difference]: Finished difference Result 35055 states and 53849 transitions. [2025-03-08 15:42:30,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:42:30,194 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 553 [2025-03-08 15:42:30,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:42:30,247 INFO L225 Difference]: With dead ends: 35055 [2025-03-08 15:42:30,247 INFO L226 Difference]: Without dead ends: 17533 [2025-03-08 15:42:30,276 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:42:30,277 INFO L435 NwaCegarLoop]: 518 mSDtfsCounter, 0 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:42:30,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1031 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:42:30,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17533 states. [2025-03-08 15:42:30,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17533 to 17533. [2025-03-08 15:42:30,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17533 states, 15926 states have (on average 1.496295366068065) internal successors, (23830), 15966 states have internal predecessors, (23830), 1548 states have call successors, (1548), 58 states have call predecessors, (1548), 58 states have return successors, (1548), 1508 states have call predecessors, (1548), 1548 states have call successors, (1548) [2025-03-08 15:42:30,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17533 states to 17533 states and 26926 transitions. [2025-03-08 15:42:30,886 INFO L78 Accepts]: Start accepts. Automaton has 17533 states and 26926 transitions. Word has length 553 [2025-03-08 15:42:30,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:42:30,887 INFO L471 AbstractCegarLoop]: Abstraction has 17533 states and 26926 transitions. [2025-03-08 15:42:30,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-03-08 15:42:30,887 INFO L276 IsEmpty]: Start isEmpty. Operand 17533 states and 26926 transitions. [2025-03-08 15:42:30,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 555 [2025-03-08 15:42:30,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:42:30,898 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 15:42:30,898 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:42:30,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:42:30,899 INFO L85 PathProgramCache]: Analyzing trace with hash 557195008, now seen corresponding path program 1 times [2025-03-08 15:42:30,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:42:30,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639989014] [2025-03-08 15:42:30,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:42:30,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:42:30,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 554 statements into 1 equivalence classes. [2025-03-08 15:42:32,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 554 of 554 statements. [2025-03-08 15:42:32,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:42:32,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat