./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-55.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_amount250_file-55.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 5208e97c947824349dcc8cb32160d4052cba683a795fae400d45ff0b27a23a25 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:12:53,011 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:12:53,066 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:12:53,069 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:12:53,069 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:12:53,088 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:12:53,089 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:12:53,089 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:12:53,089 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:12:53,090 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:12:53,090 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:12:53,090 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:12:53,091 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:12:53,091 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:12:53,091 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:12:53,091 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:12:53,091 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:12:53,091 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:12:53,091 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:12:53,091 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:12:53,091 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:12:53,091 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:12:53,091 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:12:53,091 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:12:53,091 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:12:53,091 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:12:53,091 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:12:53,091 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:12:53,091 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:12:53,091 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:12:53,092 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:12:53,092 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:12:53,092 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:12:53,092 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:12:53,092 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:12:53,092 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:12:53,092 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:12:53,092 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:12:53,092 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:12:53,092 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:12:53,092 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:12:53,092 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:12:53,092 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:12:53,092 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 -> 5208e97c947824349dcc8cb32160d4052cba683a795fae400d45ff0b27a23a25 [2025-03-04 00:12:53,310 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:12:53,318 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:12:53,320 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:12:53,321 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:12:53,321 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:12:53,322 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-55.i [2025-03-04 00:12:54,465 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bd95b53e/abb7a7e72be9445e9c3aecb1dfec70ae/FLAG0cf01b397 [2025-03-04 00:12:54,742 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:12:54,742 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-55.i [2025-03-04 00:12:54,755 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bd95b53e/abb7a7e72be9445e9c3aecb1dfec70ae/FLAG0cf01b397 [2025-03-04 00:12:55,024 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bd95b53e/abb7a7e72be9445e9c3aecb1dfec70ae [2025-03-04 00:12:55,026 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:12:55,027 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:12:55,028 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:12:55,028 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:12:55,031 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:12:55,031 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:12:55" (1/1) ... [2025-03-04 00:12:55,032 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a4ae29e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:12:55, skipping insertion in model container [2025-03-04 00:12:55,032 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:12:55" (1/1) ... [2025-03-04 00:12:55,057 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:12:55,143 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_amount250_file-55.i[916,929] [2025-03-04 00:12:55,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:12:55,248 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:12:55,255 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_amount250_file-55.i[916,929] [2025-03-04 00:12:55,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:12:55,311 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:12:55,311 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:12:55 WrapperNode [2025-03-04 00:12:55,312 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:12:55,313 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:12:55,313 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:12:55,313 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:12:55,317 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:12:55" (1/1) ... [2025-03-04 00:12:55,333 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:12:55" (1/1) ... [2025-03-04 00:12:55,372 INFO L138 Inliner]: procedures = 26, calls = 74, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 484 [2025-03-04 00:12:55,372 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:12:55,373 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:12:55,373 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:12:55,373 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:12:55,379 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:12:55" (1/1) ... [2025-03-04 00:12:55,379 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:12:55" (1/1) ... [2025-03-04 00:12:55,390 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:12:55" (1/1) ... [2025-03-04 00:12:55,420 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:12:55,421 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:12:55" (1/1) ... [2025-03-04 00:12:55,421 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:12:55" (1/1) ... [2025-03-04 00:12:55,442 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:12:55" (1/1) ... [2025-03-04 00:12:55,444 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:12:55" (1/1) ... [2025-03-04 00:12:55,449 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:12:55" (1/1) ... [2025-03-04 00:12:55,456 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:12:55" (1/1) ... [2025-03-04 00:12:55,465 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:12:55,466 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:12:55,467 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:12:55,467 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:12:55,468 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:12:55" (1/1) ... [2025-03-04 00:12:55,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:12:55,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:12:55,496 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:12:55,499 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:12:55,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:12:55,514 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:12:55,514 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:12:55,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:12:55,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:12:55,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:12:55,601 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:12:55,603 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:12:56,188 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L413: havoc property_#t~bitwise43#1;havoc property_#t~short44#1;havoc property_#t~ite48#1;havoc property_#t~ite47#1;havoc property_#t~bitwise45#1;havoc property_#t~bitwise46#1;havoc property_#t~short49#1; [2025-03-04 00:12:56,248 INFO L? ?]: Removed 38 outVars from TransFormulas that were not future-live. [2025-03-04 00:12:56,248 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:12:56,269 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:12:56,269 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:12:56,270 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:12:56 BoogieIcfgContainer [2025-03-04 00:12:56,270 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:12:56,271 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:12:56,271 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:12:56,274 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:12:56,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:12:55" (1/3) ... [2025-03-04 00:12:56,275 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29c671c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:12:56, skipping insertion in model container [2025-03-04 00:12:56,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:12:55" (2/3) ... [2025-03-04 00:12:56,275 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29c671c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:12:56, skipping insertion in model container [2025-03-04 00:12:56,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:12:56" (3/3) ... [2025-03-04 00:12:56,276 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-55.i [2025-03-04 00:12:56,285 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:12:56,287 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-55.i that has 2 procedures, 195 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:12:56,330 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:12:56,337 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;@125b098e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:12:56,337 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:12:56,340 INFO L276 IsEmpty]: Start isEmpty. Operand has 195 states, 131 states have (on average 1.465648854961832) internal successors, (192), 132 states have internal predecessors, (192), 61 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) [2025-03-04 00:12:56,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2025-03-04 00:12:56,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:12:56,353 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:56,354 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:12:56,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:12:56,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1658804254, now seen corresponding path program 1 times [2025-03-04 00:12:56,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:12:56,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304125165] [2025-03-04 00:12:56,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:56,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:12:56,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 388 statements into 1 equivalence classes. [2025-03-04 00:12:56,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 388 of 388 statements. [2025-03-04 00:12:56,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:56,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:56,820 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 7200 trivial. 0 not checked. [2025-03-04 00:12:56,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:12:56,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304125165] [2025-03-04 00:12:56,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304125165] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:12:56,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868814807] [2025-03-04 00:12:56,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:56,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:12:56,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:12:56,824 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:12:56,826 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:12:56,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 388 statements into 1 equivalence classes. [2025-03-04 00:12:57,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 388 of 388 statements. [2025-03-04 00:12:57,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:57,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:57,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 917 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:12:57,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:12:57,112 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 7200 trivial. 0 not checked. [2025-03-04 00:12:57,112 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:12:57,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868814807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:12:57,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:12:57,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:12:57,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508705351] [2025-03-04 00:12:57,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:12:57,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:12:57,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:12:57,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:12:57,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:12:57,134 INFO L87 Difference]: Start difference. First operand has 195 states, 131 states have (on average 1.465648854961832) internal successors, (192), 132 states have internal predecessors, (192), 61 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) Second operand has 2 states, 2 states have (on average 44.0) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (61), 2 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 2 states have call successors, (61) [2025-03-04 00:12:57,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:12:57,184 INFO L93 Difference]: Finished difference Result 383 states and 682 transitions. [2025-03-04 00:12:57,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:12:57,185 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 44.0) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (61), 2 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 2 states have call successors, (61) Word has length 388 [2025-03-04 00:12:57,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:12:57,192 INFO L225 Difference]: With dead ends: 383 [2025-03-04 00:12:57,192 INFO L226 Difference]: Without dead ends: 191 [2025-03-04 00:12:57,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 389 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:12:57,197 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:12:57,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 299 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:12:57,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-03-04 00:12:57,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2025-03-04 00:12:57,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 128 states have (on average 1.4296875) internal successors, (183), 128 states have internal predecessors, (183), 61 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) [2025-03-04 00:12:57,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 305 transitions. [2025-03-04 00:12:57,248 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 305 transitions. Word has length 388 [2025-03-04 00:12:57,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:12:57,249 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 305 transitions. [2025-03-04 00:12:57,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 44.0) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (61), 2 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 2 states have call successors, (61) [2025-03-04 00:12:57,249 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 305 transitions. [2025-03-04 00:12:57,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2025-03-04 00:12:57,257 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:12:57,257 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:57,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 00:12:57,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 00:12:57,458 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:12:57,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:12:57,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1759079806, now seen corresponding path program 1 times [2025-03-04 00:12:57,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:12:57,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376830702] [2025-03-04 00:12:57,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:57,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:12:57,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 388 statements into 1 equivalence classes. [2025-03-04 00:12:57,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 388 of 388 statements. [2025-03-04 00:12:57,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:57,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:57,832 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-03-04 00:12:57,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:12:57,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376830702] [2025-03-04 00:12:57,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376830702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:12:57,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:12:57,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:12:57,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732376143] [2025-03-04 00:12:57,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:12:57,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:12:57,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:12:57,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:12:57,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:12:57,838 INFO L87 Difference]: Start difference. First operand 191 states and 305 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-04 00:12:57,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:12:57,994 INFO L93 Difference]: Finished difference Result 559 states and 894 transitions. [2025-03-04 00:12:57,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:12:57,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 388 [2025-03-04 00:12:57,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:12:58,002 INFO L225 Difference]: With dead ends: 559 [2025-03-04 00:12:58,003 INFO L226 Difference]: Without dead ends: 371 [2025-03-04 00:12:58,004 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:12:58,005 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 271 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:12:58,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 766 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:12:58,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2025-03-04 00:12:58,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 224. [2025-03-04 00:12:58,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 161 states have (on average 1.4161490683229814) internal successors, (228), 161 states have internal predecessors, (228), 61 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) [2025-03-04 00:12:58,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 350 transitions. [2025-03-04 00:12:58,041 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 350 transitions. Word has length 388 [2025-03-04 00:12:58,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:12:58,042 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 350 transitions. [2025-03-04 00:12:58,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-04 00:12:58,043 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 350 transitions. [2025-03-04 00:12:58,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2025-03-04 00:12:58,047 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:12:58,047 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:58,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:12:58,048 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:12:58,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:12:58,048 INFO L85 PathProgramCache]: Analyzing trace with hash 560606116, now seen corresponding path program 1 times [2025-03-04 00:12:58,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:12:58,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645951301] [2025-03-04 00:12:58,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:58,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:12:58,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 388 statements into 1 equivalence classes. [2025-03-04 00:12:58,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 388 of 388 statements. [2025-03-04 00:12:58,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:58,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:58,647 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-03-04 00:12:58,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:12:58,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645951301] [2025-03-04 00:12:58,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645951301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:12:58,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:12:58,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:12:58,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072137078] [2025-03-04 00:12:58,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:12:58,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:12:58,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:12:58,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:12:58,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:12:58,648 INFO L87 Difference]: Start difference. First operand 224 states and 350 transitions. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 2 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 2 states have call predecessors, (61), 2 states have call successors, (61) [2025-03-04 00:12:59,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:12:59,006 INFO L93 Difference]: Finished difference Result 756 states and 1178 transitions. [2025-03-04 00:12:59,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:12:59,006 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 2 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 2 states have call predecessors, (61), 2 states have call successors, (61) Word has length 388 [2025-03-04 00:12:59,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:12:59,011 INFO L225 Difference]: With dead ends: 756 [2025-03-04 00:12:59,012 INFO L226 Difference]: Without dead ends: 535 [2025-03-04 00:12:59,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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:12:59,014 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 345 mSDsluCounter, 1220 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 1597 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:12:59,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 1597 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:12:59,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-03-04 00:12:59,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 443. [2025-03-04 00:12:59,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 318 states have (on average 1.4182389937106918) internal successors, (451), 318 states have internal predecessors, (451), 122 states have call successors, (122), 2 states have call predecessors, (122), 2 states have return successors, (122), 122 states have call predecessors, (122), 122 states have call successors, (122) [2025-03-04 00:12:59,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 695 transitions. [2025-03-04 00:12:59,068 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 695 transitions. Word has length 388 [2025-03-04 00:12:59,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:12:59,069 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 695 transitions. [2025-03-04 00:12:59,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 2 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 2 states have call predecessors, (61), 2 states have call successors, (61) [2025-03-04 00:12:59,069 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 695 transitions. [2025-03-04 00:12:59,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2025-03-04 00:12:59,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:12:59,073 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:59,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:12:59,073 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:12:59,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:12:59,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1414751670, now seen corresponding path program 1 times [2025-03-04 00:12:59,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:12:59,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438083379] [2025-03-04 00:12:59,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:59,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:12:59,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 389 statements into 1 equivalence classes. [2025-03-04 00:12:59,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 389 of 389 statements. [2025-03-04 00:12:59,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:59,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:13:00,141 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 171 proven. 9 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-03-04 00:13:00,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:13:00,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438083379] [2025-03-04 00:13:00,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438083379] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:13:00,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656937032] [2025-03-04 00:13:00,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:00,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:13:00,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:13:00,144 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:13:00,146 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:13:00,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 389 statements into 1 equivalence classes. [2025-03-04 00:13:00,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 389 of 389 statements. [2025-03-04 00:13:00,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:00,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:13:00,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 914 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 00:13:00,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:13:00,541 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 858 proven. 9 refuted. 0 times theorem prover too weak. 6453 trivial. 0 not checked. [2025-03-04 00:13:00,542 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:13:00,861 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 171 proven. 9 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-03-04 00:13:00,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656937032] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:13:00,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:13:00,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-04 00:13:00,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141706988] [2025-03-04 00:13:00,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:13:00,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 00:13:00,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:13:00,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 00:13:00,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:13:00,865 INFO L87 Difference]: Start difference. First operand 443 states and 695 transitions. Second operand has 10 states, 10 states have (on average 10.0) internal successors, (100), 10 states have internal predecessors, (100), 2 states have call successors, (64), 2 states have call predecessors, (64), 4 states have return successors, (65), 2 states have call predecessors, (65), 2 states have call successors, (65) [2025-03-04 00:13:01,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:13:01,699 INFO L93 Difference]: Finished difference Result 952 states and 1480 transitions. [2025-03-04 00:13:01,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 00:13:01,700 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 10 states have internal predecessors, (100), 2 states have call successors, (64), 2 states have call predecessors, (64), 4 states have return successors, (65), 2 states have call predecessors, (65), 2 states have call successors, (65) Word has length 389 [2025-03-04 00:13:01,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:13:01,704 INFO L225 Difference]: With dead ends: 952 [2025-03-04 00:13:01,706 INFO L226 Difference]: Without dead ends: 512 [2025-03-04 00:13:01,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 791 GetRequests, 774 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2025-03-04 00:13:01,708 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 703 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 363 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 764 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 1211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 363 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 00:13:01,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [764 Valid, 983 Invalid, 1211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [363 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 00:13:01,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2025-03-04 00:13:01,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 485. [2025-03-04 00:13:01,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 295 states have (on average 1.2813559322033898) internal successors, (378), 296 states have internal predecessors, (378), 183 states have call successors, (183), 6 states have call predecessors, (183), 6 states have return successors, (183), 182 states have call predecessors, (183), 183 states have call successors, (183) [2025-03-04 00:13:01,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 744 transitions. [2025-03-04 00:13:01,772 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 744 transitions. Word has length 389 [2025-03-04 00:13:01,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:13:01,773 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 744 transitions. [2025-03-04 00:13:01,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 10 states have internal predecessors, (100), 2 states have call successors, (64), 2 states have call predecessors, (64), 4 states have return successors, (65), 2 states have call predecessors, (65), 2 states have call successors, (65) [2025-03-04 00:13:01,773 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 744 transitions. [2025-03-04 00:13:01,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2025-03-04 00:13:01,776 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:13:01,776 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:01,784 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:13:01,977 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,SelfDestructingSolverStorable3 [2025-03-04 00:13:01,977 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:13:01,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:13:01,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1357604680, now seen corresponding path program 1 times [2025-03-04 00:13:01,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:13:01,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891645972] [2025-03-04 00:13:01,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:01,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:13:02,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 390 statements into 1 equivalence classes. [2025-03-04 00:13:02,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 390 of 390 statements. [2025-03-04 00:13:02,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:02,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:13:05,056 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 84 proven. 438 refuted. 0 times theorem prover too weak. 6798 trivial. 0 not checked. [2025-03-04 00:13:05,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:13:05,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891645972] [2025-03-04 00:13:05,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891645972] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:13:05,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102414962] [2025-03-04 00:13:05,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:05,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:13:05,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:13:05,059 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:13:05,061 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:13:05,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 390 statements into 1 equivalence classes. [2025-03-04 00:13:05,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 390 of 390 statements. [2025-03-04 00:13:05,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:05,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:13:05,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 919 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 00:13:05,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:13:08,577 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 2079 proven. 576 refuted. 0 times theorem prover too weak. 4665 trivial. 0 not checked. [2025-03-04 00:13:08,580 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:13:11,120 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 84 proven. 447 refuted. 0 times theorem prover too weak. 6789 trivial. 0 not checked. [2025-03-04 00:13:11,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102414962] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:13:11,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:13:11,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19, 18] total 46 [2025-03-04 00:13:11,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742466718] [2025-03-04 00:13:11,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:13:11,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-04 00:13:11,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:13:11,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-04 00:13:11,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=1723, Unknown=0, NotChecked=0, Total=2070 [2025-03-04 00:13:11,128 INFO L87 Difference]: Start difference. First operand 485 states and 744 transitions. Second operand has 46 states, 43 states have (on average 6.255813953488372) internal successors, (269), 41 states have internal predecessors, (269), 15 states have call successors, (183), 6 states have call predecessors, (183), 11 states have return successors, (183), 15 states have call predecessors, (183), 15 states have call successors, (183) [2025-03-04 00:13:16,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:13:16,465 INFO L93 Difference]: Finished difference Result 2221 states and 3271 transitions. [2025-03-04 00:13:16,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2025-03-04 00:13:16,466 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 43 states have (on average 6.255813953488372) internal successors, (269), 41 states have internal predecessors, (269), 15 states have call successors, (183), 6 states have call predecessors, (183), 11 states have return successors, (183), 15 states have call predecessors, (183), 15 states have call successors, (183) Word has length 390 [2025-03-04 00:13:16,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:13:16,476 INFO L225 Difference]: With dead ends: 2221 [2025-03-04 00:13:16,476 INFO L226 Difference]: Without dead ends: 1845 [2025-03-04 00:13:16,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 879 GetRequests, 757 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5119 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2281, Invalid=12971, Unknown=0, NotChecked=0, Total=15252 [2025-03-04 00:13:16,481 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 4009 mSDsluCounter, 3724 mSDsCounter, 0 mSdLazyCounter, 4292 mSolverCounterSat, 864 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4040 SdHoareTripleChecker+Valid, 3929 SdHoareTripleChecker+Invalid, 5156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 864 IncrementalHoareTripleChecker+Valid, 4292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:13:16,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4040 Valid, 3929 Invalid, 5156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [864 Valid, 4292 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-04 00:13:16,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1845 states. [2025-03-04 00:13:16,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1845 to 774. [2025-03-04 00:13:16,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774 states, 555 states have (on average 1.3423423423423424) internal successors, (745), 557 states have internal predecessors, (745), 205 states have call successors, (205), 13 states have call predecessors, (205), 13 states have return successors, (205), 203 states have call predecessors, (205), 205 states have call successors, (205) [2025-03-04 00:13:16,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1155 transitions. [2025-03-04 00:13:16,582 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1155 transitions. Word has length 390 [2025-03-04 00:13:16,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:13:16,582 INFO L471 AbstractCegarLoop]: Abstraction has 774 states and 1155 transitions. [2025-03-04 00:13:16,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 43 states have (on average 6.255813953488372) internal successors, (269), 41 states have internal predecessors, (269), 15 states have call successors, (183), 6 states have call predecessors, (183), 11 states have return successors, (183), 15 states have call predecessors, (183), 15 states have call successors, (183) [2025-03-04 00:13:16,583 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1155 transitions. [2025-03-04 00:13:16,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2025-03-04 00:13:16,585 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:13:16,585 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:16,593 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:13:16,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:13:16,786 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:13:16,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:13:16,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1726524154, now seen corresponding path program 1 times [2025-03-04 00:13:16,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:13:16,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575432292] [2025-03-04 00:13:16,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:16,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:13:16,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 391 statements into 1 equivalence classes. [2025-03-04 00:13:17,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 391 of 391 statements. [2025-03-04 00:13:17,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:17,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 00:13:17,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [272043751] [2025-03-04 00:13:17,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:17,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:13:17,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:13:17,170 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:13:17,172 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:13:17,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 391 statements into 1 equivalence classes. [2025-03-04 00:13:17,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 391 of 391 statements. [2025-03-04 00:13:17,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:17,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:13:17,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 920 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 00:13:17,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:13:18,386 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 3458 proven. 123 refuted. 0 times theorem prover too weak. 3739 trivial. 0 not checked. [2025-03-04 00:13:18,387 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:13:18,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:13:18,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575432292] [2025-03-04 00:13:18,624 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 00:13:18,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272043751] [2025-03-04 00:13:18,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272043751] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:13:18,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:13:18,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2025-03-04 00:13:18,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206535739] [2025-03-04 00:13:18,624 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 00:13:18,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 00:13:18,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:13:18,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 00:13:18,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:13:18,626 INFO L87 Difference]: Start difference. First operand 774 states and 1155 transitions. Second operand has 8 states, 8 states have (on average 12.25) internal successors, (98), 8 states have internal predecessors, (98), 3 states have call successors, (61), 3 states have call predecessors, (61), 4 states have return successors, (61), 3 states have call predecessors, (61), 3 states have call successors, (61) [2025-03-04 00:13:19,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:13:19,518 INFO L93 Difference]: Finished difference Result 1622 states and 2364 transitions. [2025-03-04 00:13:19,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 00:13:19,519 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.25) internal successors, (98), 8 states have internal predecessors, (98), 3 states have call successors, (61), 3 states have call predecessors, (61), 4 states have return successors, (61), 3 states have call predecessors, (61), 3 states have call successors, (61) Word has length 391 [2025-03-04 00:13:19,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:13:19,525 INFO L225 Difference]: With dead ends: 1622 [2025-03-04 00:13:19,525 INFO L226 Difference]: Without dead ends: 1358 [2025-03-04 00:13:19,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 430 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2025-03-04 00:13:19,527 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 617 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 00:13:19,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 876 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 00:13:19,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2025-03-04 00:13:19,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 1208. [2025-03-04 00:13:19,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1208 states, 973 states have (on average 1.3741007194244603) internal successors, (1337), 979 states have internal predecessors, (1337), 213 states have call successors, (213), 21 states have call predecessors, (213), 21 states have return successors, (213), 207 states have call predecessors, (213), 213 states have call successors, (213) [2025-03-04 00:13:19,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1208 states and 1763 transitions. [2025-03-04 00:13:19,624 INFO L78 Accepts]: Start accepts. Automaton has 1208 states and 1763 transitions. Word has length 391 [2025-03-04 00:13:19,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:13:19,625 INFO L471 AbstractCegarLoop]: Abstraction has 1208 states and 1763 transitions. [2025-03-04 00:13:19,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.25) internal successors, (98), 8 states have internal predecessors, (98), 3 states have call successors, (61), 3 states have call predecessors, (61), 4 states have return successors, (61), 3 states have call predecessors, (61), 3 states have call successors, (61) [2025-03-04 00:13:19,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1208 states and 1763 transitions. [2025-03-04 00:13:19,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2025-03-04 00:13:19,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:13:19,628 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:19,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 00:13:19,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:13:19,833 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:13:19,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:13:19,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1484667962, now seen corresponding path program 1 times [2025-03-04 00:13:19,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:13:19,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724109362] [2025-03-04 00:13:19,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:19,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:13:19,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 391 statements into 1 equivalence classes. [2025-03-04 00:13:20,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 391 of 391 statements. [2025-03-04 00:13:20,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:20,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 00:13:20,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1512822820] [2025-03-04 00:13:20,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:20,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:13:20,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:13:20,130 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:13:20,131 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:13:20,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 391 statements into 1 equivalence classes. [2025-03-04 00:13:20,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 391 of 391 statements. [2025-03-04 00:13:20,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:20,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:13:20,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 919 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 00:13:20,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:13:22,758 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 4393 proven. 651 refuted. 0 times theorem prover too weak. 2276 trivial. 0 not checked. [2025-03-04 00:13:22,758 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:13:23,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:13:23,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724109362] [2025-03-04 00:13:23,343 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 00:13:23,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512822820] [2025-03-04 00:13:23,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512822820] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:13:23,343 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:13:23,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2025-03-04 00:13:23,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088747538] [2025-03-04 00:13:23,343 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 00:13:23,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 00:13:23,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:13:23,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 00:13:23,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2025-03-04 00:13:23,347 INFO L87 Difference]: Start difference. First operand 1208 states and 1763 transitions. Second operand has 19 states, 19 states have (on average 6.105263157894737) internal successors, (116), 18 states have internal predecessors, (116), 6 states have call successors, (61), 6 states have call predecessors, (61), 10 states have return successors, (61), 6 states have call predecessors, (61), 6 states have call successors, (61) [2025-03-04 00:13:25,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:13:25,250 INFO L93 Difference]: Finished difference Result 2296 states and 3244 transitions. [2025-03-04 00:13:25,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-03-04 00:13:25,251 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.105263157894737) internal successors, (116), 18 states have internal predecessors, (116), 6 states have call successors, (61), 6 states have call predecessors, (61), 10 states have return successors, (61), 6 states have call predecessors, (61), 6 states have call successors, (61) Word has length 391 [2025-03-04 00:13:25,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:13:25,258 INFO L225 Difference]: With dead ends: 2296 [2025-03-04 00:13:25,258 INFO L226 Difference]: Without dead ends: 1867 [2025-03-04 00:13:25,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 649 GetRequests, 602 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 578 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=513, Invalid=1839, Unknown=0, NotChecked=0, Total=2352 [2025-03-04 00:13:25,260 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 821 mSDsluCounter, 1078 mSDsCounter, 0 mSdLazyCounter, 1621 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 1765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 1621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 00:13:25,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 1343 Invalid, 1765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 1621 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 00:13:25,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1867 states. [2025-03-04 00:13:25,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1867 to 1297. [2025-03-04 00:13:25,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1297 states, 1025 states have (on average 1.3375609756097562) internal successors, (1371), 1029 states have internal predecessors, (1371), 229 states have call successors, (229), 42 states have call predecessors, (229), 42 states have return successors, (229), 225 states have call predecessors, (229), 229 states have call successors, (229) [2025-03-04 00:13:25,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1297 states to 1297 states and 1829 transitions. [2025-03-04 00:13:25,422 INFO L78 Accepts]: Start accepts. Automaton has 1297 states and 1829 transitions. Word has length 391 [2025-03-04 00:13:25,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:13:25,422 INFO L471 AbstractCegarLoop]: Abstraction has 1297 states and 1829 transitions. [2025-03-04 00:13:25,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.105263157894737) internal successors, (116), 18 states have internal predecessors, (116), 6 states have call successors, (61), 6 states have call predecessors, (61), 10 states have return successors, (61), 6 states have call predecessors, (61), 6 states have call successors, (61) [2025-03-04 00:13:25,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1297 states and 1829 transitions. [2025-03-04 00:13:25,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2025-03-04 00:13:25,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:13:25,430 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:25,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 00:13:25,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:13:25,630 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:13:25,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:13:25,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1602450907, now seen corresponding path program 1 times [2025-03-04 00:13:25,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:13:25,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330463960] [2025-03-04 00:13:25,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:25,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:13:25,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 391 statements into 1 equivalence classes. [2025-03-04 00:13:25,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 391 of 391 statements. [2025-03-04 00:13:25,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:25,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 00:13:25,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1008509507] [2025-03-04 00:13:25,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:25,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:13:25,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:13:25,939 INFO L229 MonitoredProcess]: Starting monitored process 7 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:13:25,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 00:13:26,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 391 statements into 1 equivalence classes. [2025-03-04 00:13:26,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 391 of 391 statements. [2025-03-04 00:13:26,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:26,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:13:26,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 920 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 00:13:26,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:13:29,996 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 3290 proven. 456 refuted. 0 times theorem prover too weak. 3574 trivial. 0 not checked. [2025-03-04 00:13:29,997 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:13:32,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:13:32,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330463960] [2025-03-04 00:13:32,264 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 00:13:32,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008509507] [2025-03-04 00:13:32,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008509507] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:13:32,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:13:32,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2025-03-04 00:13:32,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459366312] [2025-03-04 00:13:32,265 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 00:13:32,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 00:13:32,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:13:32,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 00:13:32,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=912, Unknown=0, NotChecked=0, Total=1056 [2025-03-04 00:13:32,266 INFO L87 Difference]: Start difference. First operand 1297 states and 1829 transitions. Second operand has 23 states, 23 states have (on average 4.6521739130434785) internal successors, (107), 22 states have internal predecessors, (107), 5 states have call successors, (61), 5 states have call predecessors, (61), 7 states have return successors, (61), 4 states have call predecessors, (61), 5 states have call successors, (61) [2025-03-04 00:13:40,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:13:40,757 INFO L93 Difference]: Finished difference Result 3863 states and 5427 transitions. [2025-03-04 00:13:40,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-04 00:13:40,758 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.6521739130434785) internal successors, (107), 22 states have internal predecessors, (107), 5 states have call successors, (61), 5 states have call predecessors, (61), 7 states have return successors, (61), 4 states have call predecessors, (61), 5 states have call successors, (61) Word has length 391 [2025-03-04 00:13:40,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:13:40,768 INFO L225 Difference]: With dead ends: 3863 [2025-03-04 00:13:40,768 INFO L226 Difference]: Without dead ends: 3433 [2025-03-04 00:13:40,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 406 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=700, Invalid=3590, Unknown=0, NotChecked=0, Total=4290 [2025-03-04 00:13:40,771 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 1751 mSDsluCounter, 3415 mSDsCounter, 0 mSdLazyCounter, 2882 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1751 SdHoareTripleChecker+Valid, 3702 SdHoareTripleChecker+Invalid, 3074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 2882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:13:40,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1751 Valid, 3702 Invalid, 3074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 2882 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2025-03-04 00:13:40,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3433 states. [2025-03-04 00:13:40,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3433 to 1545. [2025-03-04 00:13:40,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1265 states have (on average 1.3573122529644268) internal successors, (1717), 1271 states have internal predecessors, (1717), 233 states have call successors, (233), 46 states have call predecessors, (233), 46 states have return successors, (233), 227 states have call predecessors, (233), 233 states have call successors, (233) [2025-03-04 00:13:40,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 2183 transitions. [2025-03-04 00:13:40,908 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 2183 transitions. Word has length 391 [2025-03-04 00:13:40,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:13:40,909 INFO L471 AbstractCegarLoop]: Abstraction has 1545 states and 2183 transitions. [2025-03-04 00:13:40,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.6521739130434785) internal successors, (107), 22 states have internal predecessors, (107), 5 states have call successors, (61), 5 states have call predecessors, (61), 7 states have return successors, (61), 4 states have call predecessors, (61), 5 states have call successors, (61) [2025-03-04 00:13:40,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 2183 transitions. [2025-03-04 00:13:40,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2025-03-04 00:13:40,912 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:13:40,912 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:40,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 00:13:41,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:13:41,113 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:13:41,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:13:41,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1608741209, now seen corresponding path program 1 times [2025-03-04 00:13:41,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:13:41,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881100884] [2025-03-04 00:13:41,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:41,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:13:41,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 391 statements into 1 equivalence classes. [2025-03-04 00:13:41,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 391 of 391 statements. [2025-03-04 00:13:41,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:41,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 00:13:41,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [309031523] [2025-03-04 00:13:41,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:41,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:13:41,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:13:41,463 INFO L229 MonitoredProcess]: Starting monitored process 8 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:13:41,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 00:13:41,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 391 statements into 1 equivalence classes. [2025-03-04 00:13:41,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 391 of 391 statements. [2025-03-04 00:13:41,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:41,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:13:41,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 919 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-04 00:13:41,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:13:46,530 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 3122 proven. 747 refuted. 0 times theorem prover too weak. 3451 trivial. 0 not checked. [2025-03-04 00:13:46,531 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:13:47,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:13:47,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881100884] [2025-03-04 00:13:47,768 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 00:13:47,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309031523] [2025-03-04 00:13:47,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [309031523] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:13:47,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:13:47,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2025-03-04 00:13:47,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841240154] [2025-03-04 00:13:47,768 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 00:13:47,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-04 00:13:47,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:13:47,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-04 00:13:47,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1210, Unknown=0, NotChecked=0, Total=1406 [2025-03-04 00:13:47,770 INFO L87 Difference]: Start difference. First operand 1545 states and 2183 transitions. Second operand has 29 states, 29 states have (on average 3.896551724137931) internal successors, (113), 26 states have internal predecessors, (113), 6 states have call successors, (61), 6 states have call predecessors, (61), 9 states have return successors, (61), 6 states have call predecessors, (61), 6 states have call successors, (61) [2025-03-04 00:13:58,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:13:58,682 INFO L93 Difference]: Finished difference Result 3769 states and 5309 transitions. [2025-03-04 00:13:58,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-04 00:13:58,683 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.896551724137931) internal successors, (113), 26 states have internal predecessors, (113), 6 states have call successors, (61), 6 states have call predecessors, (61), 9 states have return successors, (61), 6 states have call predecessors, (61), 6 states have call successors, (61) Word has length 391 [2025-03-04 00:13:58,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:13:58,691 INFO L225 Difference]: With dead ends: 3769 [2025-03-04 00:13:58,692 INFO L226 Difference]: Without dead ends: 3296 [2025-03-04 00:13:58,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 401 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1214 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=888, Invalid=4514, Unknown=0, NotChecked=0, Total=5402 [2025-03-04 00:13:58,694 INFO L435 NwaCegarLoop]: 306 mSDtfsCounter, 1285 mSDsluCounter, 4212 mSDsCounter, 0 mSdLazyCounter, 3980 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1285 SdHoareTripleChecker+Valid, 4518 SdHoareTripleChecker+Invalid, 4156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 3980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:13:58,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1285 Valid, 4518 Invalid, 4156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 3980 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2025-03-04 00:13:58,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3296 states. [2025-03-04 00:13:58,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3296 to 1542. [2025-03-04 00:13:58,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 1262 states have (on average 1.3573692551505547) internal successors, (1713), 1268 states have internal predecessors, (1713), 233 states have call successors, (233), 46 states have call predecessors, (233), 46 states have return successors, (233), 227 states have call predecessors, (233), 233 states have call successors, (233) [2025-03-04 00:13:58,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2179 transitions. [2025-03-04 00:13:58,893 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2179 transitions. Word has length 391 [2025-03-04 00:13:58,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:13:58,893 INFO L471 AbstractCegarLoop]: Abstraction has 1542 states and 2179 transitions. [2025-03-04 00:13:58,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.896551724137931) internal successors, (113), 26 states have internal predecessors, (113), 6 states have call successors, (61), 6 states have call predecessors, (61), 9 states have return successors, (61), 6 states have call predecessors, (61), 6 states have call successors, (61) [2025-03-04 00:13:58,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2179 transitions. [2025-03-04 00:13:58,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2025-03-04 00:13:58,902 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:13:58,902 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:58,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 00:13:59,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:13:59,107 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:13:59,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:13:59,107 INFO L85 PathProgramCache]: Analyzing trace with hash 597373100, now seen corresponding path program 1 times [2025-03-04 00:13:59,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:13:59,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309955221] [2025-03-04 00:13:59,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:59,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:13:59,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 391 statements into 1 equivalence classes. [2025-03-04 00:13:59,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 391 of 391 statements. [2025-03-04 00:13:59,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:59,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 00:13:59,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1312758442] [2025-03-04 00:13:59,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:59,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:13:59,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:13:59,462 INFO L229 MonitoredProcess]: Starting monitored process 9 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:13:59,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 00:13:59,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 391 statements into 1 equivalence classes. [2025-03-04 00:13:59,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 391 of 391 statements. [2025-03-04 00:13:59,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:59,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:13:59,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 919 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 00:13:59,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:14:03,537 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 3458 proven. 123 refuted. 0 times theorem prover too weak. 3739 trivial. 0 not checked. [2025-03-04 00:14:03,537 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:14:12,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:14:12,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309955221] [2025-03-04 00:14:12,429 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 00:14:12,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312758442] [2025-03-04 00:14:12,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312758442] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:14:12,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:14:12,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2025-03-04 00:14:12,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899777376] [2025-03-04 00:14:12,430 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 00:14:12,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 00:14:12,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:14:12,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 00:14:12,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=179, Unknown=1, NotChecked=0, Total=240 [2025-03-04 00:14:12,431 INFO L87 Difference]: Start difference. First operand 1542 states and 2179 transitions. Second operand has 11 states, 11 states have (on average 8.909090909090908) internal successors, (98), 10 states have internal predecessors, (98), 3 states have call successors, (61), 3 states have call predecessors, (61), 4 states have return successors, (61), 3 states have call predecessors, (61), 3 states have call successors, (61)