./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem01_label11.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2dc34619b8722f38daca39084af716acca2f2990c40299072c7b560e6e3245de --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 03:04:49,954 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 03:04:50,044 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 03:04:50,050 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 03:04:50,051 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 03:04:50,078 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 03:04:50,078 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 03:04:50,079 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 03:04:50,079 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 03:04:50,080 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 03:04:50,080 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 03:04:50,081 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 03:04:50,082 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 03:04:50,084 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 03:04:50,084 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 03:04:50,085 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 03:04:50,085 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 03:04:50,085 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 03:04:50,086 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 03:04:50,086 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 03:04:50,089 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 03:04:50,090 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 03:04:50,090 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 03:04:50,090 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 03:04:50,091 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 03:04:50,091 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 03:04:50,091 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 03:04:50,091 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 03:04:50,092 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 03:04:50,092 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 03:04:50,093 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 03:04:50,093 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 03:04:50,093 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 03:04:50,094 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 03:04:50,094 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 03:04:50,094 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 03:04:50,094 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 03:04:50,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 03:04:50,095 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 03:04:50,095 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 03:04:50,095 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 03:04:50,096 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 03:04:50,096 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2dc34619b8722f38daca39084af716acca2f2990c40299072c7b560e6e3245de [2024-11-16 03:04:50,345 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 03:04:50,369 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 03:04:50,372 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 03:04:50,373 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 03:04:50,375 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 03:04:50,376 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label11.c [2024-11-16 03:04:51,840 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 03:04:52,100 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 03:04:52,104 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label11.c [2024-11-16 03:04:52,122 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/694663923/21154e88a0e645f28bfe0af63cb7d378/FLAGdec1f4046 [2024-11-16 03:04:52,138 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/694663923/21154e88a0e645f28bfe0af63cb7d378 [2024-11-16 03:04:52,143 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 03:04:52,144 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 03:04:52,145 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 03:04:52,145 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 03:04:52,153 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 03:04:52,153 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:04:52" (1/1) ... [2024-11-16 03:04:52,154 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c45f2d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:04:52, skipping insertion in model container [2024-11-16 03:04:52,154 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:04:52" (1/1) ... [2024-11-16 03:04:52,201 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 03:04:52,587 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label11.c[19099,19112] [2024-11-16 03:04:52,633 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 03:04:52,650 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 03:04:52,746 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label11.c[19099,19112] [2024-11-16 03:04:52,756 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 03:04:52,773 INFO L204 MainTranslator]: Completed translation [2024-11-16 03:04:52,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:04:52 WrapperNode [2024-11-16 03:04:52,773 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 03:04:52,774 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 03:04:52,774 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 03:04:52,774 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 03:04:52,780 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:04:52" (1/1) ... [2024-11-16 03:04:52,799 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:04:52" (1/1) ... [2024-11-16 03:04:52,846 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-11-16 03:04:52,846 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 03:04:52,847 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 03:04:52,847 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 03:04:52,847 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 03:04:52,862 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:04:52" (1/1) ... [2024-11-16 03:04:52,862 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:04:52" (1/1) ... [2024-11-16 03:04:52,870 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:04:52" (1/1) ... [2024-11-16 03:04:52,910 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]. [2024-11-16 03:04:52,910 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:04:52" (1/1) ... [2024-11-16 03:04:52,910 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:04:52" (1/1) ... [2024-11-16 03:04:52,931 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:04:52" (1/1) ... [2024-11-16 03:04:52,936 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:04:52" (1/1) ... [2024-11-16 03:04:52,941 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:04:52" (1/1) ... [2024-11-16 03:04:52,943 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:04:52" (1/1) ... [2024-11-16 03:04:52,950 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 03:04:52,952 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 03:04:52,952 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 03:04:52,952 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 03:04:52,953 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:04:52" (1/1) ... [2024-11-16 03:04:52,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 03:04:52,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 03:04:52,987 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 03:04:52,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 03:04:53,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 03:04:53,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 03:04:53,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 03:04:53,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 03:04:53,133 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 03:04:53,134 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 03:04:54,121 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-16 03:04:54,122 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 03:04:54,144 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 03:04:54,144 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 03:04:54,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:04:54 BoogieIcfgContainer [2024-11-16 03:04:54,145 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 03:04:54,147 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 03:04:54,147 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 03:04:54,150 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 03:04:54,150 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 03:04:52" (1/3) ... [2024-11-16 03:04:54,151 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c507b66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:04:54, skipping insertion in model container [2024-11-16 03:04:54,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:04:52" (2/3) ... [2024-11-16 03:04:54,151 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c507b66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:04:54, skipping insertion in model container [2024-11-16 03:04:54,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:04:54" (3/3) ... [2024-11-16 03:04:54,153 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label11.c [2024-11-16 03:04:54,169 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 03:04:54,169 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 03:04:54,239 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 03:04:54,247 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;@2dfe856c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 03:04:54,248 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 03:04:54,253 INFO L276 IsEmpty]: Start isEmpty. Operand has 201 states, 199 states have (on average 1.6582914572864322) internal successors, (330), 200 states have internal predecessors, (330), 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) [2024-11-16 03:04:54,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-16 03:04:54,266 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:04:54,268 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:04:54,268 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:04:54,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:04:54,274 INFO L85 PathProgramCache]: Analyzing trace with hash -861642579, now seen corresponding path program 1 times [2024-11-16 03:04:54,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:04:54,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022821692] [2024-11-16 03:04:54,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:04:54,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:04:54,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:04:54,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:04:54,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:04:54,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022821692] [2024-11-16 03:04:54,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022821692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:04:54,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:04:54,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 03:04:54,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578005370] [2024-11-16 03:04:54,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:04:54,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:04:54,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:04:54,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:04:54,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:04:54,867 INFO L87 Difference]: Start difference. First operand has 201 states, 199 states have (on average 1.6582914572864322) internal successors, (330), 200 states have internal predecessors, (330), 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 37.0) internal successors, (111), 2 states have internal predecessors, (111), 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) [2024-11-16 03:04:55,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:04:55,639 INFO L93 Difference]: Finished difference Result 534 states and 921 transitions. [2024-11-16 03:04:55,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:04:55,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 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 111 [2024-11-16 03:04:55,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:04:55,655 INFO L225 Difference]: With dead ends: 534 [2024-11-16 03:04:55,655 INFO L226 Difference]: Without dead ends: 269 [2024-11-16 03:04:55,661 INFO L431 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 [2024-11-16 03:04:55,664 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 79 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 03:04:55,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 55 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 03:04:55,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-16 03:04:55,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2024-11-16 03:04:55,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 268 states have (on average 1.4514925373134329) internal successors, (389), 268 states have internal predecessors, (389), 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) [2024-11-16 03:04:55,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 389 transitions. [2024-11-16 03:04:55,723 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 389 transitions. Word has length 111 [2024-11-16 03:04:55,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:04:55,724 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 389 transitions. [2024-11-16 03:04:55,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 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) [2024-11-16 03:04:55,724 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 389 transitions. [2024-11-16 03:04:55,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-16 03:04:55,729 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:04:55,729 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:04:55,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 03:04:55,730 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:04:55,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:04:55,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1198563943, now seen corresponding path program 1 times [2024-11-16 03:04:55,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:04:55,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623945633] [2024-11-16 03:04:55,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:04:55,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:04:55,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:04:55,860 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:04:55,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:04:55,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623945633] [2024-11-16 03:04:55,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623945633] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:04:55,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:04:55,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 03:04:55,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602334683] [2024-11-16 03:04:55,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:04:55,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:04:55,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:04:55,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:04:55,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:04:55,864 INFO L87 Difference]: Start difference. First operand 269 states and 389 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 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) [2024-11-16 03:04:56,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:04:56,288 INFO L93 Difference]: Finished difference Result 800 states and 1161 transitions. [2024-11-16 03:04:56,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:04:56,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 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 118 [2024-11-16 03:04:56,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:04:56,292 INFO L225 Difference]: With dead ends: 800 [2024-11-16 03:04:56,292 INFO L226 Difference]: Without dead ends: 533 [2024-11-16 03:04:56,292 INFO L431 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 [2024-11-16 03:04:56,294 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 143 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 03:04:56,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 39 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 03:04:56,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2024-11-16 03:04:56,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 533. [2024-11-16 03:04:56,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 532 states have (on average 1.3759398496240602) internal successors, (732), 532 states have internal predecessors, (732), 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) [2024-11-16 03:04:56,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 732 transitions. [2024-11-16 03:04:56,330 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 732 transitions. Word has length 118 [2024-11-16 03:04:56,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:04:56,331 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 732 transitions. [2024-11-16 03:04:56,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 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) [2024-11-16 03:04:56,335 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 732 transitions. [2024-11-16 03:04:56,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-16 03:04:56,338 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:04:56,338 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:04:56,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 03:04:56,339 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:04:56,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:04:56,342 INFO L85 PathProgramCache]: Analyzing trace with hash 199732376, now seen corresponding path program 1 times [2024-11-16 03:04:56,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:04:56,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493563081] [2024-11-16 03:04:56,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:04:56,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:04:56,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:04:56,808 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:04:56,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:04:56,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493563081] [2024-11-16 03:04:56,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493563081] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:04:56,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:04:56,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:04:56,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824102576] [2024-11-16 03:04:56,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:04:56,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 03:04:56,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:04:56,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 03:04:56,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:04:56,816 INFO L87 Difference]: Start difference. First operand 533 states and 732 transitions. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 3 states have internal predecessors, (119), 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) [2024-11-16 03:04:57,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:04:57,412 INFO L93 Difference]: Finished difference Result 1424 states and 1943 transitions. [2024-11-16 03:04:57,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 03:04:57,415 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 3 states have internal predecessors, (119), 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 119 [2024-11-16 03:04:57,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:04:57,421 INFO L225 Difference]: With dead ends: 1424 [2024-11-16 03:04:57,421 INFO L226 Difference]: Without dead ends: 797 [2024-11-16 03:04:57,423 INFO L431 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 [2024-11-16 03:04:57,424 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 129 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 03:04:57,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 87 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 03:04:57,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2024-11-16 03:04:57,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 797. [2024-11-16 03:04:57,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 796 states have (on average 1.199748743718593) internal successors, (955), 796 states have internal predecessors, (955), 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) [2024-11-16 03:04:57,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 955 transitions. [2024-11-16 03:04:57,454 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 955 transitions. Word has length 119 [2024-11-16 03:04:57,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:04:57,454 INFO L471 AbstractCegarLoop]: Abstraction has 797 states and 955 transitions. [2024-11-16 03:04:57,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 3 states have internal predecessors, (119), 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) [2024-11-16 03:04:57,455 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 955 transitions. [2024-11-16 03:04:57,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-16 03:04:57,457 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:04:57,457 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:04:57,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 03:04:57,458 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:04:57,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:04:57,458 INFO L85 PathProgramCache]: Analyzing trace with hash -692790697, now seen corresponding path program 1 times [2024-11-16 03:04:57,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:04:57,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146585004] [2024-11-16 03:04:57,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:04:57,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:04:57,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:04:57,616 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 03:04:57,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:04:57,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146585004] [2024-11-16 03:04:57,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146585004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:04:57,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:04:57,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 03:04:57,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681995383] [2024-11-16 03:04:57,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:04:57,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:04:57,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:04:57,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:04:57,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:04:57,619 INFO L87 Difference]: Start difference. First operand 797 states and 955 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:04:57,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:04:57,982 INFO L93 Difference]: Finished difference Result 1856 states and 2260 transitions. [2024-11-16 03:04:57,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:04:57,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 125 [2024-11-16 03:04:57,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:04:57,987 INFO L225 Difference]: With dead ends: 1856 [2024-11-16 03:04:57,987 INFO L226 Difference]: Without dead ends: 1061 [2024-11-16 03:04:57,988 INFO L431 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 [2024-11-16 03:04:57,990 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 130 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 03:04:57,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 48 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 03:04:57,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2024-11-16 03:04:58,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 1061. [2024-11-16 03:04:58,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1061 states, 1060 states have (on average 1.1735849056603773) internal successors, (1244), 1060 states have internal predecessors, (1244), 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) [2024-11-16 03:04:58,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1244 transitions. [2024-11-16 03:04:58,012 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1244 transitions. Word has length 125 [2024-11-16 03:04:58,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:04:58,013 INFO L471 AbstractCegarLoop]: Abstraction has 1061 states and 1244 transitions. [2024-11-16 03:04:58,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:04:58,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1244 transitions. [2024-11-16 03:04:58,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-16 03:04:58,018 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:04:58,019 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:04:58,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 03:04:58,019 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:04:58,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:04:58,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1932920135, now seen corresponding path program 1 times [2024-11-16 03:04:58,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:04:58,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718671046] [2024-11-16 03:04:58,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:04:58,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:04:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:04:58,189 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-16 03:04:58,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:04:58,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718671046] [2024-11-16 03:04:58,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718671046] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:04:58,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:04:58,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:04:58,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566054760] [2024-11-16 03:04:58,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:04:58,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:04:58,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:04:58,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:04:58,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:04:58,195 INFO L87 Difference]: Start difference. First operand 1061 states and 1244 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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) [2024-11-16 03:04:58,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:04:58,600 INFO L93 Difference]: Finished difference Result 2648 states and 3101 transitions. [2024-11-16 03:04:58,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:04:58,601 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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 135 [2024-11-16 03:04:58,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:04:58,607 INFO L225 Difference]: With dead ends: 2648 [2024-11-16 03:04:58,607 INFO L226 Difference]: Without dead ends: 1589 [2024-11-16 03:04:58,609 INFO L431 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 [2024-11-16 03:04:58,612 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 131 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 03:04:58,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 44 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 03:04:58,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1589 states. [2024-11-16 03:04:58,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1589 to 1325. [2024-11-16 03:04:58,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1325 states, 1324 states have (on average 1.1759818731117824) internal successors, (1557), 1324 states have internal predecessors, (1557), 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) [2024-11-16 03:04:58,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 1557 transitions. [2024-11-16 03:04:58,655 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 1557 transitions. Word has length 135 [2024-11-16 03:04:58,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:04:58,656 INFO L471 AbstractCegarLoop]: Abstraction has 1325 states and 1557 transitions. [2024-11-16 03:04:58,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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) [2024-11-16 03:04:58,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1557 transitions. [2024-11-16 03:04:58,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-16 03:04:58,661 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:04:58,661 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:04:58,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 03:04:58,662 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:04:58,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:04:58,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1470331320, now seen corresponding path program 1 times [2024-11-16 03:04:58,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:04:58,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219233637] [2024-11-16 03:04:58,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:04:58,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:04:58,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:04:58,830 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 03:04:58,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:04:58,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219233637] [2024-11-16 03:04:58,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219233637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:04:58,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:04:58,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:04:58,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138214697] [2024-11-16 03:04:58,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:04:58,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 03:04:58,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:04:58,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 03:04:58,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:04:58,833 INFO L87 Difference]: Start difference. First operand 1325 states and 1557 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 3 states have internal predecessors, (138), 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) [2024-11-16 03:04:59,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:04:59,414 INFO L93 Difference]: Finished difference Result 3044 states and 3618 transitions. [2024-11-16 03:04:59,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 03:04:59,415 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 3 states have internal predecessors, (138), 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 141 [2024-11-16 03:04:59,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:04:59,420 INFO L225 Difference]: With dead ends: 3044 [2024-11-16 03:04:59,421 INFO L226 Difference]: Without dead ends: 1721 [2024-11-16 03:04:59,423 INFO L431 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 [2024-11-16 03:04:59,423 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 388 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 03:04:59,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 38 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 03:04:59,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1721 states. [2024-11-16 03:04:59,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1721 to 1721. [2024-11-16 03:04:59,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1721 states, 1720 states have (on average 1.1401162790697674) internal successors, (1961), 1720 states have internal predecessors, (1961), 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) [2024-11-16 03:04:59,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1721 states to 1721 states and 1961 transitions. [2024-11-16 03:04:59,495 INFO L78 Accepts]: Start accepts. Automaton has 1721 states and 1961 transitions. Word has length 141 [2024-11-16 03:04:59,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:04:59,499 INFO L471 AbstractCegarLoop]: Abstraction has 1721 states and 1961 transitions. [2024-11-16 03:04:59,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 3 states have internal predecessors, (138), 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) [2024-11-16 03:04:59,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1721 states and 1961 transitions. [2024-11-16 03:04:59,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-16 03:04:59,502 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:04:59,502 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:04:59,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 03:04:59,503 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:04:59,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:04:59,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1375105564, now seen corresponding path program 1 times [2024-11-16 03:04:59,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:04:59,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447398895] [2024-11-16 03:04:59,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:04:59,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:04:59,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:04:59,706 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:04:59,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:04:59,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447398895] [2024-11-16 03:04:59,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447398895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:04:59,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:04:59,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:04:59,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898929299] [2024-11-16 03:04:59,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:04:59,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 03:04:59,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:04:59,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 03:04:59,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:04:59,709 INFO L87 Difference]: Start difference. First operand 1721 states and 1961 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 3 states have internal predecessors, (146), 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) [2024-11-16 03:05:00,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:05:00,251 INFO L93 Difference]: Finished difference Result 3704 states and 4248 transitions. [2024-11-16 03:05:00,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 03:05:00,252 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 3 states have internal predecessors, (146), 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 146 [2024-11-16 03:05:00,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:05:00,258 INFO L225 Difference]: With dead ends: 3704 [2024-11-16 03:05:00,258 INFO L226 Difference]: Without dead ends: 1985 [2024-11-16 03:05:00,260 INFO L431 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 [2024-11-16 03:05:00,261 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 346 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 03:05:00,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 49 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 03:05:00,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1985 states. [2024-11-16 03:05:00,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1985 to 1985. [2024-11-16 03:05:00,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1985 states, 1984 states have (on average 1.1360887096774193) internal successors, (2254), 1984 states have internal predecessors, (2254), 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) [2024-11-16 03:05:00,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1985 states to 1985 states and 2254 transitions. [2024-11-16 03:05:00,294 INFO L78 Accepts]: Start accepts. Automaton has 1985 states and 2254 transitions. Word has length 146 [2024-11-16 03:05:00,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:05:00,294 INFO L471 AbstractCegarLoop]: Abstraction has 1985 states and 2254 transitions. [2024-11-16 03:05:00,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 3 states have internal predecessors, (146), 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) [2024-11-16 03:05:00,295 INFO L276 IsEmpty]: Start isEmpty. Operand 1985 states and 2254 transitions. [2024-11-16 03:05:00,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-16 03:05:00,298 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:05:00,298 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:05:00,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 03:05:00,299 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:05:00,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:05:00,299 INFO L85 PathProgramCache]: Analyzing trace with hash -379452198, now seen corresponding path program 1 times [2024-11-16 03:05:00,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:05:00,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939126789] [2024-11-16 03:05:00,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:05:00,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:05:00,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:05:00,439 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:05:00,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:05:00,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939126789] [2024-11-16 03:05:00,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939126789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:05:00,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:05:00,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:05:00,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716870412] [2024-11-16 03:05:00,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:05:00,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:05:00,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:05:00,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:05:00,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:05:00,442 INFO L87 Difference]: Start difference. First operand 1985 states and 2254 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 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) [2024-11-16 03:05:00,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:05:00,780 INFO L93 Difference]: Finished difference Result 2384 states and 2709 transitions. [2024-11-16 03:05:00,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:05:00,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 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 171 [2024-11-16 03:05:00,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:05:00,788 INFO L225 Difference]: With dead ends: 2384 [2024-11-16 03:05:00,789 INFO L226 Difference]: Without dead ends: 2381 [2024-11-16 03:05:00,789 INFO L431 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 [2024-11-16 03:05:00,790 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 47 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 03:05:00,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 35 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 03:05:00,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2381 states. [2024-11-16 03:05:00,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2381 to 1985. [2024-11-16 03:05:00,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1985 states, 1984 states have (on average 1.1466733870967742) internal successors, (2275), 1984 states have internal predecessors, (2275), 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) [2024-11-16 03:05:00,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1985 states to 1985 states and 2275 transitions. [2024-11-16 03:05:00,825 INFO L78 Accepts]: Start accepts. Automaton has 1985 states and 2275 transitions. Word has length 171 [2024-11-16 03:05:00,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:05:00,826 INFO L471 AbstractCegarLoop]: Abstraction has 1985 states and 2275 transitions. [2024-11-16 03:05:00,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 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) [2024-11-16 03:05:00,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1985 states and 2275 transitions. [2024-11-16 03:05:00,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-16 03:05:00,831 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:05:00,831 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:05:00,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 03:05:00,831 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:05:00,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:05:00,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1669494233, now seen corresponding path program 1 times [2024-11-16 03:05:00,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:05:00,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773722259] [2024-11-16 03:05:00,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:05:00,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:05:00,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:05:01,377 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 105 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-16 03:05:01,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:05:01,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773722259] [2024-11-16 03:05:01,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773722259] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 03:05:01,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647938371] [2024-11-16 03:05:01,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:05:01,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 03:05:01,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 03:05:01,381 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 03:05:01,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 03:05:01,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:05:01,535 INFO L255 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 03:05:01,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:05:01,710 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-16 03:05:01,710 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 03:05:01,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647938371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:05:01,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 03:05:01,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-16 03:05:01,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871094130] [2024-11-16 03:05:01,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:05:01,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:05:01,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:05:01,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:05:01,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-16 03:05:01,716 INFO L87 Difference]: Start difference. First operand 1985 states and 2275 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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) [2024-11-16 03:05:02,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:05:02,097 INFO L93 Difference]: Finished difference Result 3968 states and 4548 transitions. [2024-11-16 03:05:02,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:05:02,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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 197 [2024-11-16 03:05:02,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:05:02,103 INFO L225 Difference]: With dead ends: 3968 [2024-11-16 03:05:02,103 INFO L226 Difference]: Without dead ends: 1985 [2024-11-16 03:05:02,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-16 03:05:02,107 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 29 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 03:05:02,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 170 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 03:05:02,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1985 states. [2024-11-16 03:05:02,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1985 to 1721. [2024-11-16 03:05:02,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1721 states, 1720 states have (on average 1.116860465116279) internal successors, (1921), 1720 states have internal predecessors, (1921), 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) [2024-11-16 03:05:02,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1721 states to 1721 states and 1921 transitions. [2024-11-16 03:05:02,137 INFO L78 Accepts]: Start accepts. Automaton has 1721 states and 1921 transitions. Word has length 197 [2024-11-16 03:05:02,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:05:02,138 INFO L471 AbstractCegarLoop]: Abstraction has 1721 states and 1921 transitions. [2024-11-16 03:05:02,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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) [2024-11-16 03:05:02,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1721 states and 1921 transitions. [2024-11-16 03:05:02,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-16 03:05:02,142 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:05:02,143 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:05:02,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-16 03:05:02,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 03:05:02,344 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:05:02,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:05:02,344 INFO L85 PathProgramCache]: Analyzing trace with hash 598675141, now seen corresponding path program 1 times [2024-11-16 03:05:02,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:05:02,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720219700] [2024-11-16 03:05:02,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:05:02,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:05:02,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:05:02,866 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 140 proven. 16 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-16 03:05:02,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:05:02,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720219700] [2024-11-16 03:05:02,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720219700] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 03:05:02,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932882896] [2024-11-16 03:05:02,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:05:02,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 03:05:02,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 03:05:02,870 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 03:05:02,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 03:05:03,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:05:03,002 INFO L255 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 03:05:03,011 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:05:03,182 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-16 03:05:03,183 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 03:05:03,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932882896] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:05:03,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 03:05:03,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-16 03:05:03,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177544022] [2024-11-16 03:05:03,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:05:03,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:05:03,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:05:03,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:05:03,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-16 03:05:03,185 INFO L87 Difference]: Start difference. First operand 1721 states and 1921 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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) [2024-11-16 03:05:03,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:05:03,539 INFO L93 Difference]: Finished difference Result 3437 states and 3838 transitions. [2024-11-16 03:05:03,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:05:03,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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 216 [2024-11-16 03:05:03,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:05:03,541 INFO L225 Difference]: With dead ends: 3437 [2024-11-16 03:05:03,542 INFO L226 Difference]: Without dead ends: 0 [2024-11-16 03:05:03,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-16 03:05:03,545 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 29 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 03:05:03,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 173 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 03:05:03,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-16 03:05:03,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-16 03:05:03,546 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) [2024-11-16 03:05:03,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-16 03:05:03,547 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 216 [2024-11-16 03:05:03,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:05:03,547 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-16 03:05:03,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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) [2024-11-16 03:05:03,548 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-16 03:05:03,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-16 03:05:03,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 03:05:03,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-16 03:05:03,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-16 03:05:03,755 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:05:03,757 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-16 03:05:03,950 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 03:05:03,967 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 03:05:03 BoogieIcfgContainer [2024-11-16 03:05:03,967 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 03:05:03,968 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 03:05:03,968 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 03:05:03,968 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 03:05:03,969 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:04:54" (3/4) ... [2024-11-16 03:05:03,980 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-16 03:05:04,011 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-16 03:05:04,011 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-16 03:05:04,012 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-16 03:05:04,013 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-16 03:05:04,166 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 03:05:04,166 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-16 03:05:04,166 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 03:05:04,167 INFO L158 Benchmark]: Toolchain (without parser) took 12023.25ms. Allocated memory was 180.4MB in the beginning and 369.1MB in the end (delta: 188.7MB). Free memory was 121.7MB in the beginning and 302.1MB in the end (delta: -180.4MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. [2024-11-16 03:05:04,167 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 180.4MB. Free memory is still 141.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 03:05:04,168 INFO L158 Benchmark]: CACSL2BoogieTranslator took 628.86ms. Allocated memory is still 180.4MB. Free memory was 121.2MB in the beginning and 91.2MB in the end (delta: 30.0MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-16 03:05:04,169 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.07ms. Allocated memory is still 180.4MB. Free memory was 91.2MB in the beginning and 85.0MB in the end (delta: 6.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 03:05:04,169 INFO L158 Benchmark]: Boogie Preprocessor took 103.46ms. Allocated memory is still 180.4MB. Free memory was 85.0MB in the beginning and 80.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 03:05:04,169 INFO L158 Benchmark]: IcfgBuilder took 1193.37ms. Allocated memory was 180.4MB in the beginning and 253.8MB in the end (delta: 73.4MB). Free memory was 80.8MB in the beginning and 140.0MB in the end (delta: -59.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-16 03:05:04,170 INFO L158 Benchmark]: TraceAbstraction took 9820.73ms. Allocated memory was 253.8MB in the beginning and 369.1MB in the end (delta: 115.3MB). Free memory was 138.9MB in the beginning and 315.7MB in the end (delta: -176.8MB). Peak memory consumption was 140.9MB. Max. memory is 16.1GB. [2024-11-16 03:05:04,170 INFO L158 Benchmark]: Witness Printer took 198.54ms. Allocated memory is still 369.1MB. Free memory was 315.7MB in the beginning and 302.1MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 03:05:04,172 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.18ms. Allocated memory is still 180.4MB. Free memory is still 141.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 628.86ms. Allocated memory is still 180.4MB. Free memory was 121.2MB in the beginning and 91.2MB in the end (delta: 30.0MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.07ms. Allocated memory is still 180.4MB. Free memory was 91.2MB in the beginning and 85.0MB in the end (delta: 6.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 103.46ms. Allocated memory is still 180.4MB. Free memory was 85.0MB in the beginning and 80.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 1193.37ms. Allocated memory was 180.4MB in the beginning and 253.8MB in the end (delta: 73.4MB). Free memory was 80.8MB in the beginning and 140.0MB in the end (delta: -59.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 9820.73ms. Allocated memory was 253.8MB in the beginning and 369.1MB in the end (delta: 115.3MB). Free memory was 138.9MB in the beginning and 315.7MB in the end (delta: -176.8MB). Peak memory consumption was 140.9MB. Max. memory is 16.1GB. * Witness Printer took 198.54ms. Allocated memory is still 369.1MB. Free memory was 315.7MB in the beginning and 302.1MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. 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: 513]: 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, 201 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.5s, OverallIterations: 10, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1451 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1451 mSDsluCounter, 738 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 82 mSDsCounter, 616 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3772 IncrementalHoareTripleChecker+Invalid, 4388 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 616 mSolverCounterUnsat, 656 mSDtfsCounter, 3772 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 442 GetRequests, 421 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1985occurred in iteration=7, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 924 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1892 NumberOfCodeBlocks, 1892 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1880 ConstructedInterpolants, 0 QuantifiedInterpolants, 7412 SizeOfPredicates, 0 NumberOfNonLiveVariables, 807 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 891/923 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 593]: Location Invariant Derived location invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-16 03:05:04,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE