./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-31.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-31.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 1d61576bd95995863195e6d31603d7d0e0f99690d42c4edb47100435eb123db7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:10:11,466 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:10:11,535 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:10:11,544 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:10:11,544 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:10:11,566 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:10:11,568 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:10:11,568 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:10:11,569 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:10:11,569 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:10:11,570 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:10:11,570 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:10:11,570 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:10:11,570 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:10:11,571 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:10:11,571 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:10:11,571 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:10:11,571 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:10:11,571 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:10:11,571 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:10:11,572 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:10:11,572 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:10:11,572 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:10:11,572 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:10:11,572 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:10:11,572 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:10:11,572 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:10:11,572 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:10:11,572 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:10:11,572 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:10:11,572 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:10:11,572 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:10:11,573 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:10:11,573 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:10:11,573 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:10:11,573 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:10:11,573 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:10:11,573 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:10:11,573 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:10:11,573 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:10:11,573 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:10:11,573 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:10:11,573 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:10:11,573 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 -> 1d61576bd95995863195e6d31603d7d0e0f99690d42c4edb47100435eb123db7 [2025-03-04 00:10:11,881 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:10:11,892 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:10:11,895 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:10:11,897 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:10:11,897 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:10:11,899 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-31.i [2025-03-04 00:10:13,257 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17984aab9/ec2f659dcd784b2b89dcf2e0e7dac5d3/FLAG7857d4ca2 [2025-03-04 00:10:13,610 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:10:13,617 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-31.i [2025-03-04 00:10:13,635 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17984aab9/ec2f659dcd784b2b89dcf2e0e7dac5d3/FLAG7857d4ca2 [2025-03-04 00:10:13,819 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17984aab9/ec2f659dcd784b2b89dcf2e0e7dac5d3 [2025-03-04 00:10:13,821 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:10:13,824 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:10:13,827 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:10:13,827 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:10:13,832 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:10:13,834 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:10:13" (1/1) ... [2025-03-04 00:10:13,836 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16fd05f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:13, skipping insertion in model container [2025-03-04 00:10:13,836 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:10:13" (1/1) ... [2025-03-04 00:10:13,863 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:10:13,988 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-31.i[916,929] [2025-03-04 00:10:14,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:10:14,169 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:10:14,179 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-31.i[916,929] [2025-03-04 00:10:14,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:10:14,273 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:10:14,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:14 WrapperNode [2025-03-04 00:10:14,275 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:10:14,276 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:10:14,276 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:10:14,276 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:10:14,282 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:10:14" (1/1) ... [2025-03-04 00:10:14,299 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:10:14" (1/1) ... [2025-03-04 00:10:14,374 INFO L138 Inliner]: procedures = 26, calls = 71, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 450 [2025-03-04 00:10:14,375 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:10:14,376 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:10:14,376 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:10:14,376 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:10:14,384 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:14" (1/1) ... [2025-03-04 00:10:14,385 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:14" (1/1) ... [2025-03-04 00:10:14,401 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:14" (1/1) ... [2025-03-04 00:10:14,442 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:10:14,442 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:14" (1/1) ... [2025-03-04 00:10:14,443 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:14" (1/1) ... [2025-03-04 00:10:14,463 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:14" (1/1) ... [2025-03-04 00:10:14,468 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:14" (1/1) ... [2025-03-04 00:10:14,474 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:14" (1/1) ... [2025-03-04 00:10:14,480 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:14" (1/1) ... [2025-03-04 00:10:14,491 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:10:14,492 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:10:14,492 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:10:14,492 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:10:14,493 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:14" (1/1) ... [2025-03-04 00:10:14,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:10:14,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:10:14,532 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:10:14,536 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:10:14,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:10:14,556 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:10:14,556 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:10:14,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:10:14,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:10:14,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:10:14,657 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:10:14,659 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:10:15,450 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L373: havoc property_#t~ite43#1;havoc property_#t~bitwise42#1;havoc property_#t~short44#1;havoc property_#t~bitwise45#1;havoc property_#t~short46#1;havoc property_#t~bitwise47#1;havoc property_#t~short48#1; [2025-03-04 00:10:15,567 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2025-03-04 00:10:15,568 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:10:15,599 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:10:15,600 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:10:15,600 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:10:15 BoogieIcfgContainer [2025-03-04 00:10:15,600 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:10:15,605 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:10:15,606 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:10:15,610 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:10:15,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:10:13" (1/3) ... [2025-03-04 00:10:15,611 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@227084a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:10:15, skipping insertion in model container [2025-03-04 00:10:15,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:10:14" (2/3) ... [2025-03-04 00:10:15,612 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@227084a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:10:15, skipping insertion in model container [2025-03-04 00:10:15,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:10:15" (3/3) ... [2025-03-04 00:10:15,613 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-31.i [2025-03-04 00:10:15,626 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:10:15,628 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-31.i that has 2 procedures, 196 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:10:15,685 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:10:15,695 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;@77d2fee3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:10:15,696 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:10:15,700 INFO L276 IsEmpty]: Start isEmpty. Operand has 196 states, 135 states have (on average 1.474074074074074) internal successors, (199), 136 states have internal predecessors, (199), 58 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-04 00:10:15,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2025-03-04 00:10:15,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:15,715 INFO L218 NwaCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:15,715 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:15,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:15,721 INFO L85 PathProgramCache]: Analyzing trace with hash -343718301, now seen corresponding path program 1 times [2025-03-04 00:10:15,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:15,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349689787] [2025-03-04 00:10:15,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:15,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:15,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-03-04 00:10:15,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-03-04 00:10:15,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:15,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:16,232 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 6498 trivial. 0 not checked. [2025-03-04 00:10:16,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:16,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349689787] [2025-03-04 00:10:16,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349689787] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:10:16,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141481116] [2025-03-04 00:10:16,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:16,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:10:16,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:10:16,236 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:10:16,239 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:10:16,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-03-04 00:10:16,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-03-04 00:10:16,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:16,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:16,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 835 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:10:16,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:10:16,559 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 6498 trivial. 0 not checked. [2025-03-04 00:10:16,559 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:10:16,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141481116] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:10:16,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:10:16,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:10:16,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878166619] [2025-03-04 00:10:16,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:10:16,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:10:16,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:16,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:10:16,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:10:16,587 INFO L87 Difference]: Start difference. First operand has 196 states, 135 states have (on average 1.474074074074074) internal successors, (199), 136 states have internal predecessors, (199), 58 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) Second operand has 2 states, 2 states have (on average 44.5) internal successors, (89), 2 states have internal predecessors, (89), 2 states have call successors, (58), 2 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 2 states have call successors, (58) [2025-03-04 00:10:16,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:16,648 INFO L93 Difference]: Finished difference Result 385 states and 681 transitions. [2025-03-04 00:10:16,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:10:16,651 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 44.5) internal successors, (89), 2 states have internal predecessors, (89), 2 states have call successors, (58), 2 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 2 states have call successors, (58) Word has length 374 [2025-03-04 00:10:16,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:16,658 INFO L225 Difference]: With dead ends: 385 [2025-03-04 00:10:16,660 INFO L226 Difference]: Without dead ends: 192 [2025-03-04 00:10:16,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 375 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:10:16,672 INFO L435 NwaCegarLoop]: 301 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, 301 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:10:16,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 301 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:10:16,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-03-04 00:10:16,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2025-03-04 00:10:16,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 132 states have (on average 1.446969696969697) internal successors, (191), 132 states have internal predecessors, (191), 58 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-04 00:10:16,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 307 transitions. [2025-03-04 00:10:16,736 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 307 transitions. Word has length 374 [2025-03-04 00:10:16,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:16,738 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 307 transitions. [2025-03-04 00:10:16,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 44.5) internal successors, (89), 2 states have internal predecessors, (89), 2 states have call successors, (58), 2 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 2 states have call successors, (58) [2025-03-04 00:10:16,739 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 307 transitions. [2025-03-04 00:10:16,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2025-03-04 00:10:16,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:16,748 INFO L218 NwaCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:16,758 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:10:16,953 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:10:16,953 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:16,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:16,954 INFO L85 PathProgramCache]: Analyzing trace with hash 872277405, now seen corresponding path program 1 times [2025-03-04 00:10:16,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:16,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691717444] [2025-03-04 00:10:16,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:16,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:16,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-03-04 00:10:17,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-03-04 00:10:17,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:17,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:17,359 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked. [2025-03-04 00:10:17,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:17,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691717444] [2025-03-04 00:10:17,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691717444] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:10:17,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:10:17,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:10:17,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286177246] [2025-03-04 00:10:17,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:10:17,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:10:17,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:17,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:10:17,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:10:17,363 INFO L87 Difference]: Start difference. First operand 192 states and 307 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) [2025-03-04 00:10:17,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:17,517 INFO L93 Difference]: Finished difference Result 562 states and 899 transitions. [2025-03-04 00:10:17,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:10:17,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) Word has length 374 [2025-03-04 00:10:17,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:17,525 INFO L225 Difference]: With dead ends: 562 [2025-03-04 00:10:17,525 INFO L226 Difference]: Without dead ends: 373 [2025-03-04 00:10:17,526 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:10:17,527 INFO L435 NwaCegarLoop]: 342 mSDtfsCounter, 270 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:17,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 617 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:10:17,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-03-04 00:10:17,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 370. [2025-03-04 00:10:17,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 251 states have (on average 1.4143426294820718) internal successors, (355), 251 states have internal predecessors, (355), 116 states have call successors, (116), 2 states have call predecessors, (116), 2 states have return successors, (116), 116 states have call predecessors, (116), 116 states have call successors, (116) [2025-03-04 00:10:17,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 587 transitions. [2025-03-04 00:10:17,618 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 587 transitions. Word has length 374 [2025-03-04 00:10:17,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:17,622 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 587 transitions. [2025-03-04 00:10:17,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) [2025-03-04 00:10:17,622 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 587 transitions. [2025-03-04 00:10:17,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2025-03-04 00:10:17,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:17,628 INFO L218 NwaCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:17,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:10:17,628 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:17,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:17,629 INFO L85 PathProgramCache]: Analyzing trace with hash -666585806, now seen corresponding path program 1 times [2025-03-04 00:10:17,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:17,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001719486] [2025-03-04 00:10:17,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:17,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:17,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-03-04 00:10:17,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-03-04 00:10:17,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:17,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:18,549 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked. [2025-03-04 00:10:18,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:18,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001719486] [2025-03-04 00:10:18,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001719486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:10:18,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:10:18,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 00:10:18,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425477285] [2025-03-04 00:10:18,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:10:18,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 00:10:18,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:18,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 00:10:18,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:10:18,553 INFO L87 Difference]: Start difference. First operand 370 states and 587 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 3 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 3 states have call predecessors, (58), 3 states have call successors, (58) [2025-03-04 00:10:19,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:19,326 INFO L93 Difference]: Finished difference Result 1179 states and 1847 transitions. [2025-03-04 00:10:19,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 00:10:19,327 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 3 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 3 states have call predecessors, (58), 3 states have call successors, (58) Word has length 375 [2025-03-04 00:10:19,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:19,334 INFO L225 Difference]: With dead ends: 1179 [2025-03-04 00:10:19,334 INFO L226 Difference]: Without dead ends: 812 [2025-03-04 00:10:19,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:10:19,336 INFO L435 NwaCegarLoop]: 516 mSDtfsCounter, 617 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 293 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 1322 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 293 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:19,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [617 Valid, 1322 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [293 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 00:10:19,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2025-03-04 00:10:19,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 722. [2025-03-04 00:10:19,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 538 states have (on average 1.4349442379182156) internal successors, (772), 539 states have internal predecessors, (772), 179 states have call successors, (179), 4 states have call predecessors, (179), 4 states have return successors, (179), 178 states have call predecessors, (179), 179 states have call successors, (179) [2025-03-04 00:10:19,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1130 transitions. [2025-03-04 00:10:19,408 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 1130 transitions. Word has length 375 [2025-03-04 00:10:19,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:19,409 INFO L471 AbstractCegarLoop]: Abstraction has 722 states and 1130 transitions. [2025-03-04 00:10:19,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 3 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 3 states have call predecessors, (58), 3 states have call successors, (58) [2025-03-04 00:10:19,409 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1130 transitions. [2025-03-04 00:10:19,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2025-03-04 00:10:19,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:19,414 INFO L218 NwaCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:19,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:10:19,414 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:19,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:19,415 INFO L85 PathProgramCache]: Analyzing trace with hash -832171581, now seen corresponding path program 1 times [2025-03-04 00:10:19,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:19,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861282692] [2025-03-04 00:10:19,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:19,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:19,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-03-04 00:10:19,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-03-04 00:10:19,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:19,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:19,922 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked. [2025-03-04 00:10:19,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:19,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861282692] [2025-03-04 00:10:19,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861282692] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:10:19,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:10:19,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:10:19,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564203936] [2025-03-04 00:10:19,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:10:19,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:10:19,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:19,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:10:19,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:10:19,925 INFO L87 Difference]: Start difference. First operand 722 states and 1130 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) [2025-03-04 00:10:19,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:19,988 INFO L93 Difference]: Finished difference Result 1441 states and 2257 transitions. [2025-03-04 00:10:19,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:10:19,988 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) Word has length 375 [2025-03-04 00:10:19,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:19,994 INFO L225 Difference]: With dead ends: 1441 [2025-03-04 00:10:19,994 INFO L226 Difference]: Without dead ends: 722 [2025-03-04 00:10:19,996 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:10:19,997 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:19,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 593 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:10:20,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2025-03-04 00:10:20,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 722. [2025-03-04 00:10:20,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 538 states have (on average 1.4275092936802973) internal successors, (768), 539 states have internal predecessors, (768), 179 states have call successors, (179), 4 states have call predecessors, (179), 4 states have return successors, (179), 178 states have call predecessors, (179), 179 states have call successors, (179) [2025-03-04 00:10:20,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1126 transitions. [2025-03-04 00:10:20,061 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 1126 transitions. Word has length 375 [2025-03-04 00:10:20,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:20,062 INFO L471 AbstractCegarLoop]: Abstraction has 722 states and 1126 transitions. [2025-03-04 00:10:20,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) [2025-03-04 00:10:20,062 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1126 transitions. [2025-03-04 00:10:20,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2025-03-04 00:10:20,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:20,069 INFO L218 NwaCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:20,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:10:20,070 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:20,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:20,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1754855164, now seen corresponding path program 1 times [2025-03-04 00:10:20,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:20,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626284150] [2025-03-04 00:10:20,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:20,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:20,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-03-04 00:10:20,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-03-04 00:10:20,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:20,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:20,787 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked. [2025-03-04 00:10:20,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:20,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626284150] [2025-03-04 00:10:20,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626284150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:10:20,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:10:20,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:10:20,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592327479] [2025-03-04 00:10:20,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:10:20,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:10:20,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:20,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:10:20,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:10:20,789 INFO L87 Difference]: Start difference. First operand 722 states and 1126 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) [2025-03-04 00:10:21,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:21,254 INFO L93 Difference]: Finished difference Result 1845 states and 2867 transitions. [2025-03-04 00:10:21,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:10:21,255 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) Word has length 375 [2025-03-04 00:10:21,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:21,261 INFO L225 Difference]: With dead ends: 1845 [2025-03-04 00:10:21,261 INFO L226 Difference]: Without dead ends: 1126 [2025-03-04 00:10:21,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:10:21,265 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 201 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 1005 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:21,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 1005 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:10:21,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2025-03-04 00:10:21,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 1098. [2025-03-04 00:10:21,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1098 states, 855 states have (on average 1.4397660818713451) internal successors, (1231), 856 states have internal predecessors, (1231), 237 states have call successors, (237), 5 states have call predecessors, (237), 5 states have return successors, (237), 236 states have call predecessors, (237), 237 states have call successors, (237) [2025-03-04 00:10:21,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 1098 states and 1705 transitions. [2025-03-04 00:10:21,375 INFO L78 Accepts]: Start accepts. Automaton has 1098 states and 1705 transitions. Word has length 375 [2025-03-04 00:10:21,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:21,376 INFO L471 AbstractCegarLoop]: Abstraction has 1098 states and 1705 transitions. [2025-03-04 00:10:21,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) [2025-03-04 00:10:21,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1098 states and 1705 transitions. [2025-03-04 00:10:21,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2025-03-04 00:10:21,383 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:21,384 INFO L218 NwaCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:21,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 00:10:21,384 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:21,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:21,386 INFO L85 PathProgramCache]: Analyzing trace with hash 303504158, now seen corresponding path program 1 times [2025-03-04 00:10:21,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:21,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928088477] [2025-03-04 00:10:21,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:21,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:21,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 376 statements into 1 equivalence classes. [2025-03-04 00:10:21,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 376 of 376 statements. [2025-03-04 00:10:21,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:21,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:21,807 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked. [2025-03-04 00:10:21,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:21,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928088477] [2025-03-04 00:10:21,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928088477] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:10:21,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:10:21,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:10:21,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417286107] [2025-03-04 00:10:21,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:10:21,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:10:21,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:21,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:10:21,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:10:21,811 INFO L87 Difference]: Start difference. First operand 1098 states and 1705 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) [2025-03-04 00:10:22,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:22,070 INFO L93 Difference]: Finished difference Result 2112 states and 3270 transitions. [2025-03-04 00:10:22,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:10:22,071 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) Word has length 376 [2025-03-04 00:10:22,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:22,077 INFO L225 Difference]: With dead ends: 2112 [2025-03-04 00:10:22,077 INFO L226 Difference]: Without dead ends: 1118 [2025-03-04 00:10:22,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:10:22,080 INFO L435 NwaCegarLoop]: 296 mSDtfsCounter, 258 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:22,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 866 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:10:22,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2025-03-04 00:10:22,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 1092. [2025-03-04 00:10:22,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1092 states, 849 states have (on average 1.4358068315665489) internal successors, (1219), 850 states have internal predecessors, (1219), 237 states have call successors, (237), 5 states have call predecessors, (237), 5 states have return successors, (237), 236 states have call predecessors, (237), 237 states have call successors, (237) [2025-03-04 00:10:22,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 1092 states and 1693 transitions. [2025-03-04 00:10:22,154 INFO L78 Accepts]: Start accepts. Automaton has 1092 states and 1693 transitions. Word has length 376 [2025-03-04 00:10:22,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:22,154 INFO L471 AbstractCegarLoop]: Abstraction has 1092 states and 1693 transitions. [2025-03-04 00:10:22,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) [2025-03-04 00:10:22,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1693 transitions. [2025-03-04 00:10:22,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2025-03-04 00:10:22,156 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:22,157 INFO L218 NwaCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:22,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 00:10:22,157 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:22,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:22,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1728891029, now seen corresponding path program 1 times [2025-03-04 00:10:22,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:22,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639362272] [2025-03-04 00:10:22,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:22,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:22,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 377 statements into 1 equivalence classes. [2025-03-04 00:10:22,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 377 of 377 statements. [2025-03-04 00:10:22,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:22,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:22,464 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked. [2025-03-04 00:10:22,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:22,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639362272] [2025-03-04 00:10:22,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639362272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:10:22,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:10:22,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:10:22,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908819223] [2025-03-04 00:10:22,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:10:22,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:10:22,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:22,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:10:22,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:10:22,466 INFO L87 Difference]: Start difference. First operand 1092 states and 1693 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) [2025-03-04 00:10:22,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:22,806 INFO L93 Difference]: Finished difference Result 2738 states and 4237 transitions. [2025-03-04 00:10:22,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:10:22,807 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) Word has length 377 [2025-03-04 00:10:22,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:22,817 INFO L225 Difference]: With dead ends: 2738 [2025-03-04 00:10:22,817 INFO L226 Difference]: Without dead ends: 1755 [2025-03-04 00:10:22,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:10:22,822 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 405 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:22,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 875 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:10:22,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1755 states. [2025-03-04 00:10:22,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1755 to 1456. [2025-03-04 00:10:22,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1456 states, 1095 states have (on average 1.4164383561643836) internal successors, (1551), 1096 states have internal predecessors, (1551), 353 states have call successors, (353), 7 states have call predecessors, (353), 7 states have return successors, (353), 352 states have call predecessors, (353), 353 states have call successors, (353) [2025-03-04 00:10:22,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1456 states to 1456 states and 2257 transitions. [2025-03-04 00:10:22,957 INFO L78 Accepts]: Start accepts. Automaton has 1456 states and 2257 transitions. Word has length 377 [2025-03-04 00:10:22,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:22,959 INFO L471 AbstractCegarLoop]: Abstraction has 1456 states and 2257 transitions. [2025-03-04 00:10:22,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) [2025-03-04 00:10:22,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1456 states and 2257 transitions. [2025-03-04 00:10:22,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2025-03-04 00:10:22,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:22,961 INFO L218 NwaCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:22,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 00:10:22,962 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:22,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:22,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1184052054, now seen corresponding path program 1 times [2025-03-04 00:10:22,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:22,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320769965] [2025-03-04 00:10:22,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:22,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:22,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 377 statements into 1 equivalence classes. [2025-03-04 00:10:23,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 377 of 377 statements. [2025-03-04 00:10:23,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:23,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:23,853 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 195 proven. 141 refuted. 0 times theorem prover too weak. 6276 trivial. 0 not checked. [2025-03-04 00:10:23,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:23,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320769965] [2025-03-04 00:10:23,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320769965] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:10:23,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636846933] [2025-03-04 00:10:23,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:23,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:10:23,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:10:23,856 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:10:23,857 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:10:23,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 377 statements into 1 equivalence classes. [2025-03-04 00:10:24,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 377 of 377 statements. [2025-03-04 00:10:24,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:24,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:24,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-04 00:10:24,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:10:25,317 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 1630 proven. 174 refuted. 0 times theorem prover too weak. 4808 trivial. 0 not checked. [2025-03-04 00:10:25,317 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:10:25,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636846933] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:10:25,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 00:10:25,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 22] total 26 [2025-03-04 00:10:25,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942075519] [2025-03-04 00:10:25,644 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 00:10:25,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 00:10:25,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:25,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 00:10:25,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=731, Unknown=0, NotChecked=0, Total=870 [2025-03-04 00:10:25,649 INFO L87 Difference]: Start difference. First operand 1456 states and 2257 transitions. Second operand has 26 states, 26 states have (on average 7.269230769230769) internal successors, (189), 24 states have internal predecessors, (189), 9 states have call successors, (116), 6 states have call predecessors, (116), 9 states have return successors, (116), 10 states have call predecessors, (116), 9 states have call successors, (116) [2025-03-04 00:10:31,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:31,386 INFO L93 Difference]: Finished difference Result 7753 states and 11511 transitions. [2025-03-04 00:10:31,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2025-03-04 00:10:31,387 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 7.269230769230769) internal successors, (189), 24 states have internal predecessors, (189), 9 states have call successors, (116), 6 states have call predecessors, (116), 9 states have return successors, (116), 10 states have call predecessors, (116), 9 states have call successors, (116) Word has length 377 [2025-03-04 00:10:31,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:31,416 INFO L225 Difference]: With dead ends: 7753 [2025-03-04 00:10:31,417 INFO L226 Difference]: Without dead ends: 6406 [2025-03-04 00:10:31,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 539 GetRequests, 422 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4623 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2451, Invalid=11591, Unknown=0, NotChecked=0, Total=14042 [2025-03-04 00:10:31,426 INFO L435 NwaCegarLoop]: 466 mSDtfsCounter, 3488 mSDsluCounter, 2889 mSDsCounter, 0 mSdLazyCounter, 2630 mSolverCounterSat, 1838 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3539 SdHoareTripleChecker+Valid, 3355 SdHoareTripleChecker+Invalid, 4468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1838 IncrementalHoareTripleChecker+Valid, 2630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:31,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3539 Valid, 3355 Invalid, 4468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1838 Valid, 2630 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-04 00:10:31,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6406 states. [2025-03-04 00:10:31,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6406 to 3909. [2025-03-04 00:10:31,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3909 states, 3175 states have (on average 1.4154330708661418) internal successors, (4494), 3177 states have internal predecessors, (4494), 648 states have call successors, (648), 85 states have call predecessors, (648), 85 states have return successors, (648), 646 states have call predecessors, (648), 648 states have call successors, (648) [2025-03-04 00:10:31,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3909 states to 3909 states and 5790 transitions. [2025-03-04 00:10:31,810 INFO L78 Accepts]: Start accepts. Automaton has 3909 states and 5790 transitions. Word has length 377 [2025-03-04 00:10:31,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:31,811 INFO L471 AbstractCegarLoop]: Abstraction has 3909 states and 5790 transitions. [2025-03-04 00:10:31,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 7.269230769230769) internal successors, (189), 24 states have internal predecessors, (189), 9 states have call successors, (116), 6 states have call predecessors, (116), 9 states have return successors, (116), 10 states have call predecessors, (116), 9 states have call successors, (116) [2025-03-04 00:10:31,811 INFO L276 IsEmpty]: Start isEmpty. Operand 3909 states and 5790 transitions. [2025-03-04 00:10:31,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2025-03-04 00:10:31,814 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:31,815 INFO L218 NwaCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:31,825 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:10:32,020 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,SelfDestructingSolverStorable7 [2025-03-04 00:10:32,021 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:32,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:32,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1597641891, now seen corresponding path program 1 times [2025-03-04 00:10:32,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:32,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357190282] [2025-03-04 00:10:32,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:32,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:32,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 379 statements into 1 equivalence classes. [2025-03-04 00:10:32,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 379 of 379 statements. [2025-03-04 00:10:32,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:32,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 00:10:32,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2108593997] [2025-03-04 00:10:32,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:32,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:10:32,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:10:32,421 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:10:32,424 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:10:32,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 379 statements into 1 equivalence classes. [2025-03-04 00:10:32,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 379 of 379 statements. [2025-03-04 00:10:32,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:32,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:32,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 841 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 00:10:32,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:10:33,291 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 1641 proven. 147 refuted. 0 times theorem prover too weak. 4824 trivial. 0 not checked. [2025-03-04 00:10:33,292 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:10:33,708 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked. [2025-03-04 00:10:33,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:33,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357190282] [2025-03-04 00:10:33,709 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 00:10:33,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108593997] [2025-03-04 00:10:33,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108593997] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 00:10:33,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:10:33,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17 [2025-03-04 00:10:33,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414254155] [2025-03-04 00:10:33,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:10:33,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 00:10:33,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:33,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 00:10:33,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2025-03-04 00:10:33,711 INFO L87 Difference]: Start difference. First operand 3909 states and 5790 transitions. Second operand has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) [2025-03-04 00:10:34,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:34,637 INFO L93 Difference]: Finished difference Result 16069 states and 23901 transitions. [2025-03-04 00:10:34,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 00:10:34,638 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) Word has length 379 [2025-03-04 00:10:34,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:34,681 INFO L225 Difference]: With dead ends: 16069 [2025-03-04 00:10:34,681 INFO L226 Difference]: Without dead ends: 12457 [2025-03-04 00:10:34,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 763 GetRequests, 744 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2025-03-04 00:10:34,695 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 960 mSDsluCounter, 1365 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 960 SdHoareTripleChecker+Valid, 1716 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:34,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [960 Valid, 1716 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 00:10:34,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12457 states. [2025-03-04 00:10:35,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12457 to 5833. [2025-03-04 00:10:35,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5833 states, 5035 states have (on average 1.44428997020854) internal successors, (7272), 5045 states have internal predecessors, (7272), 700 states have call successors, (700), 97 states have call predecessors, (700), 97 states have return successors, (700), 690 states have call predecessors, (700), 700 states have call successors, (700) [2025-03-04 00:10:35,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5833 states to 5833 states and 8672 transitions. [2025-03-04 00:10:35,046 INFO L78 Accepts]: Start accepts. Automaton has 5833 states and 8672 transitions. Word has length 379 [2025-03-04 00:10:35,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:35,046 INFO L471 AbstractCegarLoop]: Abstraction has 5833 states and 8672 transitions. [2025-03-04 00:10:35,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) [2025-03-04 00:10:35,047 INFO L276 IsEmpty]: Start isEmpty. Operand 5833 states and 8672 transitions. [2025-03-04 00:10:35,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2025-03-04 00:10:35,049 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:35,050 INFO L218 NwaCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:35,059 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:10:35,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:10:35,251 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:35,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:35,251 INFO L85 PathProgramCache]: Analyzing trace with hash -636027874, now seen corresponding path program 1 times [2025-03-04 00:10:35,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:35,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56188246] [2025-03-04 00:10:35,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:35,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:35,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 379 statements into 1 equivalence classes. [2025-03-04 00:10:35,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 379 of 379 statements. [2025-03-04 00:10:35,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:35,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:36,730 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 6 proven. 165 refuted. 0 times theorem prover too weak. 6441 trivial. 0 not checked. [2025-03-04 00:10:36,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:36,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56188246] [2025-03-04 00:10:36,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56188246] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:10:36,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089655456] [2025-03-04 00:10:36,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:36,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:10:36,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:10:36,744 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:10:36,764 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:10:36,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 379 statements into 1 equivalence classes. [2025-03-04 00:10:36,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 379 of 379 statements. [2025-03-04 00:10:36,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:36,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:36,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 00:10:36,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:10:38,267 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 501 proven. 165 refuted. 0 times theorem prover too weak. 5946 trivial. 0 not checked. [2025-03-04 00:10:38,267 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:10:38,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089655456] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:10:38,851 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 00:10:38,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2025-03-04 00:10:38,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768575691] [2025-03-04 00:10:38,851 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 00:10:38,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 00:10:38,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:38,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 00:10:38,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2025-03-04 00:10:38,852 INFO L87 Difference]: Start difference. First operand 5833 states and 8672 transitions. Second operand has 15 states, 15 states have (on average 8.133333333333333) internal successors, (122), 15 states have internal predecessors, (122), 2 states have call successors, (116), 3 states have call predecessors, (116), 5 states have return successors, (116), 2 states have call predecessors, (116), 2 states have call successors, (116) [2025-03-04 00:10:40,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:40,835 INFO L93 Difference]: Finished difference Result 11693 states and 17333 transitions. [2025-03-04 00:10:40,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 00:10:40,836 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 8.133333333333333) internal successors, (122), 15 states have internal predecessors, (122), 2 states have call successors, (116), 3 states have call predecessors, (116), 5 states have return successors, (116), 2 states have call predecessors, (116), 2 states have call successors, (116) Word has length 379 [2025-03-04 00:10:40,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:40,862 INFO L225 Difference]: With dead ends: 11693 [2025-03-04 00:10:40,862 INFO L226 Difference]: Without dead ends: 6553 [2025-03-04 00:10:40,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 425 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=147, Invalid=609, Unknown=0, NotChecked=0, Total=756 [2025-03-04 00:10:40,873 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 329 mSDsluCounter, 1401 mSDsCounter, 0 mSdLazyCounter, 1582 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 1616 SdHoareTripleChecker+Invalid, 1625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:40,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 1616 Invalid, 1625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1582 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-04 00:10:40,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6553 states. [2025-03-04 00:10:41,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6553 to 5833. [2025-03-04 00:10:41,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5833 states, 5030 states have (on average 1.440755467196819) internal successors, (7247), 5040 states have internal predecessors, (7247), 700 states have call successors, (700), 102 states have call predecessors, (700), 102 states have return successors, (700), 690 states have call predecessors, (700), 700 states have call successors, (700) [2025-03-04 00:10:41,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5833 states to 5833 states and 8647 transitions. [2025-03-04 00:10:41,292 INFO L78 Accepts]: Start accepts. Automaton has 5833 states and 8647 transitions. Word has length 379 [2025-03-04 00:10:41,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:41,293 INFO L471 AbstractCegarLoop]: Abstraction has 5833 states and 8647 transitions. [2025-03-04 00:10:41,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 8.133333333333333) internal successors, (122), 15 states have internal predecessors, (122), 2 states have call successors, (116), 3 states have call predecessors, (116), 5 states have return successors, (116), 2 states have call predecessors, (116), 2 states have call successors, (116) [2025-03-04 00:10:41,293 INFO L276 IsEmpty]: Start isEmpty. Operand 5833 states and 8647 transitions. [2025-03-04 00:10:41,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2025-03-04 00:10:41,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:41,296 INFO L218 NwaCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:41,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 00:10:41,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:10:41,500 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:41,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:41,501 INFO L85 PathProgramCache]: Analyzing trace with hash 70849598, now seen corresponding path program 1 times [2025-03-04 00:10:41,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:41,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446995286] [2025-03-04 00:10:41,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:41,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:41,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 379 statements into 1 equivalence classes. [2025-03-04 00:10:41,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 379 of 379 statements. [2025-03-04 00:10:41,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:41,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:44,311 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked. [2025-03-04 00:10:44,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:44,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446995286] [2025-03-04 00:10:44,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446995286] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:10:44,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:10:44,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:10:44,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079542881] [2025-03-04 00:10:44,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:10:44,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:10:44,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:44,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:10:44,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:10:44,313 INFO L87 Difference]: Start difference. First operand 5833 states and 8647 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) [2025-03-04 00:10:44,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:44,832 INFO L93 Difference]: Finished difference Result 14739 states and 21910 transitions. [2025-03-04 00:10:44,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:10:44,832 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) Word has length 379 [2025-03-04 00:10:44,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:44,853 INFO L225 Difference]: With dead ends: 14739 [2025-03-04 00:10:44,853 INFO L226 Difference]: Without dead ends: 9627 [2025-03-04 00:10:44,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:10:44,860 INFO L435 NwaCegarLoop]: 297 mSDtfsCounter, 255 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:44,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 791 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:10:44,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9627 states. [2025-03-04 00:10:45,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9627 to 7463. [2025-03-04 00:10:45,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7463 states, 6612 states have (on average 1.4621899576527526) internal successors, (9668), 6634 states have internal predecessors, (9668), 736 states have call successors, (736), 114 states have call predecessors, (736), 114 states have return successors, (736), 714 states have call predecessors, (736), 736 states have call successors, (736) [2025-03-04 00:10:45,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7463 states to 7463 states and 11140 transitions. [2025-03-04 00:10:45,132 INFO L78 Accepts]: Start accepts. Automaton has 7463 states and 11140 transitions. Word has length 379 [2025-03-04 00:10:45,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:45,133 INFO L471 AbstractCegarLoop]: Abstraction has 7463 states and 11140 transitions. [2025-03-04 00:10:45,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) [2025-03-04 00:10:45,133 INFO L276 IsEmpty]: Start isEmpty. Operand 7463 states and 11140 transitions. [2025-03-04 00:10:45,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2025-03-04 00:10:45,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:45,136 INFO L218 NwaCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:45,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 00:10:45,136 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:45,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:45,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1173914883, now seen corresponding path program 1 times [2025-03-04 00:10:45,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:45,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995017287] [2025-03-04 00:10:45,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:45,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:45,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 379 statements into 1 equivalence classes. [2025-03-04 00:10:45,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 379 of 379 statements. [2025-03-04 00:10:45,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:45,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 00:10:45,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [294874024] [2025-03-04 00:10:45,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:45,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:10:45,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:10:45,329 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:10:45,330 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:10:45,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 379 statements into 1 equivalence classes. [2025-03-04 00:10:45,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 379 of 379 statements. [2025-03-04 00:10:45,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:45,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:45,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 840 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 00:10:45,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:10:47,543 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 4233 proven. 441 refuted. 0 times theorem prover too weak. 1938 trivial. 0 not checked. [2025-03-04 00:10:47,544 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:11:36,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:11:36,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995017287] [2025-03-04 00:11:36,012 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 00:11:36,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294874024] [2025-03-04 00:11:36,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294874024] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:11:36,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:11:36,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2025-03-04 00:11:36,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78939947] [2025-03-04 00:11:36,012 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 00:11:36,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 00:11:36,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:11:36,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 00:11:36,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=320, Unknown=10, NotChecked=0, Total=420 [2025-03-04 00:11:36,016 INFO L87 Difference]: Start difference. First operand 7463 states and 11140 transitions. Second operand has 16 states, 16 states have (on average 7.0625) internal successors, (113), 14 states have internal predecessors, (113), 5 states have call successors, (58), 5 states have call predecessors, (58), 8 states have return successors, (58), 5 states have call predecessors, (58), 5 states have call successors, (58)