./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-19.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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-19.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 a3c9443ab2a9a0ac9f8b1a4dfc6a8acea9c43b5adb9d9f2e6268045e7c9cd431 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:30:29,061 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:30:29,115 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:30:29,123 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:30:29,126 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:30:29,144 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:30:29,145 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:30:29,145 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:30:29,145 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:30:29,145 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:30:29,145 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:30:29,145 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:30:29,145 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:30:29,146 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:30:29,146 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:30:29,146 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:30:29,146 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:30:29,146 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:30:29,146 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:30:29,146 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:30:29,146 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:30:29,146 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:30:29,146 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:30:29,146 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:30:29,146 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:30:29,147 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:30:29,147 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:30:29,147 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:30:29,147 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:30:29,147 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:30:29,147 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:30:29,147 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:30:29,147 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:30:29,147 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:30:29,147 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:30:29,148 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:30:29,148 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:30:29,148 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:30:29,148 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:30:29,148 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:30:29,148 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:30:29,148 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:30:29,148 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:30:29,148 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 -> a3c9443ab2a9a0ac9f8b1a4dfc6a8acea9c43b5adb9d9f2e6268045e7c9cd431 [2025-03-04 00:30:29,368 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:30:29,373 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:30:29,376 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:30:29,377 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:30:29,377 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:30:29,378 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-19.i [2025-03-04 00:30:30,493 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ea795bd3/275990f506494db9b036eea39db2d665/FLAGb99663987 [2025-03-04 00:30:30,802 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:30:30,806 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-19.i [2025-03-04 00:30:30,828 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ea795bd3/275990f506494db9b036eea39db2d665/FLAGb99663987 [2025-03-04 00:30:31,064 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ea795bd3/275990f506494db9b036eea39db2d665 [2025-03-04 00:30:31,066 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:30:31,067 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:30:31,069 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:30:31,069 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:30:31,072 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:30:31,074 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:30:31" (1/1) ... [2025-03-04 00:30:31,075 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ac6c102 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:31, skipping insertion in model container [2025-03-04 00:30:31,075 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:30:31" (1/1) ... [2025-03-04 00:30:31,117 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:30:31,231 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-19.i[916,929] [2025-03-04 00:30:31,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:30:31,388 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:30:31,396 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-19.i[916,929] [2025-03-04 00:30:31,476 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:30:31,491 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:30:31,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:31 WrapperNode [2025-03-04 00:30:31,493 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:30:31,493 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:30:31,494 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:30:31,494 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:30:31,498 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:31" (1/1) ... [2025-03-04 00:30:31,517 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:31" (1/1) ... [2025-03-04 00:30:31,589 INFO L138 Inliner]: procedures = 26, calls = 72, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 709 [2025-03-04 00:30:31,590 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:30:31,590 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:30:31,591 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:30:31,591 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:30:31,597 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:31" (1/1) ... [2025-03-04 00:30:31,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:31" (1/1) ... [2025-03-04 00:30:31,625 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:31" (1/1) ... [2025-03-04 00:30:31,694 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-04 00:30:31,694 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:31" (1/1) ... [2025-03-04 00:30:31,694 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:31" (1/1) ... [2025-03-04 00:30:31,719 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:31" (1/1) ... [2025-03-04 00:30:31,722 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:31" (1/1) ... [2025-03-04 00:30:31,727 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:31" (1/1) ... [2025-03-04 00:30:31,731 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:31" (1/1) ... [2025-03-04 00:30:31,741 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:30:31,742 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:30:31,742 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:30:31,742 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:30:31,743 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:31" (1/1) ... [2025-03-04 00:30:31,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:30:31,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:30:31,769 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-04 00:30:31,773 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-04 00:30:31,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:30:31,788 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:30:31,788 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:30:31,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:30:31,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:30:31,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:30:31,886 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:30:31,887 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:30:32,747 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L651: havoc property_#t~ite46#1;havoc property_#t~bitwise45#1;havoc property_#t~short47#1;havoc property_#t~ite50#1;havoc property_#t~ite49#1;havoc property_#t~bitwise48#1;havoc property_#t~short51#1;havoc property_#t~ite55#1;havoc property_#t~ite54#1;havoc property_#t~ite53#1;havoc property_#t~bitwise52#1;havoc property_#t~short56#1;havoc property_#t~ite60#1;havoc property_#t~ite59#1;havoc property_#t~ite58#1;havoc property_#t~bitwise57#1;havoc property_#t~short61#1; [2025-03-04 00:30:32,843 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2025-03-04 00:30:32,843 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:30:32,860 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:30:32,860 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:30:32,861 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:30:32 BoogieIcfgContainer [2025-03-04 00:30:32,861 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:30:32,862 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:30:32,862 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:30:32,865 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:30:32,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:30:31" (1/3) ... [2025-03-04 00:30:32,866 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c4ad3ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:30:32, skipping insertion in model container [2025-03-04 00:30:32,866 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:31" (2/3) ... [2025-03-04 00:30:32,866 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c4ad3ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:30:32, skipping insertion in model container [2025-03-04 00:30:32,866 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:30:32" (3/3) ... [2025-03-04 00:30:32,867 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-19.i [2025-03-04 00:30:32,877 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:30:32,879 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-19.i that has 2 procedures, 283 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:30:32,934 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:30:32,944 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;@2c310376, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:30:32,944 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:30:32,949 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 221 states have (on average 1.5746606334841629) internal successors, (348), 222 states have internal predecessors, (348), 59 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-04 00:30:32,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2025-03-04 00:30:32,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:32,971 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:30:32,971 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:32,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:32,978 INFO L85 PathProgramCache]: Analyzing trace with hash 479322588, now seen corresponding path program 1 times [2025-03-04 00:30:32,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:32,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943844530] [2025-03-04 00:30:32,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:32,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:33,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 422 statements into 1 equivalence classes. [2025-03-04 00:30:33,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 422 of 422 statements. [2025-03-04 00:30:33,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:33,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:33,824 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-03-04 00:30:33,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:30:33,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943844530] [2025-03-04 00:30:33,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943844530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:30:33,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:30:33,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:30:33,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188480353] [2025-03-04 00:30:33,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:30:33,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:30:33,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:30:33,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:30:33,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:30:33,854 INFO L87 Difference]: Start difference. First operand has 283 states, 221 states have (on average 1.5746606334841629) internal successors, (348), 222 states have internal predecessors, (348), 59 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-03-04 00:30:33,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:30:33,987 INFO L93 Difference]: Finished difference Result 598 states and 1053 transitions. [2025-03-04 00:30:33,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:30:33,989 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 422 [2025-03-04 00:30:33,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:30:34,000 INFO L225 Difference]: With dead ends: 598 [2025-03-04 00:30:34,002 INFO L226 Difference]: Without dead ends: 318 [2025-03-04 00:30:34,006 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-04 00:30:34,008 INFO L435 NwaCegarLoop]: 451 mSDtfsCounter, 71 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:30:34,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 886 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:30:34,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-03-04 00:30:34,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 280. [2025-03-04 00:30:34,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 219 states have (on average 1.5616438356164384) internal successors, (342), 219 states have internal predecessors, (342), 59 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-04 00:30:34,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 460 transitions. [2025-03-04 00:30:34,080 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 460 transitions. Word has length 422 [2025-03-04 00:30:34,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:30:34,082 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 460 transitions. [2025-03-04 00:30:34,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-03-04 00:30:34,083 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 460 transitions. [2025-03-04 00:30:34,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2025-03-04 00:30:34,089 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:34,090 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:30:34,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 00:30:34,090 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:34,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:34,091 INFO L85 PathProgramCache]: Analyzing trace with hash 741611839, now seen corresponding path program 1 times [2025-03-04 00:30:34,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:34,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988465046] [2025-03-04 00:30:34,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:34,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:34,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 422 statements into 1 equivalence classes. [2025-03-04 00:30:34,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 422 of 422 statements. [2025-03-04 00:30:34,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:34,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:35,383 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-03-04 00:30:35,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:30:35,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988465046] [2025-03-04 00:30:35,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988465046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:30:35,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:30:35,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:30:35,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676008608] [2025-03-04 00:30:35,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:30:35,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:30:35,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:30:35,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:30:35,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:30:35,388 INFO L87 Difference]: Start difference. First operand 280 states and 460 transitions. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-03-04 00:30:35,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:30:35,669 INFO L93 Difference]: Finished difference Result 874 states and 1439 transitions. [2025-03-04 00:30:35,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:30:35,671 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 422 [2025-03-04 00:30:35,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:30:35,679 INFO L225 Difference]: With dead ends: 874 [2025-03-04 00:30:35,680 INFO L226 Difference]: Without dead ends: 597 [2025-03-04 00:30:35,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:30:35,681 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 477 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 1351 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:30:35,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 1351 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:30:35,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2025-03-04 00:30:35,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 565. [2025-03-04 00:30:35,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 493 states have (on average 1.6206896551724137) internal successors, (799), 494 states have internal predecessors, (799), 69 states have call successors, (69), 2 states have call predecessors, (69), 2 states have return successors, (69), 68 states have call predecessors, (69), 69 states have call successors, (69) [2025-03-04 00:30:35,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 937 transitions. [2025-03-04 00:30:35,732 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 937 transitions. Word has length 422 [2025-03-04 00:30:35,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:30:35,733 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 937 transitions. [2025-03-04 00:30:35,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-03-04 00:30:35,734 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 937 transitions. [2025-03-04 00:30:35,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2025-03-04 00:30:35,738 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:35,739 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:30:35,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:30:35,739 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:35,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:35,742 INFO L85 PathProgramCache]: Analyzing trace with hash -2071342426, now seen corresponding path program 1 times [2025-03-04 00:30:35,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:35,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141989071] [2025-03-04 00:30:35,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:35,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:35,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 423 statements into 1 equivalence classes. [2025-03-04 00:30:35,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 423 of 423 statements. [2025-03-04 00:30:35,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:35,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:36,086 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-03-04 00:30:36,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:30:36,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141989071] [2025-03-04 00:30:36,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141989071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:30:36,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:30:36,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:30:36,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572278665] [2025-03-04 00:30:36,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:30:36,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:30:36,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:30:36,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:30:36,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:30:36,092 INFO L87 Difference]: Start difference. First operand 565 states and 937 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-03-04 00:30:36,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:30:36,219 INFO L93 Difference]: Finished difference Result 1441 states and 2387 transitions. [2025-03-04 00:30:36,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:30:36,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 423 [2025-03-04 00:30:36,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:30:36,231 INFO L225 Difference]: With dead ends: 1441 [2025-03-04 00:30:36,232 INFO L226 Difference]: Without dead ends: 879 [2025-03-04 00:30:36,234 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-04 00:30:36,235 INFO L435 NwaCegarLoop]: 615 mSDtfsCounter, 226 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:30:36,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 1031 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:30:36,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2025-03-04 00:30:36,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 794. [2025-03-04 00:30:36,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 722 states have (on average 1.6357340720221607) internal successors, (1181), 723 states have internal predecessors, (1181), 69 states have call successors, (69), 2 states have call predecessors, (69), 2 states have return successors, (69), 68 states have call predecessors, (69), 69 states have call successors, (69) [2025-03-04 00:30:36,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1319 transitions. [2025-03-04 00:30:36,283 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1319 transitions. Word has length 423 [2025-03-04 00:30:36,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:30:36,285 INFO L471 AbstractCegarLoop]: Abstraction has 794 states and 1319 transitions. [2025-03-04 00:30:36,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-03-04 00:30:36,285 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1319 transitions. [2025-03-04 00:30:36,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2025-03-04 00:30:36,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:36,291 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:30:36,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:30:36,291 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:36,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:36,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1573924861, now seen corresponding path program 1 times [2025-03-04 00:30:36,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:36,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741262649] [2025-03-04 00:30:36,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:36,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:36,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 423 statements into 1 equivalence classes. [2025-03-04 00:30:36,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 423 of 423 statements. [2025-03-04 00:30:36,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:36,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:37,117 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-03-04 00:30:37,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:30:37,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741262649] [2025-03-04 00:30:37,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741262649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:30:37,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:30:37,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:30:37,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78826444] [2025-03-04 00:30:37,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:30:37,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:30:37,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:30:37,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:30:37,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:30:37,120 INFO L87 Difference]: Start difference. First operand 794 states and 1319 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-03-04 00:30:37,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:30:37,394 INFO L93 Difference]: Finished difference Result 2559 states and 4226 transitions. [2025-03-04 00:30:37,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:30:37,395 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 423 [2025-03-04 00:30:37,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:30:37,403 INFO L225 Difference]: With dead ends: 2559 [2025-03-04 00:30:37,403 INFO L226 Difference]: Without dead ends: 1768 [2025-03-04 00:30:37,405 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-04 00:30:37,406 INFO L435 NwaCegarLoop]: 874 mSDtfsCounter, 561 mSDsluCounter, 1024 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 1898 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:30:37,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 1898 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:30:37,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1768 states. [2025-03-04 00:30:37,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1768 to 1522. [2025-03-04 00:30:37,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1522 states, 1398 states have (on average 1.6394849785407726) internal successors, (2292), 1401 states have internal predecessors, (2292), 119 states have call successors, (119), 4 states have call predecessors, (119), 4 states have return successors, (119), 116 states have call predecessors, (119), 119 states have call successors, (119) [2025-03-04 00:30:37,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1522 states to 1522 states and 2530 transitions. [2025-03-04 00:30:37,462 INFO L78 Accepts]: Start accepts. Automaton has 1522 states and 2530 transitions. Word has length 423 [2025-03-04 00:30:37,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:30:37,463 INFO L471 AbstractCegarLoop]: Abstraction has 1522 states and 2530 transitions. [2025-03-04 00:30:37,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-03-04 00:30:37,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1522 states and 2530 transitions. [2025-03-04 00:30:37,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2025-03-04 00:30:37,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:37,468 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:30:37,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:30:37,469 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:37,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:37,469 INFO L85 PathProgramCache]: Analyzing trace with hash 207575074, now seen corresponding path program 1 times [2025-03-04 00:30:37,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:37,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406720816] [2025-03-04 00:30:37,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:37,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:37,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 423 statements into 1 equivalence classes. [2025-03-04 00:30:38,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 423 of 423 statements. [2025-03-04 00:30:38,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:38,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:39,157 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-03-04 00:30:39,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:30:39,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406720816] [2025-03-04 00:30:39,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406720816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:30:39,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:30:39,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 00:30:39,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168373127] [2025-03-04 00:30:39,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:30:39,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 00:30:39,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:30:39,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 00:30:39,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:30:39,159 INFO L87 Difference]: Start difference. First operand 1522 states and 2530 transitions. Second operand has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-03-04 00:30:40,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:30:40,351 INFO L93 Difference]: Finished difference Result 7571 states and 12321 transitions. [2025-03-04 00:30:40,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 00:30:40,352 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 423 [2025-03-04 00:30:40,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:30:40,370 INFO L225 Difference]: With dead ends: 7571 [2025-03-04 00:30:40,370 INFO L226 Difference]: Without dead ends: 6052 [2025-03-04 00:30:40,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2025-03-04 00:30:40,375 INFO L435 NwaCegarLoop]: 464 mSDtfsCounter, 1422 mSDsluCounter, 2804 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1422 SdHoareTripleChecker+Valid, 3268 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 00:30:40,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1422 Valid, 3268 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 00:30:40,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6052 states. [2025-03-04 00:30:40,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6052 to 3064. [2025-03-04 00:30:40,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3064 states, 2928 states have (on average 1.6612021857923498) internal successors, (4864), 2935 states have internal predecessors, (4864), 127 states have call successors, (127), 8 states have call predecessors, (127), 8 states have return successors, (127), 120 states have call predecessors, (127), 127 states have call successors, (127) [2025-03-04 00:30:40,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3064 states to 3064 states and 5118 transitions. [2025-03-04 00:30:40,485 INFO L78 Accepts]: Start accepts. Automaton has 3064 states and 5118 transitions. Word has length 423 [2025-03-04 00:30:40,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:30:40,486 INFO L471 AbstractCegarLoop]: Abstraction has 3064 states and 5118 transitions. [2025-03-04 00:30:40,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-03-04 00:30:40,486 INFO L276 IsEmpty]: Start isEmpty. Operand 3064 states and 5118 transitions. [2025-03-04 00:30:40,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2025-03-04 00:30:40,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:40,496 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:30:40,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 00:30:40,496 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:40,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:40,497 INFO L85 PathProgramCache]: Analyzing trace with hash -789497279, now seen corresponding path program 1 times [2025-03-04 00:30:40,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:40,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501532201] [2025-03-04 00:30:40,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:40,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:40,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 423 statements into 1 equivalence classes. [2025-03-04 00:30:41,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 423 of 423 statements. [2025-03-04 00:30:41,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:41,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:42,576 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 6 proven. 168 refuted. 0 times theorem prover too weak. 6670 trivial. 0 not checked. [2025-03-04 00:30:42,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:30:42,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501532201] [2025-03-04 00:30:42,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501532201] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:30:42,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935041955] [2025-03-04 00:30:42,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:42,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:30:42,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:30:42,582 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-04 00:30:42,584 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-04 00:30:42,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 423 statements into 1 equivalence classes. [2025-03-04 00:30:42,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 423 of 423 statements. [2025-03-04 00:30:42,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:42,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:42,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 1081 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 00:30:42,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:30:43,085 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 2074 proven. 30 refuted. 0 times theorem prover too weak. 4740 trivial. 0 not checked. [2025-03-04 00:30:43,086 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:30:43,403 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 144 proven. 30 refuted. 0 times theorem prover too weak. 6670 trivial. 0 not checked. [2025-03-04 00:30:43,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935041955] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:30:43,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:30:43,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 12 [2025-03-04 00:30:43,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646652749] [2025-03-04 00:30:43,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:30:43,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 00:30:43,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:30:43,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 00:30:43,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-04 00:30:43,407 INFO L87 Difference]: Start difference. First operand 3064 states and 5118 transitions. Second operand has 12 states, 12 states have (on average 19.583333333333332) internal successors, (235), 12 states have internal predecessors, (235), 3 states have call successors, (125), 2 states have call predecessors, (125), 4 states have return successors, (127), 3 states have call predecessors, (127), 3 states have call successors, (127) [2025-03-04 00:30:44,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:30:44,598 INFO L93 Difference]: Finished difference Result 7025 states and 11664 transitions. [2025-03-04 00:30:44,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 00:30:44,599 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 19.583333333333332) internal successors, (235), 12 states have internal predecessors, (235), 3 states have call successors, (125), 2 states have call predecessors, (125), 4 states have return successors, (127), 3 states have call predecessors, (127), 3 states have call successors, (127) Word has length 423 [2025-03-04 00:30:44,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:30:44,613 INFO L225 Difference]: With dead ends: 7025 [2025-03-04 00:30:44,613 INFO L226 Difference]: Without dead ends: 3964 [2025-03-04 00:30:44,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 875 GetRequests, 847 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=209, Invalid=603, Unknown=0, NotChecked=0, Total=812 [2025-03-04 00:30:44,619 INFO L435 NwaCegarLoop]: 398 mSDtfsCounter, 2285 mSDsluCounter, 1853 mSDsCounter, 0 mSdLazyCounter, 1242 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2286 SdHoareTripleChecker+Valid, 2251 SdHoareTripleChecker+Invalid, 1499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 1242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 00:30:44,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2286 Valid, 2251 Invalid, 1499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 1242 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 00:30:44,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3964 states. [2025-03-04 00:30:44,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3964 to 2912. [2025-03-04 00:30:44,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2912 states, 2771 states have (on average 1.6420064958498737) internal successors, (4550), 2778 states have internal predecessors, (4550), 127 states have call successors, (127), 13 states have call predecessors, (127), 13 states have return successors, (127), 120 states have call predecessors, (127), 127 states have call successors, (127) [2025-03-04 00:30:44,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2912 states to 2912 states and 4804 transitions. [2025-03-04 00:30:44,739 INFO L78 Accepts]: Start accepts. Automaton has 2912 states and 4804 transitions. Word has length 423 [2025-03-04 00:30:44,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:30:44,739 INFO L471 AbstractCegarLoop]: Abstraction has 2912 states and 4804 transitions. [2025-03-04 00:30:44,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 19.583333333333332) internal successors, (235), 12 states have internal predecessors, (235), 3 states have call successors, (125), 2 states have call predecessors, (125), 4 states have return successors, (127), 3 states have call predecessors, (127), 3 states have call successors, (127) [2025-03-04 00:30:44,740 INFO L276 IsEmpty]: Start isEmpty. Operand 2912 states and 4804 transitions. [2025-03-04 00:30:44,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2025-03-04 00:30:44,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:44,749 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:30:44,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 00:30:44,949 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,SelfDestructingSolverStorable5 [2025-03-04 00:30:44,949 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:44,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:44,950 INFO L85 PathProgramCache]: Analyzing trace with hash -655238334, now seen corresponding path program 1 times [2025-03-04 00:30:44,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:44,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133406468] [2025-03-04 00:30:44,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:44,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:44,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 423 statements into 1 equivalence classes. [2025-03-04 00:30:45,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 423 of 423 statements. [2025-03-04 00:30:45,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:45,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:45,502 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-03-04 00:30:45,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:30:45,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133406468] [2025-03-04 00:30:45,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133406468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:30:45,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:30:45,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:30:45,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744084208] [2025-03-04 00:30:45,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:30:45,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:30:45,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:30:45,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:30:45,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:30:45,504 INFO L87 Difference]: Start difference. First operand 2912 states and 4804 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-03-04 00:30:45,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:30:45,836 INFO L93 Difference]: Finished difference Result 8698 states and 14332 transitions. [2025-03-04 00:30:45,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 00:30:45,837 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 423 [2025-03-04 00:30:45,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:30:45,860 INFO L225 Difference]: With dead ends: 8698 [2025-03-04 00:30:45,860 INFO L226 Difference]: Without dead ends: 5789 [2025-03-04 00:30:45,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 00:30:45,865 INFO L435 NwaCegarLoop]: 857 mSDtfsCounter, 715 mSDsluCounter, 1445 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 2302 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:30:45,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [715 Valid, 2302 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:30:45,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5789 states. [2025-03-04 00:30:46,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5789 to 5787. [2025-03-04 00:30:46,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5787 states, 5504 states have (on average 1.6282703488372092) internal successors, (8962), 5518 states have internal predecessors, (8962), 254 states have call successors, (254), 28 states have call predecessors, (254), 28 states have return successors, (254), 240 states have call predecessors, (254), 254 states have call successors, (254) [2025-03-04 00:30:46,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5787 states to 5787 states and 9470 transitions. [2025-03-04 00:30:46,036 INFO L78 Accepts]: Start accepts. Automaton has 5787 states and 9470 transitions. Word has length 423 [2025-03-04 00:30:46,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:30:46,037 INFO L471 AbstractCegarLoop]: Abstraction has 5787 states and 9470 transitions. [2025-03-04 00:30:46,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-03-04 00:30:46,037 INFO L276 IsEmpty]: Start isEmpty. Operand 5787 states and 9470 transitions. [2025-03-04 00:30:46,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2025-03-04 00:30:46,045 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:46,046 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:30:46,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 00:30:46,046 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:46,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:46,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1562519619, now seen corresponding path program 1 times [2025-03-04 00:30:46,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:46,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298629962] [2025-03-04 00:30:46,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:46,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:46,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 423 statements into 1 equivalence classes. [2025-03-04 00:30:46,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 423 of 423 statements. [2025-03-04 00:30:46,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:46,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:46,617 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-03-04 00:30:46,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:30:46,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298629962] [2025-03-04 00:30:46,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298629962] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:30:46,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:30:46,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:30:46,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614663945] [2025-03-04 00:30:46,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:30:46,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:30:46,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:30:46,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:30:46,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:30:46,621 INFO L87 Difference]: Start difference. First operand 5787 states and 9470 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-03-04 00:30:46,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:30:46,989 INFO L93 Difference]: Finished difference Result 14476 states and 23474 transitions. [2025-03-04 00:30:46,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:30:46,990 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 423 [2025-03-04 00:30:46,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:30:47,022 INFO L225 Difference]: With dead ends: 14476 [2025-03-04 00:30:47,022 INFO L226 Difference]: Without dead ends: 8692 [2025-03-04 00:30:47,034 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-04 00:30:47,034 INFO L435 NwaCegarLoop]: 445 mSDtfsCounter, 450 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:30:47,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 1103 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:30:47,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8692 states. [2025-03-04 00:30:47,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8692 to 8681. [2025-03-04 00:30:47,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8681 states, 8311 states have (on average 1.6052219949464566) internal successors, (13341), 8342 states have internal predecessors, (13341), 308 states have call successors, (308), 61 states have call predecessors, (308), 61 states have return successors, (308), 277 states have call predecessors, (308), 308 states have call successors, (308) [2025-03-04 00:30:47,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8681 states to 8681 states and 13957 transitions. [2025-03-04 00:30:47,322 INFO L78 Accepts]: Start accepts. Automaton has 8681 states and 13957 transitions. Word has length 423 [2025-03-04 00:30:47,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:30:47,323 INFO L471 AbstractCegarLoop]: Abstraction has 8681 states and 13957 transitions. [2025-03-04 00:30:47,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-03-04 00:30:47,324 INFO L276 IsEmpty]: Start isEmpty. Operand 8681 states and 13957 transitions. [2025-03-04 00:30:47,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2025-03-04 00:30:47,333 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:47,333 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:30:47,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 00:30:47,333 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:47,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:47,334 INFO L85 PathProgramCache]: Analyzing trace with hash 565447266, now seen corresponding path program 1 times [2025-03-04 00:30:47,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:47,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410207197] [2025-03-04 00:30:47,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:47,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:47,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 423 statements into 1 equivalence classes. [2025-03-04 00:30:47,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 423 of 423 statements. [2025-03-04 00:30:47,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:47,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:48,198 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 33 proven. 141 refuted. 0 times theorem prover too weak. 6670 trivial. 0 not checked. [2025-03-04 00:30:48,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:30:48,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410207197] [2025-03-04 00:30:48,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410207197] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:30:48,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320723451] [2025-03-04 00:30:48,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:48,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:30:48,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:30:48,201 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:30:48,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 00:30:48,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 423 statements into 1 equivalence classes. [2025-03-04 00:30:48,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 423 of 423 statements. [2025-03-04 00:30:48,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:48,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:48,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 1082 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 00:30:48,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:30:48,894 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 2148 proven. 141 refuted. 0 times theorem prover too weak. 4555 trivial. 0 not checked. [2025-03-04 00:30:48,894 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:30:49,222 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 33 proven. 141 refuted. 0 times theorem prover too weak. 6670 trivial. 0 not checked. [2025-03-04 00:30:49,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320723451] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:30:49,222 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:30:49,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-04 00:30:49,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367157043] [2025-03-04 00:30:49,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:30:49,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 00:30:49,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:30:49,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 00:30:49,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:30:49,227 INFO L87 Difference]: Start difference. First operand 8681 states and 13957 transitions. Second operand has 7 states, 7 states have (on average 20.0) internal successors, (140), 7 states have internal predecessors, (140), 2 states have call successors, (106), 2 states have call predecessors, (106), 4 states have return successors, (107), 2 states have call predecessors, (107), 2 states have call successors, (107) [2025-03-04 00:30:49,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:30:49,662 INFO L93 Difference]: Finished difference Result 13745 states and 22030 transitions. [2025-03-04 00:30:49,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 00:30:49,663 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 7 states have internal predecessors, (140), 2 states have call successors, (106), 2 states have call predecessors, (106), 4 states have return successors, (107), 2 states have call predecessors, (107), 2 states have call successors, (107) Word has length 423 [2025-03-04 00:30:49,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:30:49,677 INFO L225 Difference]: With dead ends: 13745 [2025-03-04 00:30:49,678 INFO L226 Difference]: Without dead ends: 5081 [2025-03-04 00:30:49,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 853 GetRequests, 843 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:30:49,691 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 537 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 917 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:30:49,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 917 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:30:49,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5081 states. [2025-03-04 00:30:49,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5081 to 5045. [2025-03-04 00:30:49,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5045 states, 4767 states have (on average 1.590727921124397) internal successors, (7583), 4782 states have internal predecessors, (7583), 236 states have call successors, (236), 41 states have call predecessors, (236), 41 states have return successors, (236), 221 states have call predecessors, (236), 236 states have call successors, (236) [2025-03-04 00:30:49,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5045 states to 5045 states and 8055 transitions. [2025-03-04 00:30:49,895 INFO L78 Accepts]: Start accepts. Automaton has 5045 states and 8055 transitions. Word has length 423 [2025-03-04 00:30:49,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:30:49,896 INFO L471 AbstractCegarLoop]: Abstraction has 5045 states and 8055 transitions. [2025-03-04 00:30:49,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 7 states have internal predecessors, (140), 2 states have call successors, (106), 2 states have call predecessors, (106), 4 states have return successors, (107), 2 states have call predecessors, (107), 2 states have call successors, (107) [2025-03-04 00:30:49,897 INFO L276 IsEmpty]: Start isEmpty. Operand 5045 states and 8055 transitions. [2025-03-04 00:30:49,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2025-03-04 00:30:49,905 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:49,906 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:30:49,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 00:30:50,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-04 00:30:50,110 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:50,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:50,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1910094906, now seen corresponding path program 1 times [2025-03-04 00:30:50,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:50,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48329506] [2025-03-04 00:30:50,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:50,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:50,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 424 statements into 1 equivalence classes. [2025-03-04 00:30:50,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 424 of 424 statements. [2025-03-04 00:30:50,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:50,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:50,659 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-03-04 00:30:50,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:30:50,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48329506] [2025-03-04 00:30:50,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48329506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:30:50,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:30:50,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:30:50,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036279066] [2025-03-04 00:30:50,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:30:50,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:30:50,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:30:50,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:30:50,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:30:50,661 INFO L87 Difference]: Start difference. First operand 5045 states and 8055 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-03-04 00:30:50,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:30:50,955 INFO L93 Difference]: Finished difference Result 19583 states and 31300 transitions. [2025-03-04 00:30:50,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:30:50,956 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 424 [2025-03-04 00:30:50,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:30:50,982 INFO L225 Difference]: With dead ends: 19583 [2025-03-04 00:30:50,983 INFO L226 Difference]: Without dead ends: 14555 [2025-03-04 00:30:50,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:30:50,993 INFO L435 NwaCegarLoop]: 455 mSDtfsCounter, 782 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 782 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:30:50,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [782 Valid, 1112 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:30:51,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14555 states. [2025-03-04 00:30:51,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14555 to 11498. [2025-03-04 00:30:51,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11498 states, 11063 states have (on average 1.604176082436952) internal successors, (17747), 11098 states have internal predecessors, (17747), 350 states have call successors, (350), 84 states have call predecessors, (350), 84 states have return successors, (350), 315 states have call predecessors, (350), 350 states have call successors, (350) [2025-03-04 00:30:51,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11498 states to 11498 states and 18447 transitions. [2025-03-04 00:30:51,262 INFO L78 Accepts]: Start accepts. Automaton has 11498 states and 18447 transitions. Word has length 424 [2025-03-04 00:30:51,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:30:51,263 INFO L471 AbstractCegarLoop]: Abstraction has 11498 states and 18447 transitions. [2025-03-04 00:30:51,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-03-04 00:30:51,263 INFO L276 IsEmpty]: Start isEmpty. Operand 11498 states and 18447 transitions. [2025-03-04 00:30:51,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2025-03-04 00:30:51,276 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:51,276 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:30:51,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 00:30:51,276 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:51,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:51,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1080478661, now seen corresponding path program 1 times [2025-03-04 00:30:51,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:51,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044740296] [2025-03-04 00:30:51,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:51,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:51,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 424 statements into 1 equivalence classes. [2025-03-04 00:30:51,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 424 of 424 statements. [2025-03-04 00:30:51,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:51,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:51,733 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-03-04 00:30:51,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:30:51,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044740296] [2025-03-04 00:30:51,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044740296] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:30:51,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:30:51,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:30:51,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953582182] [2025-03-04 00:30:51,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:30:51,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:30:51,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:30:51,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:30:51,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:30:51,735 INFO L87 Difference]: Start difference. First operand 11498 states and 18447 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-03-04 00:30:52,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:30:52,364 INFO L93 Difference]: Finished difference Result 47490 states and 75799 transitions. [2025-03-04 00:30:52,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:30:52,365 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 424 [2025-03-04 00:30:52,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:30:52,432 INFO L225 Difference]: With dead ends: 47490 [2025-03-04 00:30:52,433 INFO L226 Difference]: Without dead ends: 36009 [2025-03-04 00:30:52,448 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-04 00:30:52,450 INFO L435 NwaCegarLoop]: 681 mSDtfsCounter, 1047 mSDsluCounter, 1422 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1047 SdHoareTripleChecker+Valid, 2103 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:30:52,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1047 Valid, 2103 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:30:52,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36009 states. [2025-03-04 00:30:53,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36009 to 21626. [2025-03-04 00:30:53,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21626 states, 20789 states have (on average 1.590985617393814) internal successors, (33075), 20854 states have internal predecessors, (33075), 676 states have call successors, (676), 160 states have call predecessors, (676), 160 states have return successors, (676), 611 states have call predecessors, (676), 676 states have call successors, (676) [2025-03-04 00:30:53,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21626 states to 21626 states and 34427 transitions. [2025-03-04 00:30:53,299 INFO L78 Accepts]: Start accepts. Automaton has 21626 states and 34427 transitions. Word has length 424 [2025-03-04 00:30:53,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:30:53,300 INFO L471 AbstractCegarLoop]: Abstraction has 21626 states and 34427 transitions. [2025-03-04 00:30:53,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-03-04 00:30:53,300 INFO L276 IsEmpty]: Start isEmpty. Operand 21626 states and 34427 transitions. [2025-03-04 00:30:53,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2025-03-04 00:30:53,320 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:53,320 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:30:53,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 00:30:53,321 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:53,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:53,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1452565147, now seen corresponding path program 1 times [2025-03-04 00:30:53,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:53,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228543070] [2025-03-04 00:30:53,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:53,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:53,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 424 statements into 1 equivalence classes. [2025-03-04 00:30:53,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 424 of 424 statements. [2025-03-04 00:30:53,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:53,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:53,745 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-03-04 00:30:53,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:30:53,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228543070] [2025-03-04 00:30:53,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228543070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:30:53,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:30:53,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:30:53,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662909376] [2025-03-04 00:30:53,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:30:53,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:30:53,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:30:53,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:30:53,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:30:53,747 INFO L87 Difference]: Start difference. First operand 21626 states and 34427 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-03-04 00:30:54,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:30:54,360 INFO L93 Difference]: Finished difference Result 49222 states and 78105 transitions. [2025-03-04 00:30:54,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:30:54,361 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 424 [2025-03-04 00:30:54,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:30:54,422 INFO L225 Difference]: With dead ends: 49222 [2025-03-04 00:30:54,423 INFO L226 Difference]: Without dead ends: 27613 [2025-03-04 00:30:54,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:30:54,450 INFO L435 NwaCegarLoop]: 522 mSDtfsCounter, 213 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 1450 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:30:54,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 1450 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:30:54,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27613 states. [2025-03-04 00:30:55,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27613 to 24858. [2025-03-04 00:30:55,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24858 states, 24021 states have (on average 1.5960617792764664) internal successors, (38339), 24086 states have internal predecessors, (38339), 676 states have call successors, (676), 160 states have call predecessors, (676), 160 states have return successors, (676), 611 states have call predecessors, (676), 676 states have call successors, (676) [2025-03-04 00:30:55,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24858 states to 24858 states and 39691 transitions. [2025-03-04 00:30:55,122 INFO L78 Accepts]: Start accepts. Automaton has 24858 states and 39691 transitions. Word has length 424 [2025-03-04 00:30:55,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:30:55,122 INFO L471 AbstractCegarLoop]: Abstraction has 24858 states and 39691 transitions. [2025-03-04 00:30:55,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-03-04 00:30:55,123 INFO L276 IsEmpty]: Start isEmpty. Operand 24858 states and 39691 transitions. [2025-03-04 00:30:55,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2025-03-04 00:30:55,153 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:55,153 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:30:55,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 00:30:55,154 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:55,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:55,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1426419579, now seen corresponding path program 1 times [2025-03-04 00:30:55,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:55,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876923051] [2025-03-04 00:30:55,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:55,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:55,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 424 statements into 1 equivalence classes. [2025-03-04 00:30:56,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 424 of 424 statements. [2025-03-04 00:30:56,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:56,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 00:30:56,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [231417789] [2025-03-04 00:30:56,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:56,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:30:56,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:30:56,533 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:30:56,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 00:30:56,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 424 statements into 1 equivalence classes. [2025-03-04 00:30:56,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 424 of 424 statements. [2025-03-04 00:30:56,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:56,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:56,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 1087 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 00:30:56,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:30:57,676 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-03-04 00:30:57,677 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:30:57,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:30:57,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876923051] [2025-03-04 00:30:57,677 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 00:30:57,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231417789] [2025-03-04 00:30:57,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231417789] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:30:57,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:30:57,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:30:57,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219481488] [2025-03-04 00:30:57,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:30:57,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 00:30:57,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:30:57,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 00:30:57,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:30:57,679 INFO L87 Difference]: Start difference. First operand 24858 states and 39691 transitions. Second operand has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 6 states have internal predecessors, (132), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-03-04 00:30:58,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:30:58,955 INFO L93 Difference]: Finished difference Result 62057 states and 99301 transitions. [2025-03-04 00:30:58,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 00:30:58,956 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 6 states have internal predecessors, (132), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 424 [2025-03-04 00:30:58,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:30:59,019 INFO L225 Difference]: With dead ends: 62057 [2025-03-04 00:30:59,020 INFO L226 Difference]: Without dead ends: 37216 [2025-03-04 00:30:59,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 418 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2025-03-04 00:30:59,049 INFO L435 NwaCegarLoop]: 710 mSDtfsCounter, 994 mSDsluCounter, 1064 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 994 SdHoareTripleChecker+Valid, 1774 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 00:30:59,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [994 Valid, 1774 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 00:30:59,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37216 states. [2025-03-04 00:30:59,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37216 to 27399. [2025-03-04 00:30:59,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27399 states, 26528 states have (on average 1.6041917973462003) internal successors, (42556), 26588 states have internal predecessors, (42556), 711 states have call successors, (711), 159 states have call predecessors, (711), 159 states have return successors, (711), 651 states have call predecessors, (711), 711 states have call successors, (711) [2025-03-04 00:30:59,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27399 states to 27399 states and 43978 transitions. [2025-03-04 00:30:59,926 INFO L78 Accepts]: Start accepts. Automaton has 27399 states and 43978 transitions. Word has length 424 [2025-03-04 00:30:59,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:30:59,927 INFO L471 AbstractCegarLoop]: Abstraction has 27399 states and 43978 transitions. [2025-03-04 00:30:59,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 6 states have internal predecessors, (132), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-03-04 00:30:59,927 INFO L276 IsEmpty]: Start isEmpty. Operand 27399 states and 43978 transitions. [2025-03-04 00:30:59,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2025-03-04 00:30:59,947 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:59,947 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:30:59,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 00:31:00,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:31:00,151 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:00,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:00,152 INFO L85 PathProgramCache]: Analyzing trace with hash 429347226, now seen corresponding path program 1 times [2025-03-04 00:31:00,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:00,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64582719] [2025-03-04 00:31:00,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:00,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:00,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 424 statements into 1 equivalence classes. [2025-03-04 00:31:01,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 424 of 424 statements. [2025-03-04 00:31:01,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:01,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:04,509 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 192 proven. 468 refuted. 0 times theorem prover too weak. 6184 trivial. 0 not checked. [2025-03-04 00:31:04,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:04,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64582719] [2025-03-04 00:31:04,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64582719] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:31:04,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735854045] [2025-03-04 00:31:04,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:04,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:31:04,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:31:04,516 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:31:04,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 00:31:04,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 424 statements into 1 equivalence classes. [2025-03-04 00:31:04,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 424 of 424 statements. [2025-03-04 00:31:04,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:04,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:04,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 1087 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 00:31:04,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:31:08,627 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 3231 proven. 624 refuted. 0 times theorem prover too weak. 2989 trivial. 0 not checked. [2025-03-04 00:31:08,627 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:31:13,917 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 6 proven. 168 refuted. 0 times theorem prover too weak. 6670 trivial. 0 not checked. [2025-03-04 00:31:13,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735854045] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:31:13,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:31:13,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19, 11] total 37 [2025-03-04 00:31:13,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66031451] [2025-03-04 00:31:13,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:31:13,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-04 00:31:13,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:13,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-04 00:31:13,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=1119, Unknown=0, NotChecked=0, Total=1332 [2025-03-04 00:31:13,921 INFO L87 Difference]: Start difference. First operand 27399 states and 43978 transitions. Second operand has 37 states, 37 states have (on average 10.135135135135135) internal successors, (375), 37 states have internal predecessors, (375), 12 states have call successors, (171), 6 states have call predecessors, (171), 10 states have return successors, (172), 12 states have call predecessors, (172), 12 states have call successors, (172) [2025-03-04 00:31:32,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:32,990 INFO L93 Difference]: Finished difference Result 103583 states and 165283 transitions. [2025-03-04 00:31:32,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2025-03-04 00:31:32,990 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 10.135135135135135) internal successors, (375), 37 states have internal predecessors, (375), 12 states have call successors, (171), 6 states have call predecessors, (171), 10 states have return successors, (172), 12 states have call predecessors, (172), 12 states have call successors, (172) Word has length 424 [2025-03-04 00:31:32,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:33,101 INFO L225 Difference]: With dead ends: 103583 [2025-03-04 00:31:33,102 INFO L226 Difference]: Without dead ends: 76493 [2025-03-04 00:31:33,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1000 GetRequests, 858 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6252 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=3322, Invalid=17270, Unknown=0, NotChecked=0, Total=20592 [2025-03-04 00:31:33,143 INFO L435 NwaCegarLoop]: 629 mSDtfsCounter, 5753 mSDsluCounter, 6637 mSDsCounter, 0 mSdLazyCounter, 6070 mSolverCounterSat, 892 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5755 SdHoareTripleChecker+Valid, 7266 SdHoareTripleChecker+Invalid, 6962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 892 IncrementalHoareTripleChecker+Valid, 6070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:33,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5755 Valid, 7266 Invalid, 6962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [892 Valid, 6070 Invalid, 0 Unknown, 0 Unchecked, 8.2s Time] [2025-03-04 00:31:33,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76493 states. [2025-03-04 00:31:34,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76493 to 26071. [2025-03-04 00:31:34,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26071 states, 25077 states have (on average 1.6147465805319616) internal successors, (40493), 25105 states have internal predecessors, (40493), 727 states have call successors, (727), 266 states have call predecessors, (727), 266 states have return successors, (727), 699 states have call predecessors, (727), 727 states have call successors, (727) [2025-03-04 00:31:34,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26071 states to 26071 states and 41947 transitions. [2025-03-04 00:31:34,608 INFO L78 Accepts]: Start accepts. Automaton has 26071 states and 41947 transitions. Word has length 424 [2025-03-04 00:31:34,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:34,609 INFO L471 AbstractCegarLoop]: Abstraction has 26071 states and 41947 transitions. [2025-03-04 00:31:34,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 10.135135135135135) internal successors, (375), 37 states have internal predecessors, (375), 12 states have call successors, (171), 6 states have call predecessors, (171), 10 states have return successors, (172), 12 states have call predecessors, (172), 12 states have call successors, (172) [2025-03-04 00:31:34,609 INFO L276 IsEmpty]: Start isEmpty. Operand 26071 states and 41947 transitions. [2025-03-04 00:31:34,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2025-03-04 00:31:34,621 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:34,622 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:31:34,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 00:31:34,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:31:34,823 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:34,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:34,824 INFO L85 PathProgramCache]: Analyzing trace with hash -81186951, now seen corresponding path program 1 times [2025-03-04 00:31:34,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:34,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478119101] [2025-03-04 00:31:34,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:34,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:34,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 424 statements into 1 equivalence classes. [2025-03-04 00:31:36,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 424 of 424 statements. [2025-03-04 00:31:36,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:36,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 00:31:36,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [91410303] [2025-03-04 00:31:36,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:36,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:31:36,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:31:36,234 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:31:36,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 00:31:36,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 424 statements into 1 equivalence classes. [2025-03-04 00:31:36,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 424 of 424 statements. [2025-03-04 00:31:36,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:36,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:36,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 1087 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 00:31:36,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:31:38,048 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 1563 proven. 687 refuted. 0 times theorem prover too weak. 4594 trivial. 0 not checked. [2025-03-04 00:31:38,048 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:31:38,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:38,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478119101] [2025-03-04 00:31:38,515 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 00:31:38,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91410303] [2025-03-04 00:31:38,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [91410303] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:31:38,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:31:38,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2025-03-04 00:31:38,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302517857] [2025-03-04 00:31:38,515 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 00:31:38,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 00:31:38,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:38,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 00:31:38,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2025-03-04 00:31:38,517 INFO L87 Difference]: Start difference. First operand 26071 states and 41947 transitions. Second operand has 17 states, 17 states have (on average 9.0) internal successors, (153), 15 states have internal predecessors, (153), 5 states have call successors, (59), 5 states have call predecessors, (59), 8 states have return successors, (59), 5 states have call predecessors, (59), 5 states have call successors, (59) [2025-03-04 00:31:39,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:39,940 INFO L93 Difference]: Finished difference Result 52211 states and 83881 transitions. [2025-03-04 00:31:39,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 00:31:39,941 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 9.0) internal successors, (153), 15 states have internal predecessors, (153), 5 states have call successors, (59), 5 states have call predecessors, (59), 8 states have return successors, (59), 5 states have call predecessors, (59), 5 states have call successors, (59) Word has length 424 [2025-03-04 00:31:39,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:39,983 INFO L225 Difference]: With dead ends: 52211 [2025-03-04 00:31:39,983 INFO L226 Difference]: Without dead ends: 26335 [2025-03-04 00:31:40,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 798 GetRequests, 773 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=204, Invalid=498, Unknown=0, NotChecked=0, Total=702 [2025-03-04 00:31:40,005 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 595 mSDsluCounter, 1328 mSDsCounter, 0 mSdLazyCounter, 1043 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 1639 SdHoareTripleChecker+Invalid, 1059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:40,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [631 Valid, 1639 Invalid, 1059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1043 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 00:31:40,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26335 states. [2025-03-04 00:31:41,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26335 to 26107. [2025-03-04 00:31:41,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26107 states, 25104 states have (on average 1.6132887189292544) internal successors, (40500), 25132 states have internal predecessors, (40500), 727 states have call successors, (727), 275 states have call predecessors, (727), 275 states have return successors, (727), 699 states have call predecessors, (727), 727 states have call successors, (727) [2025-03-04 00:31:41,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26107 states to 26107 states and 41954 transitions. [2025-03-04 00:31:41,208 INFO L78 Accepts]: Start accepts. Automaton has 26107 states and 41954 transitions. Word has length 424 [2025-03-04 00:31:41,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:41,208 INFO L471 AbstractCegarLoop]: Abstraction has 26107 states and 41954 transitions. [2025-03-04 00:31:41,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 9.0) internal successors, (153), 15 states have internal predecessors, (153), 5 states have call successors, (59), 5 states have call predecessors, (59), 8 states have return successors, (59), 5 states have call predecessors, (59), 5 states have call successors, (59) [2025-03-04 00:31:41,209 INFO L276 IsEmpty]: Start isEmpty. Operand 26107 states and 41954 transitions. [2025-03-04 00:31:41,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2025-03-04 00:31:41,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:41,221 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:31:41,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 00:31:41,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 00:31:41,422 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:41,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:41,423 INFO L85 PathProgramCache]: Analyzing trace with hash 785865274, now seen corresponding path program 1 times [2025-03-04 00:31:41,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:41,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480728839] [2025-03-04 00:31:41,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:41,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:41,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 424 statements into 1 equivalence classes.