./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label57.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/Problem11_label57.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 ab973685a1b1efc862bdc104a7ab81fdba6d1304eec57508bfc6ec40b5ec7e50 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 23:43:25,904 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 23:43:25,940 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 23:43:25,944 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 23:43:25,944 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 23:43:25,959 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 23:43:25,960 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 23:43:25,960 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 23:43:25,960 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 23:43:25,960 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 23:43:25,960 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 23:43:25,960 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 23:43:25,960 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 23:43:25,960 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 23:43:25,960 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 23:43:25,960 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 23:43:25,961 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 23:43:25,961 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 23:43:25,961 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 23:43:25,961 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 23:43:25,961 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 23:43:25,961 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 23:43:25,961 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 23:43:25,961 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 23:43:25,961 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 23:43:25,961 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 23:43:25,961 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 23:43:25,961 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 23:43:25,961 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 23:43:25,961 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:43:25,961 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:43:25,961 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:43:25,961 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:43:25,961 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 23:43:25,962 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:43:25,962 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:43:25,962 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:43:25,962 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:43:25,962 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 23:43:25,962 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 23:43:25,962 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 23:43:25,962 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 23:43:25,962 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 23:43:25,962 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 23:43:25,962 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 23:43:25,962 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 23:43:25,962 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 23:43:25,962 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 23:43:25,962 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 -> ab973685a1b1efc862bdc104a7ab81fdba6d1304eec57508bfc6ec40b5ec7e50 [2025-01-08 23:43:26,191 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 23:43:26,196 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 23:43:26,198 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 23:43:26,199 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 23:43:26,199 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 23:43:26,200 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label57.c [2025-01-08 23:43:27,364 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/339a149a6/dd5d7dde25a54633a28f2a87b494e3d5/FLAG7aa4f513e [2025-01-08 23:43:27,748 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 23:43:27,750 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label57.c [2025-01-08 23:43:27,765 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/339a149a6/dd5d7dde25a54633a28f2a87b494e3d5/FLAG7aa4f513e [2025-01-08 23:43:27,941 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/339a149a6/dd5d7dde25a54633a28f2a87b494e3d5 [2025-01-08 23:43:27,942 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 23:43:27,943 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 23:43:27,944 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 23:43:27,944 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 23:43:27,947 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 23:43:27,948 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:43:27" (1/1) ... [2025-01-08 23:43:27,948 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b59d556 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:43:27, skipping insertion in model container [2025-01-08 23:43:27,948 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:43:27" (1/1) ... [2025-01-08 23:43:27,976 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 23:43:28,141 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/Problem11_label57.c[6683,6696] [2025-01-08 23:43:28,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:43:28,355 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 23:43:28,371 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/Problem11_label57.c[6683,6696] [2025-01-08 23:43:28,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:43:28,462 INFO L204 MainTranslator]: Completed translation [2025-01-08 23:43:28,463 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:43:28 WrapperNode [2025-01-08 23:43:28,463 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 23:43:28,464 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 23:43:28,464 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 23:43:28,464 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 23:43:28,469 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:43:28" (1/1) ... [2025-01-08 23:43:28,483 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:43:28" (1/1) ... [2025-01-08 23:43:28,547 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 997 [2025-01-08 23:43:28,548 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 23:43:28,548 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 23:43:28,549 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 23:43:28,549 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 23:43:28,555 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:43:28" (1/1) ... [2025-01-08 23:43:28,556 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:43:28" (1/1) ... [2025-01-08 23:43:28,572 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:43:28" (1/1) ... [2025-01-08 23:43:28,624 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-08 23:43:28,624 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:43:28" (1/1) ... [2025-01-08 23:43:28,625 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:43:28" (1/1) ... [2025-01-08 23:43:28,648 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:43:28" (1/1) ... [2025-01-08 23:43:28,653 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:43:28" (1/1) ... [2025-01-08 23:43:28,660 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:43:28" (1/1) ... [2025-01-08 23:43:28,666 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:43:28" (1/1) ... [2025-01-08 23:43:28,672 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:43:28" (1/1) ... [2025-01-08 23:43:28,683 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 23:43:28,684 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 23:43:28,684 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 23:43:28,684 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 23:43:28,685 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:43:28" (1/1) ... [2025-01-08 23:43:28,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:43:28,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:43:28,717 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-08 23:43:28,724 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-08 23:43:28,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 23:43:28,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 23:43:28,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 23:43:28,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 23:43:28,799 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 23:43:28,800 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 23:43:29,976 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-01-08 23:43:29,977 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 23:43:29,987 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 23:43:29,987 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 23:43:29,988 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:43:29 BoogieIcfgContainer [2025-01-08 23:43:29,988 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 23:43:29,989 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 23:43:29,989 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 23:43:29,992 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 23:43:29,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 11:43:27" (1/3) ... [2025-01-08 23:43:29,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6466e8d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:43:29, skipping insertion in model container [2025-01-08 23:43:29,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:43:28" (2/3) ... [2025-01-08 23:43:29,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6466e8d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:43:29, skipping insertion in model container [2025-01-08 23:43:29,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:43:29" (3/3) ... [2025-01-08 23:43:29,994 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem11_label57.c [2025-01-08 23:43:30,004 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 23:43:30,006 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem11_label57.c that has 1 procedures, 283 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 23:43:30,041 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 23:43:30,048 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;@2dbdb493, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 23:43:30,048 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 23:43:30,052 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 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-08 23:43:30,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-08 23:43:30,056 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:30,056 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] [2025-01-08 23:43:30,057 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:30,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:30,060 INFO L85 PathProgramCache]: Analyzing trace with hash 2006201642, now seen corresponding path program 1 times [2025-01-08 23:43:30,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:30,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785131004] [2025-01-08 23:43:30,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:30,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:30,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-08 23:43:30,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-08 23:43:30,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:30,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:30,300 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-08 23:43:30,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:30,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785131004] [2025-01-08 23:43:30,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785131004] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:30,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:30,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:43:30,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937133985] [2025-01-08 23:43:30,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:30,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:43:30,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:30,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:43:30,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:30,337 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 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 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 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-08 23:43:31,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:31,189 INFO L93 Difference]: Finished difference Result 776 states and 1360 transitions. [2025-01-08 23:43:31,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:43:31,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 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 46 [2025-01-08 23:43:31,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:31,198 INFO L225 Difference]: With dead ends: 776 [2025-01-08 23:43:31,199 INFO L226 Difference]: Without dead ends: 413 [2025-01-08 23:43:31,201 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-08 23:43:31,204 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 181 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:31,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 197 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 23:43:31,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-01-08 23:43:31,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 411. [2025-01-08 23:43:31,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 410 states have (on average 1.4585365853658536) internal successors, (598), 410 states have internal predecessors, (598), 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-08 23:43:31,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 598 transitions. [2025-01-08 23:43:31,254 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 598 transitions. Word has length 46 [2025-01-08 23:43:31,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:31,254 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 598 transitions. [2025-01-08 23:43:31,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 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-08 23:43:31,255 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 598 transitions. [2025-01-08 23:43:31,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-08 23:43:31,257 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:31,257 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, 1, 1, 1, 1, 1, 1, 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-08 23:43:31,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 23:43:31,262 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:31,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:31,262 INFO L85 PathProgramCache]: Analyzing trace with hash 463029826, now seen corresponding path program 1 times [2025-01-08 23:43:31,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:31,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962872282] [2025-01-08 23:43:31,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:31,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:31,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-08 23:43:31,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-08 23:43:31,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:31,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:31,597 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:43:31,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:31,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962872282] [2025-01-08 23:43:31,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962872282] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:31,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:31,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:43:31,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276888188] [2025-01-08 23:43:31,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:31,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:43:31,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:31,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:43:31,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:31,600 INFO L87 Difference]: Start difference. First operand 411 states and 598 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 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-08 23:43:32,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:32,238 INFO L93 Difference]: Finished difference Result 1209 states and 1765 transitions. [2025-01-08 23:43:32,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:43:32,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 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 114 [2025-01-08 23:43:32,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:32,242 INFO L225 Difference]: With dead ends: 1209 [2025-01-08 23:43:32,242 INFO L226 Difference]: Without dead ends: 800 [2025-01-08 23:43:32,243 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-08 23:43:32,243 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 142 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:32,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 123 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:43:32,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2025-01-08 23:43:32,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 787. [2025-01-08 23:43:32,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 786 states have (on average 1.3842239185750635) internal successors, (1088), 786 states have internal predecessors, (1088), 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-08 23:43:32,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1088 transitions. [2025-01-08 23:43:32,278 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1088 transitions. Word has length 114 [2025-01-08 23:43:32,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:32,279 INFO L471 AbstractCegarLoop]: Abstraction has 787 states and 1088 transitions. [2025-01-08 23:43:32,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 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-08 23:43:32,279 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1088 transitions. [2025-01-08 23:43:32,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-08 23:43:32,282 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:32,283 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:43:32,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 23:43:32,283 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:32,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:32,283 INFO L85 PathProgramCache]: Analyzing trace with hash -2128715267, now seen corresponding path program 1 times [2025-01-08 23:43:32,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:32,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854824833] [2025-01-08 23:43:32,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:32,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:32,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-08 23:43:32,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-08 23:43:32,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:32,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:32,530 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:43:32,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:32,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854824833] [2025-01-08 23:43:32,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854824833] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:32,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:32,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:43:32,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860250502] [2025-01-08 23:43:32,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:32,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:43:32,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:32,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:43:32,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:32,534 INFO L87 Difference]: Start difference. First operand 787 states and 1088 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 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-08 23:43:33,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:33,080 INFO L93 Difference]: Finished difference Result 1941 states and 2628 transitions. [2025-01-08 23:43:33,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:43:33,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 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 116 [2025-01-08 23:43:33,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:33,084 INFO L225 Difference]: With dead ends: 1941 [2025-01-08 23:43:33,084 INFO L226 Difference]: Without dead ends: 1156 [2025-01-08 23:43:33,085 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-08 23:43:33,086 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 119 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:33,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 193 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:43:33,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2025-01-08 23:43:33,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 1156. [2025-01-08 23:43:33,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 1155 states have (on average 1.277056277056277) internal successors, (1475), 1155 states have internal predecessors, (1475), 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-08 23:43:33,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1475 transitions. [2025-01-08 23:43:33,122 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1475 transitions. Word has length 116 [2025-01-08 23:43:33,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:33,122 INFO L471 AbstractCegarLoop]: Abstraction has 1156 states and 1475 transitions. [2025-01-08 23:43:33,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 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-08 23:43:33,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1475 transitions. [2025-01-08 23:43:33,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-01-08 23:43:33,123 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:33,124 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:43:33,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 23:43:33,124 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:33,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:33,124 INFO L85 PathProgramCache]: Analyzing trace with hash 93370438, now seen corresponding path program 1 times [2025-01-08 23:43:33,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:33,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749135797] [2025-01-08 23:43:33,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:33,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:33,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-01-08 23:43:33,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-01-08 23:43:33,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:33,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:33,329 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-08 23:43:33,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:33,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749135797] [2025-01-08 23:43:33,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749135797] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:33,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:33,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:43:33,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049753463] [2025-01-08 23:43:33,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:33,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:43:33,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:33,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:43:33,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:33,336 INFO L87 Difference]: Start difference. First operand 1156 states and 1475 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 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-08 23:43:33,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:33,940 INFO L93 Difference]: Finished difference Result 3056 states and 3914 transitions. [2025-01-08 23:43:33,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:43:33,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 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 158 [2025-01-08 23:43:33,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:33,946 INFO L225 Difference]: With dead ends: 3056 [2025-01-08 23:43:33,946 INFO L226 Difference]: Without dead ends: 1902 [2025-01-08 23:43:33,947 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-08 23:43:33,948 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 108 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:33,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 157 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:43:33,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1902 states. [2025-01-08 23:43:33,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1902 to 1901. [2025-01-08 23:43:33,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1901 states, 1900 states have (on average 1.22) internal successors, (2318), 1900 states have internal predecessors, (2318), 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-08 23:43:33,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1901 states to 1901 states and 2318 transitions. [2025-01-08 23:43:33,971 INFO L78 Accepts]: Start accepts. Automaton has 1901 states and 2318 transitions. Word has length 158 [2025-01-08 23:43:33,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:33,971 INFO L471 AbstractCegarLoop]: Abstraction has 1901 states and 2318 transitions. [2025-01-08 23:43:33,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 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-08 23:43:33,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1901 states and 2318 transitions. [2025-01-08 23:43:33,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-01-08 23:43:33,973 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:33,973 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:43:33,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 23:43:33,973 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:33,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:33,974 INFO L85 PathProgramCache]: Analyzing trace with hash -934409222, now seen corresponding path program 1 times [2025-01-08 23:43:33,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:33,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185741501] [2025-01-08 23:43:33,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:33,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:33,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-01-08 23:43:34,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-01-08 23:43:34,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:34,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:34,125 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:43:34,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:34,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185741501] [2025-01-08 23:43:34,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185741501] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:34,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:34,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:43:34,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110515853] [2025-01-08 23:43:34,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:34,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:43:34,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:34,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:43:34,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:43:34,127 INFO L87 Difference]: Start difference. First operand 1901 states and 2318 transitions. Second operand has 4 states, 4 states have (on average 43.25) internal successors, (173), 3 states have internal predecessors, (173), 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-08 23:43:35,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:35,063 INFO L93 Difference]: Finished difference Result 5670 states and 7167 transitions. [2025-01-08 23:43:35,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:43:35,063 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 3 states have internal predecessors, (173), 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 173 [2025-01-08 23:43:35,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:35,073 INFO L225 Difference]: With dead ends: 5670 [2025-01-08 23:43:35,074 INFO L226 Difference]: Without dead ends: 3955 [2025-01-08 23:43:35,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:43:35,076 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 349 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 1056 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 1056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:35,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 84 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 1056 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-08 23:43:35,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3955 states. [2025-01-08 23:43:35,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3955 to 3954. [2025-01-08 23:43:35,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3954 states, 3953 states have (on average 1.2347584113331647) internal successors, (4881), 3953 states have internal predecessors, (4881), 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-08 23:43:35,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3954 states to 3954 states and 4881 transitions. [2025-01-08 23:43:35,129 INFO L78 Accepts]: Start accepts. Automaton has 3954 states and 4881 transitions. Word has length 173 [2025-01-08 23:43:35,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:35,129 INFO L471 AbstractCegarLoop]: Abstraction has 3954 states and 4881 transitions. [2025-01-08 23:43:35,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 3 states have internal predecessors, (173), 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-08 23:43:35,130 INFO L276 IsEmpty]: Start isEmpty. Operand 3954 states and 4881 transitions. [2025-01-08 23:43:35,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-01-08 23:43:35,154 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:35,154 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, 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, 1, 1, 1, 1, 1] [2025-01-08 23:43:35,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 23:43:35,155 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:35,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:35,155 INFO L85 PathProgramCache]: Analyzing trace with hash -140754919, now seen corresponding path program 1 times [2025-01-08 23:43:35,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:35,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603253612] [2025-01-08 23:43:35,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:35,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:35,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-01-08 23:43:35,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-01-08 23:43:35,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:35,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:35,367 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-01-08 23:43:35,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:35,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603253612] [2025-01-08 23:43:35,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603253612] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:35,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:35,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:43:35,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158352321] [2025-01-08 23:43:35,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:35,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:43:35,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:35,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:43:35,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:35,369 INFO L87 Difference]: Start difference. First operand 3954 states and 4881 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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-08 23:43:36,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:36,014 INFO L93 Difference]: Finished difference Result 8839 states and 11143 transitions. [2025-01-08 23:43:36,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:43:36,015 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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 228 [2025-01-08 23:43:36,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:36,027 INFO L225 Difference]: With dead ends: 8839 [2025-01-08 23:43:36,028 INFO L226 Difference]: Without dead ends: 5255 [2025-01-08 23:43:36,030 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-08 23:43:36,031 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 151 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:36,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 392 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:43:36,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5255 states. [2025-01-08 23:43:36,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5255 to 5243. [2025-01-08 23:43:36,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5243 states, 5242 states have (on average 1.21365890881343) internal successors, (6362), 5242 states have internal predecessors, (6362), 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-08 23:43:36,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5243 states to 5243 states and 6362 transitions. [2025-01-08 23:43:36,093 INFO L78 Accepts]: Start accepts. Automaton has 5243 states and 6362 transitions. Word has length 228 [2025-01-08 23:43:36,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:36,094 INFO L471 AbstractCegarLoop]: Abstraction has 5243 states and 6362 transitions. [2025-01-08 23:43:36,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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-08 23:43:36,094 INFO L276 IsEmpty]: Start isEmpty. Operand 5243 states and 6362 transitions. [2025-01-08 23:43:36,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-01-08 23:43:36,096 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:36,096 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, 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] [2025-01-08 23:43:36,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 23:43:36,097 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:36,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:36,097 INFO L85 PathProgramCache]: Analyzing trace with hash -99768758, now seen corresponding path program 1 times [2025-01-08 23:43:36,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:36,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457376368] [2025-01-08 23:43:36,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:36,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:36,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-01-08 23:43:36,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-01-08 23:43:36,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:36,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:36,228 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-01-08 23:43:36,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:36,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457376368] [2025-01-08 23:43:36,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457376368] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:36,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:36,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:43:36,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353254536] [2025-01-08 23:43:36,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:36,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:43:36,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:36,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:43:36,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:36,229 INFO L87 Difference]: Start difference. First operand 5243 states and 6362 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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-08 23:43:36,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:36,850 INFO L93 Difference]: Finished difference Result 12509 states and 15499 transitions. [2025-01-08 23:43:36,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:43:36,850 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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 234 [2025-01-08 23:43:36,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:36,868 INFO L225 Difference]: With dead ends: 12509 [2025-01-08 23:43:36,868 INFO L226 Difference]: Without dead ends: 7636 [2025-01-08 23:43:36,873 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-08 23:43:36,874 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 165 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:36,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 148 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:43:36,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7636 states. [2025-01-08 23:43:36,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7636 to 7636. [2025-01-08 23:43:36,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7636 states, 7635 states have (on average 1.2158480681074002) internal successors, (9283), 7635 states have internal predecessors, (9283), 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-08 23:43:36,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7636 states to 7636 states and 9283 transitions. [2025-01-08 23:43:36,963 INFO L78 Accepts]: Start accepts. Automaton has 7636 states and 9283 transitions. Word has length 234 [2025-01-08 23:43:36,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:36,963 INFO L471 AbstractCegarLoop]: Abstraction has 7636 states and 9283 transitions. [2025-01-08 23:43:36,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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-08 23:43:36,964 INFO L276 IsEmpty]: Start isEmpty. Operand 7636 states and 9283 transitions. [2025-01-08 23:43:36,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-01-08 23:43:36,967 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:36,967 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, 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] [2025-01-08 23:43:36,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 23:43:36,967 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:36,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:36,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1471843510, now seen corresponding path program 1 times [2025-01-08 23:43:36,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:36,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149268657] [2025-01-08 23:43:36,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:36,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:36,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-01-08 23:43:37,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-01-08 23:43:37,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:37,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:37,175 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-01-08 23:43:37,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:37,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149268657] [2025-01-08 23:43:37,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149268657] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:37,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:37,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:43:37,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028766288] [2025-01-08 23:43:37,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:37,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:43:37,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:37,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:43:37,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:37,176 INFO L87 Difference]: Start difference. First operand 7636 states and 9283 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 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-08 23:43:37,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:37,861 INFO L93 Difference]: Finished difference Result 17671 states and 21762 transitions. [2025-01-08 23:43:37,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:43:37,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 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 265 [2025-01-08 23:43:37,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:37,883 INFO L225 Difference]: With dead ends: 17671 [2025-01-08 23:43:37,883 INFO L226 Difference]: Without dead ends: 10221 [2025-01-08 23:43:37,894 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-08 23:43:37,894 INFO L435 NwaCegarLoop]: 369 mSDtfsCounter, 150 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:37,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 391 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:43:37,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10221 states. [2025-01-08 23:43:37,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10221 to 10212. [2025-01-08 23:43:38,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10212 states, 10211 states have (on average 1.197042405249241) internal successors, (12223), 10211 states have internal predecessors, (12223), 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-08 23:43:38,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10212 states to 10212 states and 12223 transitions. [2025-01-08 23:43:38,016 INFO L78 Accepts]: Start accepts. Automaton has 10212 states and 12223 transitions. Word has length 265 [2025-01-08 23:43:38,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:38,017 INFO L471 AbstractCegarLoop]: Abstraction has 10212 states and 12223 transitions. [2025-01-08 23:43:38,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 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-08 23:43:38,017 INFO L276 IsEmpty]: Start isEmpty. Operand 10212 states and 12223 transitions. [2025-01-08 23:43:38,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2025-01-08 23:43:38,022 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:38,022 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, 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] [2025-01-08 23:43:38,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 23:43:38,023 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:38,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:38,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1708837841, now seen corresponding path program 1 times [2025-01-08 23:43:38,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:38,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294330433] [2025-01-08 23:43:38,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:38,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:38,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-01-08 23:43:38,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-01-08 23:43:38,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:38,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:38,515 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:43:38,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:38,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294330433] [2025-01-08 23:43:38,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294330433] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:38,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:38,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 23:43:38,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254501778] [2025-01-08 23:43:38,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:38,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 23:43:38,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:38,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 23:43:38,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:43:38,519 INFO L87 Difference]: Start difference. First operand 10212 states and 12223 transitions. Second operand has 5 states, 5 states have (on average 57.4) internal successors, (287), 4 states have internal predecessors, (287), 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-08 23:43:39,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:39,581 INFO L93 Difference]: Finished difference Result 21579 states and 25803 transitions. [2025-01-08 23:43:39,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-08 23:43:39,582 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 57.4) internal successors, (287), 4 states have internal predecessors, (287), 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 287 [2025-01-08 23:43:39,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:39,606 INFO L225 Difference]: With dead ends: 21579 [2025-01-08 23:43:39,607 INFO L226 Difference]: Without dead ends: 11737 [2025-01-08 23:43:39,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:43:39,619 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 238 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1346 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 1534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 1346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:39,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 157 Invalid, 1534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 1346 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-08 23:43:39,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11737 states. [2025-01-08 23:43:39,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11737 to 11683. [2025-01-08 23:43:39,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11683 states, 11682 states have (on average 1.182331792501284) internal successors, (13812), 11682 states have internal predecessors, (13812), 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-08 23:43:39,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11683 states to 11683 states and 13812 transitions. [2025-01-08 23:43:39,786 INFO L78 Accepts]: Start accepts. Automaton has 11683 states and 13812 transitions. Word has length 287 [2025-01-08 23:43:39,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:39,787 INFO L471 AbstractCegarLoop]: Abstraction has 11683 states and 13812 transitions. [2025-01-08 23:43:39,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.4) internal successors, (287), 4 states have internal predecessors, (287), 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-08 23:43:39,787 INFO L276 IsEmpty]: Start isEmpty. Operand 11683 states and 13812 transitions. [2025-01-08 23:43:39,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2025-01-08 23:43:39,792 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:39,792 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, 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] [2025-01-08 23:43:39,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 23:43:39,792 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:39,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:39,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1439977404, now seen corresponding path program 1 times [2025-01-08 23:43:39,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:39,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851164159] [2025-01-08 23:43:39,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:39,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:39,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-01-08 23:43:39,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-01-08 23:43:39,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:39,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:39,922 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-01-08 23:43:39,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:39,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851164159] [2025-01-08 23:43:39,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851164159] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:39,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:39,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:43:39,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723971857] [2025-01-08 23:43:39,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:39,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:43:39,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:39,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:43:39,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:39,923 INFO L87 Difference]: Start difference. First operand 11683 states and 13812 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 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-08 23:43:40,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:40,554 INFO L93 Difference]: Finished difference Result 24280 states and 29242 transitions. [2025-01-08 23:43:40,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:43:40,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 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 292 [2025-01-08 23:43:40,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:40,578 INFO L225 Difference]: With dead ends: 24280 [2025-01-08 23:43:40,578 INFO L226 Difference]: Without dead ends: 14257 [2025-01-08 23:43:40,588 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-08 23:43:40,589 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 181 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:40,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 323 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:43:40,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14257 states. [2025-01-08 23:43:40,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14257 to 14072. [2025-01-08 23:43:40,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14072 states, 14071 states have (on average 1.1881884727453629) internal successors, (16719), 14071 states have internal predecessors, (16719), 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-08 23:43:40,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14072 states to 14072 states and 16719 transitions. [2025-01-08 23:43:40,773 INFO L78 Accepts]: Start accepts. Automaton has 14072 states and 16719 transitions. Word has length 292 [2025-01-08 23:43:40,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:40,773 INFO L471 AbstractCegarLoop]: Abstraction has 14072 states and 16719 transitions. [2025-01-08 23:43:40,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 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-08 23:43:40,774 INFO L276 IsEmpty]: Start isEmpty. Operand 14072 states and 16719 transitions. [2025-01-08 23:43:40,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-01-08 23:43:40,782 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:40,782 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:43:40,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-08 23:43:40,783 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:40,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:40,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1391396691, now seen corresponding path program 1 times [2025-01-08 23:43:40,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:40,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098428505] [2025-01-08 23:43:40,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:40,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:40,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-01-08 23:43:40,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-01-08 23:43:40,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:40,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:40,955 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2025-01-08 23:43:40,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:40,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098428505] [2025-01-08 23:43:40,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098428505] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:40,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:40,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:43:40,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531090478] [2025-01-08 23:43:40,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:40,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:43:40,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:40,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:43:40,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:40,958 INFO L87 Difference]: Start difference. First operand 14072 states and 16719 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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-08 23:43:41,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:41,644 INFO L93 Difference]: Finished difference Result 30723 states and 36790 transitions. [2025-01-08 23:43:41,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:43:41,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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 311 [2025-01-08 23:43:41,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:41,665 INFO L225 Difference]: With dead ends: 30723 [2025-01-08 23:43:41,666 INFO L226 Difference]: Without dead ends: 17021 [2025-01-08 23:43:41,672 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-08 23:43:41,673 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 178 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:41,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 90 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:43:41,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17021 states. [2025-01-08 23:43:41,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17021 to 17016. [2025-01-08 23:43:41,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17016 states, 17015 states have (on average 1.1908316191595651) internal successors, (20262), 17015 states have internal predecessors, (20262), 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-08 23:43:41,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17016 states to 17016 states and 20262 transitions. [2025-01-08 23:43:41,801 INFO L78 Accepts]: Start accepts. Automaton has 17016 states and 20262 transitions. Word has length 311 [2025-01-08 23:43:41,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:41,801 INFO L471 AbstractCegarLoop]: Abstraction has 17016 states and 20262 transitions. [2025-01-08 23:43:41,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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-08 23:43:41,801 INFO L276 IsEmpty]: Start isEmpty. Operand 17016 states and 20262 transitions. [2025-01-08 23:43:41,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2025-01-08 23:43:41,811 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:41,811 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, 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] [2025-01-08 23:43:41,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-08 23:43:41,812 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:41,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:41,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1703057715, now seen corresponding path program 1 times [2025-01-08 23:43:41,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:41,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687332463] [2025-01-08 23:43:41,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:41,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:41,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes. [2025-01-08 23:43:41,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements. [2025-01-08 23:43:41,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:41,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:42,111 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 229 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:43:42,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:42,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687332463] [2025-01-08 23:43:42,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687332463] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:42,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:42,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 23:43:42,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863658629] [2025-01-08 23:43:42,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:42,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:43:42,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:42,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:43:42,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:43:42,113 INFO L87 Difference]: Start difference. First operand 17016 states and 20262 transitions. Second operand has 4 states, 4 states have (on average 87.75) internal successors, (351), 4 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-08 23:43:43,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:43,377 INFO L93 Difference]: Finished difference Result 37361 states and 45096 transitions. [2025-01-08 23:43:43,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:43:43,378 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 87.75) internal successors, (351), 4 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 351 [2025-01-08 23:43:43,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:43,436 INFO L225 Difference]: With dead ends: 37361 [2025-01-08 23:43:43,439 INFO L226 Difference]: Without dead ends: 22373 [2025-01-08 23:43:43,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:43:43,471 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 244 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 1110 mSolverCounterSat, 311 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 1421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Valid, 1110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:43,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 68 Invalid, 1421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [311 Valid, 1110 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-08 23:43:43,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22373 states. [2025-01-08 23:43:43,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22373 to 19226. [2025-01-08 23:43:43,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19226 states, 19225 states have (on average 1.196410923276983) internal successors, (23001), 19225 states have internal predecessors, (23001), 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-08 23:43:43,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19226 states to 19226 states and 23001 transitions. [2025-01-08 23:43:43,705 INFO L78 Accepts]: Start accepts. Automaton has 19226 states and 23001 transitions. Word has length 351 [2025-01-08 23:43:43,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:43,706 INFO L471 AbstractCegarLoop]: Abstraction has 19226 states and 23001 transitions. [2025-01-08 23:43:43,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 87.75) internal successors, (351), 4 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-08 23:43:43,707 INFO L276 IsEmpty]: Start isEmpty. Operand 19226 states and 23001 transitions. [2025-01-08 23:43:43,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2025-01-08 23:43:43,722 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:43,722 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:43:43,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-08 23:43:43,723 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:43,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:43,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1605061350, now seen corresponding path program 1 times [2025-01-08 23:43:43,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:43,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046815962] [2025-01-08 23:43:43,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:43,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:43,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 425 statements into 1 equivalence classes. [2025-01-08 23:43:43,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 425 of 425 statements. [2025-01-08 23:43:43,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:43,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:44,046 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 347 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-01-08 23:43:44,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:44,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046815962] [2025-01-08 23:43:44,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046815962] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:44,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:44,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 23:43:44,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851156454] [2025-01-08 23:43:44,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:44,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:43:44,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:44,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:43:44,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:43:44,048 INFO L87 Difference]: Start difference. First operand 19226 states and 23001 transitions. Second operand has 4 states, 4 states have (on average 80.5) internal successors, (322), 4 states have internal predecessors, (322), 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-08 23:43:45,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:45,217 INFO L93 Difference]: Finished difference Result 39939 states and 48317 transitions. [2025-01-08 23:43:45,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:43:45,218 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 80.5) internal successors, (322), 4 states have internal predecessors, (322), 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 425 [2025-01-08 23:43:45,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:45,245 INFO L225 Difference]: With dead ends: 39939 [2025-01-08 23:43:45,245 INFO L226 Difference]: Without dead ends: 22557 [2025-01-08 23:43:45,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:43:45,257 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 243 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1119 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 1405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 1119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:45,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 69 Invalid, 1405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 1119 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-08 23:43:45,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22557 states. [2025-01-08 23:43:45,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22557 to 18490. [2025-01-08 23:43:45,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18490 states, 18489 states have (on average 1.198388230839959) internal successors, (22157), 18489 states have internal predecessors, (22157), 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-08 23:43:45,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18490 states to 18490 states and 22157 transitions. [2025-01-08 23:43:45,513 INFO L78 Accepts]: Start accepts. Automaton has 18490 states and 22157 transitions. Word has length 425 [2025-01-08 23:43:45,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:45,513 INFO L471 AbstractCegarLoop]: Abstraction has 18490 states and 22157 transitions. [2025-01-08 23:43:45,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.5) internal successors, (322), 4 states have internal predecessors, (322), 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-08 23:43:45,514 INFO L276 IsEmpty]: Start isEmpty. Operand 18490 states and 22157 transitions. [2025-01-08 23:43:45,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2025-01-08 23:43:45,561 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:45,565 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:43:45,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-08 23:43:45,565 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:45,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:45,566 INFO L85 PathProgramCache]: Analyzing trace with hash -598201794, now seen corresponding path program 1 times [2025-01-08 23:43:45,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:45,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911139464] [2025-01-08 23:43:45,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:45,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:45,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 598 statements into 1 equivalence classes. [2025-01-08 23:43:45,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 598 of 598 statements. [2025-01-08 23:43:45,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:45,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:46,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1060 backedges. 835 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2025-01-08 23:43:46,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:46,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911139464] [2025-01-08 23:43:46,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911139464] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:46,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:46,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:43:46,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82920024] [2025-01-08 23:43:46,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:46,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:43:46,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:46,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:43:46,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:46,074 INFO L87 Difference]: Start difference. First operand 18490 states and 22157 transitions. Second operand has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 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-08 23:43:46,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:46,685 INFO L93 Difference]: Finished difference Result 33650 states and 40465 transitions. [2025-01-08 23:43:46,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:43:46,685 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 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 598 [2025-01-08 23:43:46,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:46,704 INFO L225 Difference]: With dead ends: 33650 [2025-01-08 23:43:46,704 INFO L226 Difference]: Without dead ends: 17004 [2025-01-08 23:43:46,715 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-08 23:43:46,715 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 100 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:46,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 138 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:43:46,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17004 states. [2025-01-08 23:43:46,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17004 to 16449. [2025-01-08 23:43:46,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16449 states, 16448 states have (on average 1.1321741245136188) internal successors, (18622), 16448 states have internal predecessors, (18622), 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-08 23:43:46,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16449 states to 16449 states and 18622 transitions. [2025-01-08 23:43:46,841 INFO L78 Accepts]: Start accepts. Automaton has 16449 states and 18622 transitions. Word has length 598 [2025-01-08 23:43:46,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:46,842 INFO L471 AbstractCegarLoop]: Abstraction has 16449 states and 18622 transitions. [2025-01-08 23:43:46,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 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-08 23:43:46,842 INFO L276 IsEmpty]: Start isEmpty. Operand 16449 states and 18622 transitions. [2025-01-08 23:43:46,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 690 [2025-01-08 23:43:46,906 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:46,907 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, 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, 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, 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] [2025-01-08 23:43:46,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-08 23:43:46,907 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:46,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:46,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1529151654, now seen corresponding path program 1 times [2025-01-08 23:43:46,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:46,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429257294] [2025-01-08 23:43:46,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:46,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:46,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 689 statements into 1 equivalence classes. [2025-01-08 23:43:46,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 689 of 689 statements. [2025-01-08 23:43:46,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:46,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:47,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1297 backedges. 746 proven. 0 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2025-01-08 23:43:47,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:47,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429257294] [2025-01-08 23:43:47,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429257294] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:47,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:47,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:43:47,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954141465] [2025-01-08 23:43:47,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:47,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:43:47,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:47,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:43:47,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:47,100 INFO L87 Difference]: Start difference. First operand 16449 states and 18622 transitions. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 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-08 23:43:47,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:47,699 INFO L93 Difference]: Finished difference Result 32523 states and 36905 transitions. [2025-01-08 23:43:47,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:43:47,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 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 689 [2025-01-08 23:43:47,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:47,700 INFO L225 Difference]: With dead ends: 32523 [2025-01-08 23:43:47,700 INFO L226 Difference]: Without dead ends: 0 [2025-01-08 23:43:47,713 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-08 23:43:47,714 INFO L435 NwaCegarLoop]: 329 mSDtfsCounter, 196 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:47,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 349 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:43:47,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-08 23:43:47,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-08 23:43:47,714 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-08 23:43:47,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-08 23:43:47,715 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 689 [2025-01-08 23:43:47,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:47,715 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-08 23:43:47,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 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-08 23:43:47,715 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-08 23:43:47,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-08 23:43:47,717 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-08 23:43:47,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-08 23:43:47,720 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:43:47,721 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-08 23:43:48,754 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-08 23:43:48,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 11:43:48 BoogieIcfgContainer [2025-01-08 23:43:48,763 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-08 23:43:48,764 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-08 23:43:48,764 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-08 23:43:48,764 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-08 23:43:48,764 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:43:29" (3/4) ... [2025-01-08 23:43:48,766 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-08 23:43:48,779 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-01-08 23:43:48,780 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-08 23:43:48,780 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-08 23:43:48,781 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-08 23:43:48,904 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-08 23:43:48,906 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-08 23:43:48,906 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-08 23:43:48,907 INFO L158 Benchmark]: Toolchain (without parser) took 20963.07ms. Allocated memory was 142.6MB in the beginning and 1.0GB in the end (delta: 872.4MB). Free memory was 101.8MB in the beginning and 401.7MB in the end (delta: -299.9MB). Peak memory consumption was 576.1MB. Max. memory is 16.1GB. [2025-01-08 23:43:48,907 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 23:43:48,907 INFO L158 Benchmark]: CACSL2BoogieTranslator took 519.26ms. Allocated memory is still 142.6MB. Free memory was 101.8MB in the beginning and 57.3MB in the end (delta: 44.6MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-01-08 23:43:48,907 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.80ms. Allocated memory is still 142.6MB. Free memory was 57.3MB in the beginning and 40.4MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-08 23:43:48,907 INFO L158 Benchmark]: Boogie Preprocessor took 134.91ms. Allocated memory is still 142.6MB. Free memory was 40.4MB in the beginning and 77.7MB in the end (delta: -37.3MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. [2025-01-08 23:43:48,908 INFO L158 Benchmark]: RCFGBuilder took 1303.97ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 77.7MB in the beginning and 258.1MB in the end (delta: -180.4MB). Peak memory consumption was 55.0MB. Max. memory is 16.1GB. [2025-01-08 23:43:48,908 INFO L158 Benchmark]: TraceAbstraction took 18774.29ms. Allocated memory was 310.4MB in the beginning and 1.0GB in the end (delta: 704.6MB). Free memory was 257.1MB in the beginning and 418.2MB in the end (delta: -161.0MB). Peak memory consumption was 628.3MB. Max. memory is 16.1GB. [2025-01-08 23:43:48,908 INFO L158 Benchmark]: Witness Printer took 142.28ms. Allocated memory is still 1.0GB. Free memory was 418.2MB in the beginning and 401.7MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-08 23:43:48,910 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.19ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 519.26ms. Allocated memory is still 142.6MB. Free memory was 101.8MB in the beginning and 57.3MB in the end (delta: 44.6MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.80ms. Allocated memory is still 142.6MB. Free memory was 57.3MB in the beginning and 40.4MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 134.91ms. Allocated memory is still 142.6MB. Free memory was 40.4MB in the beginning and 77.7MB in the end (delta: -37.3MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1303.97ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 77.7MB in the beginning and 258.1MB in the end (delta: -180.4MB). Peak memory consumption was 55.0MB. Max. memory is 16.1GB. * TraceAbstraction took 18774.29ms. Allocated memory was 310.4MB in the beginning and 1.0GB in the end (delta: 704.6MB). Free memory was 257.1MB in the beginning and 418.2MB in the end (delta: -161.0MB). Peak memory consumption was 628.3MB. Max. memory is 16.1GB. * Witness Printer took 142.28ms. Allocated memory is still 1.0GB. Free memory was 418.2MB in the beginning and 401.7MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. 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: 154]: 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, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.7s, OverallIterations: 15, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 12.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2745 SdHoareTripleChecker+Valid, 10.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2745 mSDsluCounter, 2879 SdHoareTripleChecker+Invalid, 8.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 381 mSDsCounter, 2097 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10704 IncrementalHoareTripleChecker+Invalid, 12801 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2097 mSolverCounterUnsat, 2498 mSDtfsCounter, 10704 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19226occurred in iteration=12, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 15 MinimizatonAttempts, 8051 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 4287 NumberOfCodeBlocks, 4287 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 4272 ConstructedInterpolants, 0 QuantifiedInterpolants, 10693 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 4465/4465 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: 1044]: Loop Invariant Derived loop invariant: (((((((((a25 <= 10) && (a29 <= 599999)) && (((long long) a23 + 599772) <= 0)) || (((a25 == 13) && (a29 <= 599998)) && (a4 == 1))) || (((a25 == 11) && (a29 <= 599999)) && (a4 == 1))) || (((((long long) a23 + 43) <= 0) && (a25 <= 10)) && (a29 <= 599998))) || (a29 <= 277)) || (((a25 == 11) && (a29 <= 599998)) && (a23 <= 312))) || (((a25 <= 10) && (a29 <= 599999)) && (a4 == 1))) RESULT: Ultimate proved your program to be correct! [2025-01-08 23:43:48,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE