./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem16_label48.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem16_label48.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 0400eaf1344bba9e95f35da8706354691788053fccf773c14142686dfa7b14da --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:09:02,834 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:09:02,887 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 00:09:02,895 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:09:02,896 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:09:02,927 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:09:02,928 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:09:02,928 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:09:02,928 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:09:02,928 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:09:02,928 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:09:02,928 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:09:02,928 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:09:02,928 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:09:02,928 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:09:02,929 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:09:02,929 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:09:02,929 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:09:02,929 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:09:02,929 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:09:02,929 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:09:02,929 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:09:02,929 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:09:02,929 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:09:02,929 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:09:02,929 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:09:02,929 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:09:02,929 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:09:02,929 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:09:02,929 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:09:02,929 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:09:02,929 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:09:02,929 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:09:02,929 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:09:02,929 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:09:02,929 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:09:02,929 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:09:02,930 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:09:02,930 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:09:02,930 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:09:02,930 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:09:02,930 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:09:02,930 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:09:02,930 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:09:02,930 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:09:02,930 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:09:02,930 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:09:02,930 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:09:02,930 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 -> 0400eaf1344bba9e95f35da8706354691788053fccf773c14142686dfa7b14da [2025-01-09 00:09:03,224 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:09:03,231 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:09:03,235 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:09:03,236 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:09:03,236 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:09:03,238 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label48.c [2025-01-09 00:09:04,580 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/af0ad2c0e/5db273ee24f54bdf9c7854f3889af7b8/FLAG688e14380 [2025-01-09 00:09:04,987 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:09:04,993 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label48.c [2025-01-09 00:09:05,019 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/af0ad2c0e/5db273ee24f54bdf9c7854f3889af7b8/FLAG688e14380 [2025-01-09 00:09:05,122 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/af0ad2c0e/5db273ee24f54bdf9c7854f3889af7b8 [2025-01-09 00:09:05,124 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:09:05,125 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:09:05,129 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:09:05,129 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:09:05,132 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:09:05,133 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:09:05" (1/1) ... [2025-01-09 00:09:05,138 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@408879ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:09:05, skipping insertion in model container [2025-01-09 00:09:05,139 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:09:05" (1/1) ... [2025-01-09 00:09:05,184 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:09:05,341 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label48.c[6692,6705] [2025-01-09 00:09:05,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:09:05,555 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:09:05,578 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label48.c[6692,6705] [2025-01-09 00:09:05,709 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:09:05,719 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:09:05,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:09:05 WrapperNode [2025-01-09 00:09:05,720 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:09:05,720 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:09:05,720 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:09:05,720 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:09:05,724 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:09:05" (1/1) ... [2025-01-09 00:09:05,750 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:09:05" (1/1) ... [2025-01-09 00:09:05,901 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1767 [2025-01-09 00:09:05,901 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:09:05,902 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:09:05,902 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:09:05,903 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:09:05,910 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:09:05" (1/1) ... [2025-01-09 00:09:05,910 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:09:05" (1/1) ... [2025-01-09 00:09:05,929 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:09:05" (1/1) ... [2025-01-09 00:09:05,980 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 00:09:05,980 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:09:05" (1/1) ... [2025-01-09 00:09:05,980 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:09:05" (1/1) ... [2025-01-09 00:09:06,029 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:09:05" (1/1) ... [2025-01-09 00:09:06,036 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:09:05" (1/1) ... [2025-01-09 00:09:06,052 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:09:05" (1/1) ... [2025-01-09 00:09:06,066 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:09:05" (1/1) ... [2025-01-09 00:09:06,075 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:09:05" (1/1) ... [2025-01-09 00:09:06,090 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:09:06,092 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:09:06,092 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:09:06,092 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:09:06,093 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:09:05" (1/1) ... [2025-01-09 00:09:06,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:09:06,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:09:06,116 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 00:09:06,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 00:09:06,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:09:06,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:09:06,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:09:06,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:09:06,193 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:09:06,194 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:09:07,966 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2025-01-09 00:09:07,966 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:09:07,977 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:09:07,977 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 00:09:07,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:09:07 BoogieIcfgContainer [2025-01-09 00:09:07,978 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:09:07,979 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:09:07,979 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:09:07,987 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:09:07,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:09:05" (1/3) ... [2025-01-09 00:09:07,987 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40f95928 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:09:07, skipping insertion in model container [2025-01-09 00:09:07,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:09:05" (2/3) ... [2025-01-09 00:09:07,988 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40f95928 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:09:07, skipping insertion in model container [2025-01-09 00:09:07,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:09:07" (3/3) ... [2025-01-09 00:09:07,989 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem16_label48.c [2025-01-09 00:09:07,998 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:09:07,999 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem16_label48.c that has 1 procedures, 396 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 00:09:08,041 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:09:08,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;@2164b990, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:09:08,049 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:09:08,052 INFO L276 IsEmpty]: Start isEmpty. Operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:08,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 00:09:08,057 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:09:08,057 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:09:08,058 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:09:08,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:09:08,061 INFO L85 PathProgramCache]: Analyzing trace with hash -788531278, now seen corresponding path program 1 times [2025-01-09 00:09:08,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:09:08,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992084416] [2025-01-09 00:09:08,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:09:08,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:09:08,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 00:09:08,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 00:09:08,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:09:08,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:09:08,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:09:08,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:09:08,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992084416] [2025-01-09 00:09:08,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992084416] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:09:08,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:09:08,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:09:08,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853222757] [2025-01-09 00:09:08,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:09:08,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:09:08,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:09:08,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:09:08,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:09:08,403 INFO L87 Difference]: Start difference. First operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:10,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:09:10,132 INFO L93 Difference]: Finished difference Result 1122 states and 2100 transitions. [2025-01-09 00:09:10,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:09:10,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 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 64 [2025-01-09 00:09:10,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:09:10,154 INFO L225 Difference]: With dead ends: 1122 [2025-01-09 00:09:10,155 INFO L226 Difference]: Without dead ends: 662 [2025-01-09 00:09:10,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:09:10,164 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 323 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:09:10,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 254 Invalid, 1314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 00:09:10,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2025-01-09 00:09:10,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2025-01-09 00:09:10,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.518910741301059) internal successors, (1004), 661 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:10,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1004 transitions. [2025-01-09 00:09:10,225 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1004 transitions. Word has length 64 [2025-01-09 00:09:10,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:09:10,226 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 1004 transitions. [2025-01-09 00:09:10,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:10,226 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1004 transitions. [2025-01-09 00:09:10,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 00:09:10,232 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:09:10,233 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:09:10,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:09:10,233 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:09:10,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:09:10,234 INFO L85 PathProgramCache]: Analyzing trace with hash -914715508, now seen corresponding path program 1 times [2025-01-09 00:09:10,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:09:10,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790397944] [2025-01-09 00:09:10,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:09:10,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:09:10,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 00:09:10,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 00:09:10,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:09:10,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:09:10,648 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:09:10,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:09:10,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790397944] [2025-01-09 00:09:10,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790397944] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:09:10,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:09:10,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:09:10,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363156988] [2025-01-09 00:09:10,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:09:10,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:09:10,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:09:10,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:09:10,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:09:10,653 INFO L87 Difference]: Start difference. First operand 662 states and 1004 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:12,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:09:12,408 INFO L93 Difference]: Finished difference Result 2309 states and 3414 transitions. [2025-01-09 00:09:12,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:09:12,409 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 3 states have internal predecessors, (132), 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 132 [2025-01-09 00:09:12,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:09:12,415 INFO L225 Difference]: With dead ends: 2309 [2025-01-09 00:09:12,416 INFO L226 Difference]: Without dead ends: 1649 [2025-01-09 00:09:12,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:09:12,419 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 1006 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1496 mSolverCounterSat, 489 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1006 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 1985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 489 IncrementalHoareTripleChecker+Valid, 1496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:09:12,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1006 Valid, 44 Invalid, 1985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [489 Valid, 1496 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 00:09:12,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2025-01-09 00:09:12,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1649. [2025-01-09 00:09:12,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1649 states, 1648 states have (on average 1.4010922330097086) internal successors, (2309), 1648 states have internal predecessors, (2309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:12,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2309 transitions. [2025-01-09 00:09:12,478 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2309 transitions. Word has length 132 [2025-01-09 00:09:12,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:09:12,480 INFO L471 AbstractCegarLoop]: Abstraction has 1649 states and 2309 transitions. [2025-01-09 00:09:12,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:12,481 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2309 transitions. [2025-01-09 00:09:12,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2025-01-09 00:09:12,487 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:09:12,488 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:09:12,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:09:12,488 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:09:12,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:09:12,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1352076903, now seen corresponding path program 1 times [2025-01-09 00:09:12,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:09:12,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334036600] [2025-01-09 00:09:12,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:09:12,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:09:12,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-01-09 00:09:12,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-01-09 00:09:12,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:09:12,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:09:12,799 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-01-09 00:09:12,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:09:12,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334036600] [2025-01-09 00:09:12,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334036600] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:09:12,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:09:12,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:09:12,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696474780] [2025-01-09 00:09:12,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:09:12,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:09:12,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:09:12,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:09:12,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:09:12,803 INFO L87 Difference]: Start difference. First operand 1649 states and 2309 transitions. Second operand has 3 states, 3 states have (on average 77.0) internal successors, (231), 2 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:13,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:09:13,897 INFO L93 Difference]: Finished difference Result 3625 states and 5239 transitions. [2025-01-09 00:09:13,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:09:13,898 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 2 states have internal predecessors, (231), 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-09 00:09:13,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:09:13,907 INFO L225 Difference]: With dead ends: 3625 [2025-01-09 00:09:13,907 INFO L226 Difference]: Without dead ends: 2307 [2025-01-09 00:09:13,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:09:13,911 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 278 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 379 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 379 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:09:13,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 77 Invalid, 1261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [379 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 00:09:13,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2025-01-09 00:09:13,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2307. [2025-01-09 00:09:13,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2307 states, 2306 states have (on average 1.3490893321769297) internal successors, (3111), 2306 states have internal predecessors, (3111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:13,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3111 transitions. [2025-01-09 00:09:13,960 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 3111 transitions. Word has length 292 [2025-01-09 00:09:13,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:09:13,961 INFO L471 AbstractCegarLoop]: Abstraction has 2307 states and 3111 transitions. [2025-01-09 00:09:13,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 2 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:13,961 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 3111 transitions. [2025-01-09 00:09:13,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2025-01-09 00:09:13,965 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:09:13,965 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:09:13,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 00:09:13,966 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:09:13,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:09:13,967 INFO L85 PathProgramCache]: Analyzing trace with hash -318094353, now seen corresponding path program 1 times [2025-01-09 00:09:13,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:09:13,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810323309] [2025-01-09 00:09:13,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:09:13,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:09:13,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-01-09 00:09:14,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-01-09 00:09:14,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:09:14,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:09:14,210 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-01-09 00:09:14,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:09:14,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810323309] [2025-01-09 00:09:14,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810323309] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:09:14,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:09:14,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:09:14,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940002657] [2025-01-09 00:09:14,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:09:14,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:09:14,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:09:14,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:09:14,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:09:14,213 INFO L87 Difference]: Start difference. First operand 2307 states and 3111 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:15,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:09:15,162 INFO L93 Difference]: Finished difference Result 5599 states and 7694 transitions. [2025-01-09 00:09:15,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:09:15,162 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 327 [2025-01-09 00:09:15,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:09:15,173 INFO L225 Difference]: With dead ends: 5599 [2025-01-09 00:09:15,174 INFO L226 Difference]: Without dead ends: 3623 [2025-01-09 00:09:15,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:09:15,177 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 359 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:09:15,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 155 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 00:09:15,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3623 states. [2025-01-09 00:09:15,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3623 to 3294. [2025-01-09 00:09:15,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3294 states, 3293 states have (on average 1.2356513817187975) internal successors, (4069), 3293 states have internal predecessors, (4069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:15,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3294 states to 3294 states and 4069 transitions. [2025-01-09 00:09:15,216 INFO L78 Accepts]: Start accepts. Automaton has 3294 states and 4069 transitions. Word has length 327 [2025-01-09 00:09:15,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:09:15,217 INFO L471 AbstractCegarLoop]: Abstraction has 3294 states and 4069 transitions. [2025-01-09 00:09:15,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:15,217 INFO L276 IsEmpty]: Start isEmpty. Operand 3294 states and 4069 transitions. [2025-01-09 00:09:15,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 581 [2025-01-09 00:09:15,224 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:09:15,224 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:09:15,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 00:09:15,224 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:09:15,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:09:15,225 INFO L85 PathProgramCache]: Analyzing trace with hash 472920802, now seen corresponding path program 1 times [2025-01-09 00:09:15,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:09:15,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256777639] [2025-01-09 00:09:15,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:09:15,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:09:15,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 580 statements into 1 equivalence classes. [2025-01-09 00:09:15,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 580 of 580 statements. [2025-01-09 00:09:15,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:09:15,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:09:15,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 755 proven. 0 refuted. 0 times theorem prover too weak. 491 trivial. 0 not checked. [2025-01-09 00:09:15,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:09:15,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256777639] [2025-01-09 00:09:15,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256777639] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:09:15,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:09:15,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:09:15,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647661676] [2025-01-09 00:09:15,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:09:15,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:09:15,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:09:15,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:09:15,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:09:15,898 INFO L87 Difference]: Start difference. First operand 3294 states and 4069 transitions. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:17,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:09:17,480 INFO L93 Difference]: Finished difference Result 7573 states and 9417 transitions. [2025-01-09 00:09:17,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:09:17,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 580 [2025-01-09 00:09:17,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:09:17,498 INFO L225 Difference]: With dead ends: 7573 [2025-01-09 00:09:17,501 INFO L226 Difference]: Without dead ends: 3952 [2025-01-09 00:09:17,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:09:17,511 INFO L435 NwaCegarLoop]: 534 mSDtfsCounter, 286 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 297 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 297 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:09:17,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 540 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [297 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:09:17,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3952 states. [2025-01-09 00:09:17,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3952 to 3952. [2025-01-09 00:09:17,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3952 states, 3951 states have (on average 1.072892938496583) internal successors, (4239), 3951 states have internal predecessors, (4239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:17,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3952 states to 3952 states and 4239 transitions. [2025-01-09 00:09:17,624 INFO L78 Accepts]: Start accepts. Automaton has 3952 states and 4239 transitions. Word has length 580 [2025-01-09 00:09:17,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:09:17,624 INFO L471 AbstractCegarLoop]: Abstraction has 3952 states and 4239 transitions. [2025-01-09 00:09:17,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:17,627 INFO L276 IsEmpty]: Start isEmpty. Operand 3952 states and 4239 transitions. [2025-01-09 00:09:17,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 853 [2025-01-09 00:09:17,654 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:09:17,654 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:09:17,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 00:09:17,655 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:09:17,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:09:17,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1106518000, now seen corresponding path program 1 times [2025-01-09 00:09:17,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:09:17,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730283809] [2025-01-09 00:09:17,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:09:17,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:09:17,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 852 statements into 1 equivalence classes. [2025-01-09 00:09:17,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 852 of 852 statements. [2025-01-09 00:09:17,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:09:17,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:09:18,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1523 backedges. 1169 proven. 0 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2025-01-09 00:09:18,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:09:18,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730283809] [2025-01-09 00:09:18,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730283809] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:09:18,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:09:18,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:09:18,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288375477] [2025-01-09 00:09:18,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:09:18,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:09:18,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:09:18,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:09:18,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:09:18,737 INFO L87 Difference]: Start difference. First operand 3952 states and 4239 transitions. Second operand has 3 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:19,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:09:19,480 INFO L93 Difference]: Finished difference Result 8889 states and 9584 transitions. [2025-01-09 00:09:19,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:09:19,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 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 852 [2025-01-09 00:09:19,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:09:19,495 INFO L225 Difference]: With dead ends: 8889 [2025-01-09 00:09:19,495 INFO L226 Difference]: Without dead ends: 5268 [2025-01-09 00:09:19,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:09:19,500 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 220 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:09:19,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 427 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:09:19,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5268 states. [2025-01-09 00:09:19,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5268 to 5268. [2025-01-09 00:09:19,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5268 states, 5267 states have (on average 1.0599962027719765) internal successors, (5583), 5267 states have internal predecessors, (5583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:19,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5268 states to 5268 states and 5583 transitions. [2025-01-09 00:09:19,568 INFO L78 Accepts]: Start accepts. Automaton has 5268 states and 5583 transitions. Word has length 852 [2025-01-09 00:09:19,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:09:19,569 INFO L471 AbstractCegarLoop]: Abstraction has 5268 states and 5583 transitions. [2025-01-09 00:09:19,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:19,569 INFO L276 IsEmpty]: Start isEmpty. Operand 5268 states and 5583 transitions. [2025-01-09 00:09:19,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 916 [2025-01-09 00:09:19,618 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:09:19,618 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:09:19,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 00:09:19,623 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:09:19,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:09:19,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1981451207, now seen corresponding path program 1 times [2025-01-09 00:09:19,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:09:19,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335265827] [2025-01-09 00:09:19,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:09:19,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:09:19,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 915 statements into 1 equivalence classes. [2025-01-09 00:09:19,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 915 of 915 statements. [2025-01-09 00:09:19,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:09:19,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:09:20,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1678 backedges. 1140 proven. 0 refuted. 0 times theorem prover too weak. 538 trivial. 0 not checked. [2025-01-09 00:09:20,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:09:20,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335265827] [2025-01-09 00:09:20,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335265827] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:09:20,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:09:20,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:09:20,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188247056] [2025-01-09 00:09:20,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:09:20,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:09:20,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:09:20,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:09:20,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:09:20,108 INFO L87 Difference]: Start difference. First operand 5268 states and 5583 transitions. Second operand has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:20,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:09:20,865 INFO L93 Difference]: Finished difference Result 11850 states and 12616 transitions. [2025-01-09 00:09:20,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:09:20,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 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 915 [2025-01-09 00:09:20,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:09:20,882 INFO L225 Difference]: With dead ends: 11850 [2025-01-09 00:09:20,882 INFO L226 Difference]: Without dead ends: 6913 [2025-01-09 00:09:20,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:09:20,888 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 184 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:09:20,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 57 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:09:20,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6913 states. [2025-01-09 00:09:20,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6913 to 6584. [2025-01-09 00:09:20,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6584 states, 6583 states have (on average 1.055142032507975) internal successors, (6946), 6583 states have internal predecessors, (6946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:20,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6584 states to 6584 states and 6946 transitions. [2025-01-09 00:09:20,973 INFO L78 Accepts]: Start accepts. Automaton has 6584 states and 6946 transitions. Word has length 915 [2025-01-09 00:09:20,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:09:20,974 INFO L471 AbstractCegarLoop]: Abstraction has 6584 states and 6946 transitions. [2025-01-09 00:09:20,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:20,975 INFO L276 IsEmpty]: Start isEmpty. Operand 6584 states and 6946 transitions. [2025-01-09 00:09:20,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1281 [2025-01-09 00:09:20,987 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:09:20,989 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-09 00:09:20,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 00:09:20,989 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:09:20,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:09:20,990 INFO L85 PathProgramCache]: Analyzing trace with hash -141232049, now seen corresponding path program 1 times [2025-01-09 00:09:20,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:09:20,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968184485] [2025-01-09 00:09:20,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:09:20,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:09:21,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1280 statements into 1 equivalence classes. [2025-01-09 00:09:21,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1280 of 1280 statements. [2025-01-09 00:09:21,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:09:21,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:09:22,112 INFO L134 CoverageAnalysis]: Checked inductivity of 3034 backedges. 1730 proven. 0 refuted. 0 times theorem prover too weak. 1304 trivial. 0 not checked. [2025-01-09 00:09:22,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:09:22,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968184485] [2025-01-09 00:09:22,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968184485] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:09:22,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:09:22,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:09:22,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353126527] [2025-01-09 00:09:22,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:09:22,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:09:22,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:09:22,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:09:22,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:09:22,118 INFO L87 Difference]: Start difference. First operand 6584 states and 6946 transitions. Second operand has 4 states, 4 states have (on average 193.5) internal successors, (774), 3 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:23,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:09:23,270 INFO L93 Difference]: Finished difference Result 18101 states and 19132 transitions. [2025-01-09 00:09:23,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:09:23,271 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 193.5) internal successors, (774), 3 states have internal predecessors, (774), 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 1280 [2025-01-09 00:09:23,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:09:23,292 INFO L225 Difference]: With dead ends: 18101 [2025-01-09 00:09:23,292 INFO L226 Difference]: Without dead ends: 11848 [2025-01-09 00:09:23,298 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-09 00:09:23,299 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 267 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 1180 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 1284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:09:23,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 79 Invalid, 1284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1180 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:09:23,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11848 states. [2025-01-09 00:09:23,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11848 to 10532. [2025-01-09 00:09:23,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10532 states, 10531 states have (on average 1.0539359984806762) internal successors, (11099), 10531 states have internal predecessors, (11099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:23,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10532 states to 10532 states and 11099 transitions. [2025-01-09 00:09:23,435 INFO L78 Accepts]: Start accepts. Automaton has 10532 states and 11099 transitions. Word has length 1280 [2025-01-09 00:09:23,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:09:23,437 INFO L471 AbstractCegarLoop]: Abstraction has 10532 states and 11099 transitions. [2025-01-09 00:09:23,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 193.5) internal successors, (774), 3 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:23,438 INFO L276 IsEmpty]: Start isEmpty. Operand 10532 states and 11099 transitions. [2025-01-09 00:09:23,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1319 [2025-01-09 00:09:23,505 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:09:23,505 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:09:23,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 00:09:23,506 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:09:23,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:09:23,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1710566494, now seen corresponding path program 1 times [2025-01-09 00:09:23,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:09:23,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193705507] [2025-01-09 00:09:23,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:09:23,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:09:23,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1318 statements into 1 equivalence classes. [2025-01-09 00:09:23,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1318 of 1318 statements. [2025-01-09 00:09:23,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:09:23,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:09:25,657 INFO L134 CoverageAnalysis]: Checked inductivity of 3727 backedges. 1659 proven. 156 refuted. 0 times theorem prover too weak. 1912 trivial. 0 not checked. [2025-01-09 00:09:25,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:09:25,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193705507] [2025-01-09 00:09:25,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193705507] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:09:25,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327109871] [2025-01-09 00:09:25,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:09:25,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:09:25,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:09:25,663 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:09:25,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 00:09:25,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1318 statements into 1 equivalence classes. [2025-01-09 00:09:25,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1318 of 1318 statements. [2025-01-09 00:09:25,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:09:25,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:09:25,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 1552 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:09:26,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:09:26,158 INFO L134 CoverageAnalysis]: Checked inductivity of 3727 backedges. 495 proven. 0 refuted. 0 times theorem prover too weak. 3232 trivial. 0 not checked. [2025-01-09 00:09:26,158 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:09:26,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327109871] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:09:26,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:09:26,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-01-09 00:09:26,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304167821] [2025-01-09 00:09:26,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:09:26,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:09:26,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:09:26,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:09:26,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:09:26,161 INFO L87 Difference]: Start difference. First operand 10532 states and 11099 transitions. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:26,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:09:26,850 INFO L93 Difference]: Finished difference Result 20731 states and 21864 transitions. [2025-01-09 00:09:26,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:09:26,850 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 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 1318 [2025-01-09 00:09:26,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:09:26,852 INFO L225 Difference]: With dead ends: 20731 [2025-01-09 00:09:26,852 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 00:09:26,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1322 GetRequests, 1317 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:09:26,863 INFO L435 NwaCegarLoop]: 405 mSDtfsCounter, 271 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:09:26,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 410 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 00:09:26,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 00:09:26,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 00:09:26,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:26,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 00:09:26,865 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1318 [2025-01-09 00:09:26,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:09:26,865 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 00:09:26,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:26,866 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 00:09:26,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 00:09:26,868 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 00:09:26,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 00:09:27,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:09:27,071 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:09:27,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 00:09:27,395 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 00:09:27,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 12:09:27 BoogieIcfgContainer [2025-01-09 00:09:27,412 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 00:09:27,413 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 00:09:27,413 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 00:09:27,414 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 00:09:27,414 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:09:07" (3/4) ... [2025-01-09 00:09:27,416 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 00:09:27,440 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-01-09 00:09:27,441 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-09 00:09:27,442 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 00:09:27,444 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 00:09:27,572 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 00:09:27,573 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 00:09:27,573 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 00:09:27,574 INFO L158 Benchmark]: Toolchain (without parser) took 22449.17ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 922.7MB). Free memory was 108.5MB in the beginning and 572.9MB in the end (delta: -464.5MB). Peak memory consumption was 457.4MB. Max. memory is 16.1GB. [2025-01-09 00:09:27,574 INFO L158 Benchmark]: CDTParser took 0.98ms. Allocated memory is still 201.3MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 00:09:27,575 INFO L158 Benchmark]: CACSL2BoogieTranslator took 591.28ms. Allocated memory is still 142.6MB. Free memory was 108.5MB in the beginning and 50.5MB in the end (delta: 57.9MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-01-09 00:09:27,575 INFO L158 Benchmark]: Boogie Procedure Inliner took 180.98ms. Allocated memory is still 142.6MB. Free memory was 50.5MB in the beginning and 90.5MB in the end (delta: -39.9MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. [2025-01-09 00:09:27,575 INFO L158 Benchmark]: Boogie Preprocessor took 188.97ms. Allocated memory is still 142.6MB. Free memory was 90.5MB in the beginning and 56.6MB in the end (delta: 33.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 00:09:27,575 INFO L158 Benchmark]: RCFGBuilder took 1886.03ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 56.6MB in the beginning and 369.7MB in the end (delta: -313.0MB). Peak memory consumption was 212.7MB. Max. memory is 16.1GB. [2025-01-09 00:09:27,576 INFO L158 Benchmark]: TraceAbstraction took 19433.24ms. Allocated memory was 427.8MB in the beginning and 1.1GB in the end (delta: 637.5MB). Free memory was 369.7MB in the beginning and 593.8MB in the end (delta: -224.1MB). Peak memory consumption was 417.5MB. Max. memory is 16.1GB. [2025-01-09 00:09:27,576 INFO L158 Benchmark]: Witness Printer took 160.29ms. Allocated memory is still 1.1GB. Free memory was 593.8MB in the beginning and 572.9MB in the end (delta: 20.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 00:09:27,577 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.98ms. Allocated memory is still 201.3MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 591.28ms. Allocated memory is still 142.6MB. Free memory was 108.5MB in the beginning and 50.5MB in the end (delta: 57.9MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 180.98ms. Allocated memory is still 142.6MB. Free memory was 50.5MB in the beginning and 90.5MB in the end (delta: -39.9MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 188.97ms. Allocated memory is still 142.6MB. Free memory was 90.5MB in the beginning and 56.6MB in the end (delta: 33.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1886.03ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 56.6MB in the beginning and 369.7MB in the end (delta: -313.0MB). Peak memory consumption was 212.7MB. Max. memory is 16.1GB. * TraceAbstraction took 19433.24ms. Allocated memory was 427.8MB in the beginning and 1.1GB in the end (delta: 637.5MB). Free memory was 369.7MB in the beginning and 593.8MB in the end (delta: -224.1MB). Peak memory consumption was 417.5MB. Max. memory is 16.1GB. * Witness Printer took 160.29ms. Allocated memory is still 1.1GB. Free memory was 593.8MB in the beginning and 572.9MB in the end (delta: 20.8MB). 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: 209]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 396 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.0s, OverallIterations: 9, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 10.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3194 SdHoareTripleChecker+Valid, 9.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3194 mSDsluCounter, 2043 SdHoareTripleChecker+Invalid, 8.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 56 mSDsCounter, 2252 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8306 IncrementalHoareTripleChecker+Invalid, 10558 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2252 mSolverCounterUnsat, 1987 mSDtfsCounter, 8306 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1344 GetRequests, 1328 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10532occurred in iteration=8, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 9 MinimizatonAttempts, 1974 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 7078 NumberOfCodeBlocks, 7078 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 7068 ConstructedInterpolants, 0 QuantifiedInterpolants, 15220 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1552 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 15487/15643 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1783]: Loop Invariant Derived loop invariant: ((((((((0 <= ((long long) 87 + a18)) && (a15 <= 3)) && (a12 <= 6)) || ((a12 <= 5) && (a15 <= 3))) || ((a15 <= 3) && (8 <= a12))) || (((a16 != 10) && (a15 <= 3)) && (7 == a12))) || ((a12 <= 6) && (a16 <= 11))) || ((a16 != 10) && (a16 <= 11))) RESULT: Ultimate proved your program to be correct! [2025-01-09 00:09:27,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE