./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem16_label55.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem16_label55.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 8e1a5ec7c69529be2d8c0f142d6c458fe9f526e0a4b1c8c2c339cb2c1b253dd3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:09:31,282 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:09:31,382 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 00:09:31,391 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:09:31,392 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:09:31,442 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:09:31,443 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:09:31,443 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:09:31,443 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:09:31,443 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:09:31,443 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:09:31,444 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:09:31,444 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:09:31,444 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:09:31,445 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:09:31,445 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:09:31,445 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:09:31,445 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:09:31,449 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:09:31,449 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:09:31,449 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:09:31,450 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:09:31,450 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:09:31,450 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:09:31,450 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:09:31,450 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:09:31,450 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:09:31,450 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:09:31,450 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:09:31,450 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:09:31,450 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:09:31,450 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:09:31,450 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:09:31,450 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:09:31,450 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:09:31,450 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:09:31,450 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:09:31,450 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:09:31,450 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:09:31,450 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:09:31,450 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:09:31,450 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:09:31,450 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:09:31,451 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:09:31,451 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:09:31,451 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:09:31,451 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:09:31,451 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:09:31,451 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/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 -> 8e1a5ec7c69529be2d8c0f142d6c458fe9f526e0a4b1c8c2c339cb2c1b253dd3 [2025-01-09 00:09:31,699 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:09:31,704 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:09:31,705 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:09:31,706 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:09:31,706 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:09:31,707 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label55.c [2025-01-09 00:09:32,899 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e0b86d6b2/baf3e8e1244d4fbbb7f81c5d9c980336/FLAG98783d04d [2025-01-09 00:09:33,312 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:09:33,312 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label55.c [2025-01-09 00:09:33,327 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e0b86d6b2/baf3e8e1244d4fbbb7f81c5d9c980336/FLAG98783d04d [2025-01-09 00:09:33,490 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e0b86d6b2/baf3e8e1244d4fbbb7f81c5d9c980336 [2025-01-09 00:09:33,491 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:09:33,492 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:09:33,495 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:09:33,495 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:09:33,498 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:09:33,498 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:09:33" (1/1) ... [2025-01-09 00:09:33,499 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@743c8c7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:09:33, skipping insertion in model container [2025-01-09 00:09:33,499 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:09:33" (1/1) ... [2025-01-09 00:09:33,539 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:09:33,664 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label55.c[5995,6008] [2025-01-09 00:09:33,920 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:09:33,928 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:09:33,950 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label55.c[5995,6008] [2025-01-09 00:09:34,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:09:34,124 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:09:34,125 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:09:34 WrapperNode [2025-01-09 00:09:34,125 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:09:34,127 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:09:34,127 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:09:34,127 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:09:34,133 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:09:34" (1/1) ... [2025-01-09 00:09:34,162 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:09:34" (1/1) ... [2025-01-09 00:09:34,326 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1767 [2025-01-09 00:09:34,327 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:09:34,327 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:09:34,328 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:09:34,328 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:09:34,335 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:09:34" (1/1) ... [2025-01-09 00:09:34,336 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:09:34" (1/1) ... [2025-01-09 00:09:34,353 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:09:34" (1/1) ... [2025-01-09 00:09:34,414 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-01-09 00:09:34,414 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:09:34" (1/1) ... [2025-01-09 00:09:34,414 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:09:34" (1/1) ... [2025-01-09 00:09:34,474 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:09:34" (1/1) ... [2025-01-09 00:09:34,482 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:09:34" (1/1) ... [2025-01-09 00:09:34,496 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:09:34" (1/1) ... [2025-01-09 00:09:34,513 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:09:34" (1/1) ... [2025-01-09 00:09:34,521 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:09:34" (1/1) ... [2025-01-09 00:09:34,535 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:09:34,537 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:09:34,537 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:09:34,537 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:09:34,538 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:09:34" (1/1) ... [2025-01-09 00:09:34,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:09:34,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:09:34,561 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 00:09:34,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 00:09:34,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:09:34,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:09:34,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:09:34,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:09:34,635 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:09:34,637 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:09:36,312 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2025-01-09 00:09:36,313 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:09:36,325 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:09:36,325 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 00:09:36,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:09:36 BoogieIcfgContainer [2025-01-09 00:09:36,326 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:09:36,327 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:09:36,327 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:09:36,331 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:09:36,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:09:33" (1/3) ... [2025-01-09 00:09:36,331 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c5e6512 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:09:36, skipping insertion in model container [2025-01-09 00:09:36,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:09:34" (2/3) ... [2025-01-09 00:09:36,332 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c5e6512 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:09:36, skipping insertion in model container [2025-01-09 00:09:36,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:09:36" (3/3) ... [2025-01-09 00:09:36,333 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem16_label55.c [2025-01-09 00:09:36,343 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:09:36,344 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem16_label55.c that has 1 procedures, 396 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 00:09:36,419 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:09:36,438 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;@21044e6c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:09:36,438 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:09:36,445 INFO L276 IsEmpty]: Start isEmpty. Operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:36,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-09 00:09:36,458 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:09:36,459 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:09:36,460 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:09:36,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:09:36,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1361349908, now seen corresponding path program 1 times [2025-01-09 00:09:36,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:09:36,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069959653] [2025-01-09 00:09:36,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:09:36,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:09:36,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 00:09:36,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 00:09:36,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:09:36,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:09:36,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:09:36,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:09:36,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069959653] [2025-01-09 00:09:36,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069959653] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:09:36,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:09:36,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:09:36,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218891965] [2025-01-09 00:09:36,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:09:36,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:09:36,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:09:36,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:09:36,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:09:36,790 INFO L87 Difference]: Start difference. First operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 2 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:38,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:09:38,556 INFO L93 Difference]: Finished difference Result 1137 states and 2115 transitions. [2025-01-09 00:09:38,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:09:38,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 2 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-01-09 00:09:38,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:09:38,573 INFO L225 Difference]: With dead ends: 1137 [2025-01-09 00:09:38,574 INFO L226 Difference]: Without dead ends: 662 [2025-01-09 00:09:38,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-01-09 00:09:38,581 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 329 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:09:38,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 60 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 00:09:38,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2025-01-09 00:09:38,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2025-01-09 00:09:38,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.7639939485627836) internal successors, (1166), 661 states have internal predecessors, (1166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:38,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1166 transitions. [2025-01-09 00:09:38,655 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1166 transitions. Word has length 57 [2025-01-09 00:09:38,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:09:38,656 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 1166 transitions. [2025-01-09 00:09:38,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 2 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:38,656 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1166 transitions. [2025-01-09 00:09:38,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 00:09:38,659 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:09:38,659 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:09:38,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:09:38,661 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:09:38,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:09:38,666 INFO L85 PathProgramCache]: Analyzing trace with hash -498567692, now seen corresponding path program 1 times [2025-01-09 00:09:38,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:09:38,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048610674] [2025-01-09 00:09:38,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:09:38,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:09:38,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 00:09:38,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 00:09:38,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:09:38,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:09:38,860 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:09:38,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:09:38,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048610674] [2025-01-09 00:09:38,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048610674] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:09:38,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:09:38,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:09:38,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275492841] [2025-01-09 00:09:38,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:09:38,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:09:38,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:09:38,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:09:38,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:09:38,866 INFO L87 Difference]: Start difference. First operand 662 states and 1166 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:39,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:09:39,982 INFO L93 Difference]: Finished difference Result 1980 states and 3493 transitions. [2025-01-09 00:09:39,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:09:39,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2025-01-09 00:09:39,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:09:39,987 INFO L225 Difference]: With dead ends: 1980 [2025-01-09 00:09:39,987 INFO L226 Difference]: Without dead ends: 1320 [2025-01-09 00:09:39,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-01-09 00:09:39,989 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 344 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 401 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 401 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:09:39,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 77 Invalid, 1283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [401 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:09:39,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2025-01-09 00:09:40,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1320. [2025-01-09 00:09:40,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1320 states, 1319 states have (on average 1.6656557998483699) internal successors, (2197), 1319 states have internal predecessors, (2197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:40,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 2197 transitions. [2025-01-09 00:09:40,051 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 2197 transitions. Word has length 122 [2025-01-09 00:09:40,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:09:40,052 INFO L471 AbstractCegarLoop]: Abstraction has 1320 states and 2197 transitions. [2025-01-09 00:09:40,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:40,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 2197 transitions. [2025-01-09 00:09:40,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 00:09:40,058 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:09:40,058 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:09:40,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:09:40,058 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:09:40,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:09:40,062 INFO L85 PathProgramCache]: Analyzing trace with hash 871744953, now seen corresponding path program 1 times [2025-01-09 00:09:40,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:09:40,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228706930] [2025-01-09 00:09:40,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:09:40,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:09:40,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 00:09:40,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 00:09:40,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:09:40,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:09:40,347 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:09:40,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:09:40,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228706930] [2025-01-09 00:09:40,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228706930] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:09:40,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:09:40,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:09:40,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204507588] [2025-01-09 00:09:40,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:09:40,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:09:40,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:09:40,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:09:40,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:09:40,349 INFO L87 Difference]: Start difference. First operand 1320 states and 2197 transitions. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:42,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:09:42,016 INFO L93 Difference]: Finished difference Result 3625 states and 5926 transitions. [2025-01-09 00:09:42,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:09:42,017 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 125 [2025-01-09 00:09:42,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:09:42,025 INFO L225 Difference]: With dead ends: 3625 [2025-01-09 00:09:42,026 INFO L226 Difference]: Without dead ends: 2307 [2025-01-09 00:09:42,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-01-09 00:09:42,029 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 1003 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1496 mSolverCounterSat, 523 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1003 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 2019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 523 IncrementalHoareTripleChecker+Valid, 1496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:09:42,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1003 Valid, 43 Invalid, 2019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [523 Valid, 1496 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 00:09:42,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2025-01-09 00:09:42,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2307. [2025-01-09 00:09:42,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2307 states, 2306 states have (on average 1.502601908065915) internal successors, (3465), 2306 states have internal predecessors, (3465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:42,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3465 transitions. [2025-01-09 00:09:42,077 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 3465 transitions. Word has length 125 [2025-01-09 00:09:42,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:09:42,078 INFO L471 AbstractCegarLoop]: Abstraction has 2307 states and 3465 transitions. [2025-01-09 00:09:42,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:42,079 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 3465 transitions. [2025-01-09 00:09:42,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2025-01-09 00:09:42,083 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:09:42,084 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:09:42,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 00:09:42,084 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:09:42,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:09:42,085 INFO L85 PathProgramCache]: Analyzing trace with hash -912773875, now seen corresponding path program 1 times [2025-01-09 00:09:42,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:09:42,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050188589] [2025-01-09 00:09:42,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:09:42,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:09:42,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes. [2025-01-09 00:09:42,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements. [2025-01-09 00:09:42,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:09:42,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:09:42,335 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-01-09 00:09:42,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:09:42,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050188589] [2025-01-09 00:09:42,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050188589] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:09:42,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:09:42,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:09:42,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335861252] [2025-01-09 00:09:42,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:09:42,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:09:42,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:09:42,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:09:42,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:09:42,339 INFO L87 Difference]: Start difference. First operand 2307 states and 3465 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 2 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:43,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:09:43,386 INFO L93 Difference]: Finished difference Result 6257 states and 9720 transitions. [2025-01-09 00:09:43,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:09:43,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 2 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 241 [2025-01-09 00:09:43,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:09:43,400 INFO L225 Difference]: With dead ends: 6257 [2025-01-09 00:09:43,400 INFO L226 Difference]: Without dead ends: 4281 [2025-01-09 00:09:43,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-01-09 00:09:43,403 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 260 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 1196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 390 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:09:43,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 211 Invalid, 1196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [390 Valid, 806 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 00:09:43,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4281 states. [2025-01-09 00:09:43,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4281 to 4281. [2025-01-09 00:09:43,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4281 states, 4280 states have (on average 1.3535046728971962) internal successors, (5793), 4280 states have internal predecessors, (5793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:43,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4281 states to 4281 states and 5793 transitions. [2025-01-09 00:09:43,466 INFO L78 Accepts]: Start accepts. Automaton has 4281 states and 5793 transitions. Word has length 241 [2025-01-09 00:09:43,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:09:43,466 INFO L471 AbstractCegarLoop]: Abstraction has 4281 states and 5793 transitions. [2025-01-09 00:09:43,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 2 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:43,467 INFO L276 IsEmpty]: Start isEmpty. Operand 4281 states and 5793 transitions. [2025-01-09 00:09:43,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2025-01-09 00:09:43,470 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:09:43,470 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:09:43,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 00:09:43,471 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:09:43,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:09:43,471 INFO L85 PathProgramCache]: Analyzing trace with hash -361620296, now seen corresponding path program 1 times [2025-01-09 00:09:43,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:09:43,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915986460] [2025-01-09 00:09:43,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:09:43,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:09:43,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 320 statements into 1 equivalence classes. [2025-01-09 00:09:43,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 320 of 320 statements. [2025-01-09 00:09:43,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:09:43,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:09:43,647 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 274 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2025-01-09 00:09:43,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:09:43,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915986460] [2025-01-09 00:09:43,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915986460] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:09:43,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:09:43,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:09:43,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971985155] [2025-01-09 00:09:43,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:09:43,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:09:43,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:09:43,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:09:43,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:09:43,649 INFO L87 Difference]: Start difference. First operand 4281 states and 5793 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:44,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:09:44,757 INFO L93 Difference]: Finished difference Result 10534 states and 14411 transitions. [2025-01-09 00:09:44,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:09:44,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 320 [2025-01-09 00:09:44,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:09:44,774 INFO L225 Difference]: With dead ends: 10534 [2025-01-09 00:09:44,774 INFO L226 Difference]: Without dead ends: 6584 [2025-01-09 00:09:44,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-01-09 00:09:44,780 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 359 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:09:44,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 155 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 00:09:44,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6584 states. [2025-01-09 00:09:44,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6584 to 5926. [2025-01-09 00:09:44,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5926 states, 5925 states have (on average 1.239324894514768) internal successors, (7343), 5925 states have internal predecessors, (7343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:44,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5926 states to 5926 states and 7343 transitions. [2025-01-09 00:09:44,867 INFO L78 Accepts]: Start accepts. Automaton has 5926 states and 7343 transitions. Word has length 320 [2025-01-09 00:09:44,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:09:44,868 INFO L471 AbstractCegarLoop]: Abstraction has 5926 states and 7343 transitions. [2025-01-09 00:09:44,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:44,868 INFO L276 IsEmpty]: Start isEmpty. Operand 5926 states and 7343 transitions. [2025-01-09 00:09:44,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 574 [2025-01-09 00:09:44,876 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:09:44,877 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:09:44,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 00:09:44,878 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:09:44,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:09:44,878 INFO L85 PathProgramCache]: Analyzing trace with hash 2119392069, now seen corresponding path program 1 times [2025-01-09 00:09:44,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:09:44,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102120203] [2025-01-09 00:09:44,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:09:44,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:09:44,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 573 statements into 1 equivalence classes. [2025-01-09 00:09:44,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 573 of 573 statements. [2025-01-09 00:09:44,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:09:44,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:09:45,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1211 backedges. 741 proven. 0 refuted. 0 times theorem prover too weak. 470 trivial. 0 not checked. [2025-01-09 00:09:45,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:09:45,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102120203] [2025-01-09 00:09:45,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102120203] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:09:45,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:09:45,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:09:45,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34212499] [2025-01-09 00:09:45,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:09:45,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:09:45,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:09:45,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:09:45,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:09:45,215 INFO L87 Difference]: Start difference. First operand 5926 states and 7343 transitions. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:46,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:09:46,179 INFO L93 Difference]: Finished difference Result 13824 states and 17168 transitions. [2025-01-09 00:09:46,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:09:46,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 573 [2025-01-09 00:09:46,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:09:46,195 INFO L225 Difference]: With dead ends: 13824 [2025-01-09 00:09:46,195 INFO L226 Difference]: Without dead ends: 6913 [2025-01-09 00:09:46,203 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-01-09 00:09:46,205 INFO L435 NwaCegarLoop]: 534 mSDtfsCounter, 286 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 297 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 297 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:09:46,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 540 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [297 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 00:09:46,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6913 states. [2025-01-09 00:09:46,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6913 to 6913. [2025-01-09 00:09:46,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6913 states, 6912 states have (on average 1.0724826388888888) internal successors, (7413), 6912 states have internal predecessors, (7413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:46,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6913 states to 6913 states and 7413 transitions. [2025-01-09 00:09:46,353 INFO L78 Accepts]: Start accepts. Automaton has 6913 states and 7413 transitions. Word has length 573 [2025-01-09 00:09:46,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:09:46,353 INFO L471 AbstractCegarLoop]: Abstraction has 6913 states and 7413 transitions. [2025-01-09 00:09:46,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:46,354 INFO L276 IsEmpty]: Start isEmpty. Operand 6913 states and 7413 transitions. [2025-01-09 00:09:46,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 895 [2025-01-09 00:09:46,378 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:09:46,379 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:09:46,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 00:09:46,379 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:09:46,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:09:46,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1142161716, now seen corresponding path program 1 times [2025-01-09 00:09:46,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:09:46,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841181951] [2025-01-09 00:09:46,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:09:46,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:09:46,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 894 statements into 1 equivalence classes. [2025-01-09 00:09:46,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 894 of 894 statements. [2025-01-09 00:09:46,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:09:46,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:09:47,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 1145 proven. 0 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2025-01-09 00:09:47,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:09:47,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841181951] [2025-01-09 00:09:47,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841181951] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:09:47,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:09:47,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:09:47,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254255082] [2025-01-09 00:09:47,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:09:47,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:09:47,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:09:47,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:09:47,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:09:47,172 INFO L87 Difference]: Start difference. First operand 6913 states and 7413 transitions. Second operand has 3 states, 3 states have (on average 207.0) internal successors, (621), 3 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:47,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:09:47,895 INFO L93 Difference]: Finished difference Result 16127 states and 17353 transitions. [2025-01-09 00:09:47,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:09:47,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 207.0) internal successors, (621), 3 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 894 [2025-01-09 00:09:47,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:09:47,924 INFO L225 Difference]: With dead ends: 16127 [2025-01-09 00:09:47,924 INFO L226 Difference]: Without dead ends: 9545 [2025-01-09 00:09:47,930 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-01-09 00:09:47,931 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 219 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:09:47,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 428 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:09:47,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9545 states. [2025-01-09 00:09:48,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9545 to 8229. [2025-01-09 00:09:48,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8229 states, 8228 states have (on average 1.0642926592124453) internal successors, (8757), 8228 states have internal predecessors, (8757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:48,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8229 states to 8229 states and 8757 transitions. [2025-01-09 00:09:48,055 INFO L78 Accepts]: Start accepts. Automaton has 8229 states and 8757 transitions. Word has length 894 [2025-01-09 00:09:48,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:09:48,056 INFO L471 AbstractCegarLoop]: Abstraction has 8229 states and 8757 transitions. [2025-01-09 00:09:48,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 207.0) internal successors, (621), 3 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:48,057 INFO L276 IsEmpty]: Start isEmpty. Operand 8229 states and 8757 transitions. [2025-01-09 00:09:48,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 958 [2025-01-09 00:09:48,068 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:09:48,068 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:09:48,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 00:09:48,069 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:09:48,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:09:48,069 INFO L85 PathProgramCache]: Analyzing trace with hash -2088910111, now seen corresponding path program 1 times [2025-01-09 00:09:48,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:09:48,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250870333] [2025-01-09 00:09:48,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:09:48,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:09:48,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 957 statements into 1 equivalence classes. [2025-01-09 00:09:48,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 957 of 957 statements. [2025-01-09 00:09:48,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:09:48,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:09:48,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1631 backedges. 1132 proven. 0 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2025-01-09 00:09:48,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:09:48,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250870333] [2025-01-09 00:09:48,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250870333] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:09:48,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:09:48,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:09:48,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834971960] [2025-01-09 00:09:48,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:09:48,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:09:48,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:09:48,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:09:48,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:09:48,555 INFO L87 Difference]: Start difference. First operand 8229 states and 8757 transitions. Second operand has 3 states, 3 states have (on average 222.66666666666666) internal successors, (668), 3 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:49,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:09:49,282 INFO L93 Difference]: Finished difference Result 18759 states and 20022 transitions. [2025-01-09 00:09:49,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:09:49,283 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 222.66666666666666) internal successors, (668), 3 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 957 [2025-01-09 00:09:49,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:09:49,300 INFO L225 Difference]: With dead ends: 18759 [2025-01-09 00:09:49,300 INFO L226 Difference]: Without dead ends: 10861 [2025-01-09 00:09:49,308 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-01-09 00:09:49,310 INFO L435 NwaCegarLoop]: 408 mSDtfsCounter, 175 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:09:49,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 414 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:09:49,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10861 states. [2025-01-09 00:09:49,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10861 to 9545. [2025-01-09 00:09:49,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9545 states, 9544 states have (on average 1.0489312657166807) internal successors, (10011), 9544 states have internal predecessors, (10011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:49,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9545 states to 9545 states and 10011 transitions. [2025-01-09 00:09:49,505 INFO L78 Accepts]: Start accepts. Automaton has 9545 states and 10011 transitions. Word has length 957 [2025-01-09 00:09:49,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:09:49,506 INFO L471 AbstractCegarLoop]: Abstraction has 9545 states and 10011 transitions. [2025-01-09 00:09:49,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 222.66666666666666) internal successors, (668), 3 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:49,507 INFO L276 IsEmpty]: Start isEmpty. Operand 9545 states and 10011 transitions. [2025-01-09 00:09:49,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1282 [2025-01-09 00:09:49,536 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:09:49,536 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:09:49,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 00:09:49,537 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:09:49,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:09:49,538 INFO L85 PathProgramCache]: Analyzing trace with hash 352995942, now seen corresponding path program 1 times [2025-01-09 00:09:49,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:09:49,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840329143] [2025-01-09 00:09:49,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:09:49,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:09:49,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1281 statements into 1 equivalence classes. [2025-01-09 00:09:49,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1281 of 1281 statements. [2025-01-09 00:09:49,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:09:49,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:09:50,698 INFO L134 CoverageAnalysis]: Checked inductivity of 3001 backedges. 1753 proven. 0 refuted. 0 times theorem prover too weak. 1248 trivial. 0 not checked. [2025-01-09 00:09:50,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:09:50,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840329143] [2025-01-09 00:09:50,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840329143] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:09:50,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:09:50,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:09:50,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604560701] [2025-01-09 00:09:50,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:09:50,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:09:50,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:09:50,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:09:50,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:09:50,703 INFO L87 Difference]: Start difference. First operand 9545 states and 10011 transitions. Second operand has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:51,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:09:51,430 INFO L93 Difference]: Finished difference Result 19746 states and 20741 transitions. [2025-01-09 00:09:51,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:09:51,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1281 [2025-01-09 00:09:51,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:09:51,447 INFO L225 Difference]: With dead ends: 19746 [2025-01-09 00:09:51,447 INFO L226 Difference]: Without dead ends: 10532 [2025-01-09 00:09:51,455 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-01-09 00:09:51,455 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 224 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:09:51,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 439 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:09:51,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10532 states. [2025-01-09 00:09:51,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10532 to 10532. [2025-01-09 00:09:51,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10532 states, 10531 states have (on average 1.0450099705630995) internal successors, (11005), 10531 states have internal predecessors, (11005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:51,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10532 states to 10532 states and 11005 transitions. [2025-01-09 00:09:51,547 INFO L78 Accepts]: Start accepts. Automaton has 10532 states and 11005 transitions. Word has length 1281 [2025-01-09 00:09:51,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:09:51,548 INFO L471 AbstractCegarLoop]: Abstraction has 10532 states and 11005 transitions. [2025-01-09 00:09:51,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:51,548 INFO L276 IsEmpty]: Start isEmpty. Operand 10532 states and 11005 transitions. [2025-01-09 00:09:51,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1300 [2025-01-09 00:09:51,565 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:09:51,565 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:09:51,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 00:09:51,565 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:09:51,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:09:51,567 INFO L85 PathProgramCache]: Analyzing trace with hash -920001255, now seen corresponding path program 1 times [2025-01-09 00:09:51,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:09:51,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186686721] [2025-01-09 00:09:51,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:09:51,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:09:51,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1299 statements into 1 equivalence classes. [2025-01-09 00:09:51,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1299 of 1299 statements. [2025-01-09 00:09:51,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:09:51,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:09:52,598 INFO L134 CoverageAnalysis]: Checked inductivity of 3031 backedges. 384 proven. 0 refuted. 0 times theorem prover too weak. 2647 trivial. 0 not checked. [2025-01-09 00:09:52,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:09:52,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186686721] [2025-01-09 00:09:52,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186686721] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:09:52,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:09:52,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 00:09:52,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52444212] [2025-01-09 00:09:52,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:09:52,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 00:09:52,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:09:52,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 00:09:52,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:09:52,602 INFO L87 Difference]: Start difference. First operand 10532 states and 11005 transitions. Second operand has 6 states, 6 states have (on average 58.5) internal successors, (351), 6 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:53,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:09:53,444 INFO L93 Difference]: Finished difference Result 20461 states and 21391 transitions. [2025-01-09 00:09:53,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 00:09:53,445 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 58.5) internal successors, (351), 6 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1299 [2025-01-09 00:09:53,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:09:53,446 INFO L225 Difference]: With dead ends: 20461 [2025-01-09 00:09:53,446 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 00:09:53,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:09:53,458 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 33 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:09:53,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 451 Invalid, 949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 946 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 00:09:53,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 00:09:53,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 00:09:53,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:53,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 00:09:53,459 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1299 [2025-01-09 00:09:53,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:09:53,459 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 00:09:53,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 58.5) internal successors, (351), 6 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:53,460 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 00:09:53,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 00:09:53,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 00:09:53,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 00:09:53,465 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:09:53,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 00:09:53,760 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 00:09:53,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 12:09:53 BoogieIcfgContainer [2025-01-09 00:09:53,779 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 00:09:53,780 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 00:09:53,780 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 00:09:53,780 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 00:09:53,781 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:09:36" (3/4) ... [2025-01-09 00:09:53,783 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 00:09:53,812 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-01-09 00:09:53,813 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-09 00:09:53,815 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 00:09:53,816 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 00:09:53,989 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 00:09:53,990 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 00:09:53,990 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 00:09:53,990 INFO L158 Benchmark]: Toolchain (without parser) took 20497.82ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 973.1MB). Free memory was 110.3MB in the beginning and 640.8MB in the end (delta: -530.5MB). Peak memory consumption was 438.6MB. Max. memory is 16.1GB. [2025-01-09 00:09:53,991 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 00:09:53,991 INFO L158 Benchmark]: CACSL2BoogieTranslator took 631.93ms. Allocated memory is still 142.6MB. Free memory was 109.2MB in the beginning and 52.0MB in the end (delta: 57.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-01-09 00:09:53,991 INFO L158 Benchmark]: Boogie Procedure Inliner took 199.71ms. Allocated memory is still 142.6MB. Free memory was 52.0MB in the beginning and 92.8MB in the end (delta: -40.8MB). Peak memory consumption was 28.7MB. Max. memory is 16.1GB. [2025-01-09 00:09:53,991 INFO L158 Benchmark]: Boogie Preprocessor took 208.08ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 58.2MB in the end (delta: 34.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 00:09:53,991 INFO L158 Benchmark]: RCFGBuilder took 1788.87ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 58.2MB in the beginning and 124.3MB in the end (delta: -66.1MB). Peak memory consumption was 106.1MB. Max. memory is 16.1GB. [2025-01-09 00:09:53,991 INFO L158 Benchmark]: TraceAbstraction took 17452.05ms. Allocated memory was 302.0MB in the beginning and 1.1GB in the end (delta: 813.7MB). Free memory was 123.3MB in the beginning and 665.6MB in the end (delta: -542.4MB). Peak memory consumption was 271.8MB. Max. memory is 16.1GB. [2025-01-09 00:09:53,992 INFO L158 Benchmark]: Witness Printer took 209.70ms. Allocated memory is still 1.1GB. Free memory was 665.6MB in the beginning and 640.8MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 00:09:53,993 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 631.93ms. Allocated memory is still 142.6MB. Free memory was 109.2MB in the beginning and 52.0MB in the end (delta: 57.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 199.71ms. Allocated memory is still 142.6MB. Free memory was 52.0MB in the beginning and 92.8MB in the end (delta: -40.8MB). Peak memory consumption was 28.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 208.08ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 58.2MB in the end (delta: 34.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1788.87ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 58.2MB in the beginning and 124.3MB in the end (delta: -66.1MB). Peak memory consumption was 106.1MB. Max. memory is 16.1GB. * TraceAbstraction took 17452.05ms. Allocated memory was 302.0MB in the beginning and 1.1GB in the end (delta: 813.7MB). Free memory was 123.3MB in the beginning and 665.6MB in the end (delta: -542.4MB). Peak memory consumption was 271.8MB. Max. memory is 16.1GB. * Witness Printer took 209.70ms. Allocated memory is still 1.1GB. Free memory was 665.6MB in the beginning and 640.8MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 188]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 396 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.1s, OverallIterations: 10, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 10.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3232 SdHoareTripleChecker+Valid, 10.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3232 mSDsluCounter, 2818 SdHoareTripleChecker+Invalid, 8.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 72 mSDsCounter, 2282 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9191 IncrementalHoareTripleChecker+Invalid, 11473 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2282 mSolverCounterUnsat, 2746 mSDtfsCounter, 9191 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10532occurred in iteration=9, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 10 MinimizatonAttempts, 3290 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 5869 NumberOfCodeBlocks, 5869 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 5859 ConstructedInterpolants, 0 QuantifiedInterpolants, 9656 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 11060/11060 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1783]: Loop Invariant Derived loop invariant: (((((((a12 == 6) && (a16 <= 11)) || ((a16 != 10) && (a15 <= 3))) || ((0 <= ((long long) 87 + a18)) && (a15 <= 3))) || ((a12 == 8) && (a15 == 3))) || ((a12 <= 5) && (a16 <= 11))) || ((a16 != 10) && (a16 <= 11))) RESULT: Ultimate proved your program to be correct! [2025-01-09 00:09:54,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE