./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem02_label35.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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/Problem02_label35.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 d3e3930727d0c60d79f1b553922b6ffa9dda0949b70cfe091b5b493dd5b1378e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 18:37:55,828 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 18:37:55,902 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 18:37:55,908 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 18:37:55,909 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 18:37:55,942 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 18:37:55,943 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 18:37:55,943 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 18:37:55,944 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 18:37:55,945 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 18:37:55,945 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 18:37:55,946 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 18:37:55,946 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 18:37:55,947 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 18:37:55,949 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 18:37:55,949 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 18:37:55,950 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 18:37:55,950 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 18:37:55,950 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 18:37:55,950 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 18:37:55,951 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 18:37:55,951 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 18:37:55,952 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 18:37:55,952 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 18:37:55,952 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 18:37:55,953 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 18:37:55,953 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 18:37:55,953 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 18:37:55,954 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 18:37:55,956 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 18:37:55,957 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 18:37:55,957 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 18:37:55,958 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 18:37:55,958 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 18:37:55,958 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 18:37:55,959 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 18:37:55,959 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 18:37:55,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 18:37:55,959 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 18:37:55,960 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 18:37:55,960 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 18:37:55,960 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 18:37:55,960 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 -> d3e3930727d0c60d79f1b553922b6ffa9dda0949b70cfe091b5b493dd5b1378e [2024-11-09 18:37:56,226 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 18:37:56,250 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 18:37:56,254 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 18:37:56,256 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 18:37:56,256 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 18:37:56,257 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label35.c [2024-11-09 18:37:57,726 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 18:37:58,019 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 18:37:58,020 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label35.c [2024-11-09 18:37:58,035 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a768e6cb/c791a488b9ec4f8eb249502ed13f438b/FLAGa6e4ca00f [2024-11-09 18:37:58,303 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a768e6cb/c791a488b9ec4f8eb249502ed13f438b [2024-11-09 18:37:58,305 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 18:37:58,306 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 18:37:58,307 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 18:37:58,308 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 18:37:58,313 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 18:37:58,313 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:37:58" (1/1) ... [2024-11-09 18:37:58,314 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cd35aaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:58, skipping insertion in model container [2024-11-09 18:37:58,314 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:37:58" (1/1) ... [2024-11-09 18:37:58,363 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 18:37:58,738 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/Problem02_label35.c[16104,16117] [2024-11-09 18:37:58,772 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 18:37:58,785 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 18:37:58,873 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/Problem02_label35.c[16104,16117] [2024-11-09 18:37:58,894 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 18:37:58,912 INFO L204 MainTranslator]: Completed translation [2024-11-09 18:37:58,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:58 WrapperNode [2024-11-09 18:37:58,913 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 18:37:58,914 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 18:37:58,915 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 18:37:58,915 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 18:37:58,926 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:58" (1/1) ... [2024-11-09 18:37:58,954 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:58" (1/1) ... [2024-11-09 18:37:59,004 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 668 [2024-11-09 18:37:59,005 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 18:37:59,005 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 18:37:59,006 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 18:37:59,006 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 18:37:59,015 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:58" (1/1) ... [2024-11-09 18:37:59,015 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:58" (1/1) ... [2024-11-09 18:37:59,020 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:58" (1/1) ... [2024-11-09 18:37:59,049 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-09 18:37:59,049 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:58" (1/1) ... [2024-11-09 18:37:59,049 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:58" (1/1) ... [2024-11-09 18:37:59,068 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:58" (1/1) ... [2024-11-09 18:37:59,071 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:58" (1/1) ... [2024-11-09 18:37:59,075 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:58" (1/1) ... [2024-11-09 18:37:59,078 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:58" (1/1) ... [2024-11-09 18:37:59,086 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 18:37:59,091 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 18:37:59,091 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 18:37:59,091 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 18:37:59,092 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:58" (1/1) ... [2024-11-09 18:37:59,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 18:37:59,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:37:59,151 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-09 18:37:59,155 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-09 18:37:59,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 18:37:59,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 18:37:59,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 18:37:59,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 18:37:59,289 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 18:37:59,291 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 18:38:00,306 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-09 18:38:00,306 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 18:38:00,327 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 18:38:00,328 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 18:38:00,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:38:00 BoogieIcfgContainer [2024-11-09 18:38:00,328 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 18:38:00,330 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 18:38:00,333 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 18:38:00,336 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 18:38:00,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:37:58" (1/3) ... [2024-11-09 18:38:00,338 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e784e87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:38:00, skipping insertion in model container [2024-11-09 18:38:00,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:58" (2/3) ... [2024-11-09 18:38:00,338 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e784e87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:38:00, skipping insertion in model container [2024-11-09 18:38:00,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:38:00" (3/3) ... [2024-11-09 18:38:00,340 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label35.c [2024-11-09 18:38:00,357 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 18:38:00,357 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 18:38:00,435 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 18:38:00,442 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;@7cb8fa6e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 18:38:00,443 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 18:38:00,449 INFO L276 IsEmpty]: Start isEmpty. Operand has 230 states, 228 states have (on average 1.6578947368421053) internal successors, (378), 229 states have internal predecessors, (378), 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-09 18:38:00,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-09 18:38:00,460 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:38:00,461 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] [2024-11-09 18:38:00,461 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:38:00,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:38:00,467 INFO L85 PathProgramCache]: Analyzing trace with hash -344662023, now seen corresponding path program 1 times [2024-11-09 18:38:00,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:38:00,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216394321] [2024-11-09 18:38:00,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:38:00,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:38:00,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:38:01,070 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-09 18:38:01,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:38:01,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216394321] [2024-11-09 18:38:01,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216394321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:38:01,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:38:01,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 18:38:01,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022159794] [2024-11-09 18:38:01,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:38:01,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:38:01,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:38:01,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:38:01,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:38:01,114 INFO L87 Difference]: Start difference. First operand has 230 states, 228 states have (on average 1.6578947368421053) internal successors, (378), 229 states have internal predecessors, (378), 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 32.0) internal successors, (96), 2 states have internal predecessors, (96), 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-09 18:38:01,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:38:01,881 INFO L93 Difference]: Finished difference Result 602 states and 1036 transitions. [2024-11-09 18:38:01,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:38:01,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 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 96 [2024-11-09 18:38:01,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:38:01,902 INFO L225 Difference]: With dead ends: 602 [2024-11-09 18:38:01,902 INFO L226 Difference]: Without dead ends: 308 [2024-11-09 18:38:01,909 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-09 18:38:01,915 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 150 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 18:38:01,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 93 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 18:38:01,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-11-09 18:38:01,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2024-11-09 18:38:01,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 1.521172638436482) internal successors, (467), 307 states have internal predecessors, (467), 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-09 18:38:01,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 467 transitions. [2024-11-09 18:38:01,971 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 467 transitions. Word has length 96 [2024-11-09 18:38:01,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:38:01,975 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 467 transitions. [2024-11-09 18:38:01,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 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-09 18:38:01,975 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 467 transitions. [2024-11-09 18:38:01,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-09 18:38:01,979 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:38:01,979 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:38:01,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 18:38:01,980 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:38:01,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:38:01,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1791091324, now seen corresponding path program 1 times [2024-11-09 18:38:01,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:38:01,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418667888] [2024-11-09 18:38:01,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:38:01,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:38:02,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:38:02,158 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:38:02,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:38:02,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418667888] [2024-11-09 18:38:02,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418667888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:38:02,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:38:02,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 18:38:02,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861343479] [2024-11-09 18:38:02,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:38:02,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:38:02,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:38:02,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:38:02,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:38:02,164 INFO L87 Difference]: Start difference. First operand 308 states and 467 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 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-09 18:38:02,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:38:02,655 INFO L93 Difference]: Finished difference Result 911 states and 1384 transitions. [2024-11-09 18:38:02,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:38:02,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 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 108 [2024-11-09 18:38:02,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:38:02,659 INFO L225 Difference]: With dead ends: 911 [2024-11-09 18:38:02,659 INFO L226 Difference]: Without dead ends: 605 [2024-11-09 18:38:02,660 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-09 18:38:02,661 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 194 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 18:38:02,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 75 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 18:38:02,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2024-11-09 18:38:02,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 601. [2024-11-09 18:38:02,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 600 states have (on average 1.4733333333333334) internal successors, (884), 600 states have internal predecessors, (884), 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-09 18:38:02,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 884 transitions. [2024-11-09 18:38:02,695 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 884 transitions. Word has length 108 [2024-11-09 18:38:02,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:38:02,695 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 884 transitions. [2024-11-09 18:38:02,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 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-09 18:38:02,696 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 884 transitions. [2024-11-09 18:38:02,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-09 18:38:02,704 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:38:02,704 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 18:38:02,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 18:38:02,705 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:38:02,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:38:02,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1518050744, now seen corresponding path program 1 times [2024-11-09 18:38:02,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:38:02,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417715984] [2024-11-09 18:38:02,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:38:02,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:38:02,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:38:02,870 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 18:38:02,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:38:02,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417715984] [2024-11-09 18:38:02,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417715984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:38:02,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:38:02,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 18:38:02,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031392539] [2024-11-09 18:38:02,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:38:02,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:38:02,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:38:02,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:38:02,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:38:02,875 INFO L87 Difference]: Start difference. First operand 601 states and 884 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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-09 18:38:03,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:38:03,123 INFO L93 Difference]: Finished difference Result 1049 states and 1550 transitions. [2024-11-09 18:38:03,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:38:03,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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 113 [2024-11-09 18:38:03,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:38:03,126 INFO L225 Difference]: With dead ends: 1049 [2024-11-09 18:38:03,126 INFO L226 Difference]: Without dead ends: 450 [2024-11-09 18:38:03,127 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-09 18:38:03,128 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 201 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 18:38:03,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 25 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 18:38:03,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2024-11-09 18:38:03,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2024-11-09 18:38:03,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 449 states have (on average 1.4209354120267261) internal successors, (638), 449 states have internal predecessors, (638), 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-09 18:38:03,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 638 transitions. [2024-11-09 18:38:03,156 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 638 transitions. Word has length 113 [2024-11-09 18:38:03,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:38:03,157 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 638 transitions. [2024-11-09 18:38:03,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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-09 18:38:03,160 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 638 transitions. [2024-11-09 18:38:03,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-09 18:38:03,163 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:38:03,163 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 18:38:03,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 18:38:03,164 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:38:03,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:38:03,164 INFO L85 PathProgramCache]: Analyzing trace with hash -275765355, now seen corresponding path program 1 times [2024-11-09 18:38:03,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:38:03,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134164102] [2024-11-09 18:38:03,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:38:03,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:38:03,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:38:03,327 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:38:03,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:38:03,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134164102] [2024-11-09 18:38:03,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134164102] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:38:03,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:38:03,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 18:38:03,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887038179] [2024-11-09 18:38:03,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:38:03,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:38:03,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:38:03,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:38:03,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:38:03,330 INFO L87 Difference]: Start difference. First operand 450 states and 638 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 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-09 18:38:03,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:38:03,708 INFO L93 Difference]: Finished difference Result 1335 states and 1898 transitions. [2024-11-09 18:38:03,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:38:03,709 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 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 115 [2024-11-09 18:38:03,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:38:03,714 INFO L225 Difference]: With dead ends: 1335 [2024-11-09 18:38:03,714 INFO L226 Difference]: Without dead ends: 887 [2024-11-09 18:38:03,717 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-09 18:38:03,719 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 146 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 18:38:03,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 87 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 18:38:03,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2024-11-09 18:38:03,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 741. [2024-11-09 18:38:03,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 740 states have (on average 1.3783783783783783) internal successors, (1020), 740 states have internal predecessors, (1020), 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-09 18:38:03,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1020 transitions. [2024-11-09 18:38:03,736 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1020 transitions. Word has length 115 [2024-11-09 18:38:03,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:38:03,738 INFO L471 AbstractCegarLoop]: Abstraction has 741 states and 1020 transitions. [2024-11-09 18:38:03,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 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-09 18:38:03,739 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1020 transitions. [2024-11-09 18:38:03,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 18:38:03,742 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:38:03,742 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 18:38:03,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 18:38:03,742 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:38:03,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:38:03,743 INFO L85 PathProgramCache]: Analyzing trace with hash -2106066805, now seen corresponding path program 1 times [2024-11-09 18:38:03,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:38:03,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190416920] [2024-11-09 18:38:03,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:38:03,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:38:03,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:38:03,837 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:38:03,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:38:03,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190416920] [2024-11-09 18:38:03,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190416920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:38:03,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:38:03,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 18:38:03,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900987882] [2024-11-09 18:38:03,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:38:03,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:38:03,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:38:03,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:38:03,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:38:03,840 INFO L87 Difference]: Start difference. First operand 741 states and 1020 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 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-09 18:38:04,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:38:04,261 INFO L93 Difference]: Finished difference Result 2188 states and 3017 transitions. [2024-11-09 18:38:04,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:38:04,262 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 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-09 18:38:04,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:38:04,266 INFO L225 Difference]: With dead ends: 2188 [2024-11-09 18:38:04,266 INFO L226 Difference]: Without dead ends: 1449 [2024-11-09 18:38:04,267 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-09 18:38:04,268 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 157 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 18:38:04,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 67 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 18:38:04,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1449 states. [2024-11-09 18:38:04,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1449 to 1308. [2024-11-09 18:38:04,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1308 states, 1307 states have (on average 1.306044376434583) internal successors, (1707), 1307 states have internal predecessors, (1707), 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-09 18:38:04,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1308 states to 1308 states and 1707 transitions. [2024-11-09 18:38:04,290 INFO L78 Accepts]: Start accepts. Automaton has 1308 states and 1707 transitions. Word has length 119 [2024-11-09 18:38:04,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:38:04,291 INFO L471 AbstractCegarLoop]: Abstraction has 1308 states and 1707 transitions. [2024-11-09 18:38:04,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 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-09 18:38:04,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1308 states and 1707 transitions. [2024-11-09 18:38:04,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-09 18:38:04,294 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:38:04,294 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 18:38:04,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 18:38:04,294 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:38:04,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:38:04,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1668438999, now seen corresponding path program 1 times [2024-11-09 18:38:04,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:38:04,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202456191] [2024-11-09 18:38:04,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:38:04,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:38:04,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:38:04,413 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-09 18:38:04,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:38:04,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202456191] [2024-11-09 18:38:04,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202456191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:38:04,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:38:04,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:38:04,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783749873] [2024-11-09 18:38:04,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:38:04,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:38:04,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:38:04,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:38:04,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:38:04,415 INFO L87 Difference]: Start difference. First operand 1308 states and 1707 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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-09 18:38:04,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:38:04,870 INFO L93 Difference]: Finished difference Result 3597 states and 4681 transitions. [2024-11-09 18:38:04,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:38:04,872 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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 147 [2024-11-09 18:38:04,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:38:04,872 INFO L225 Difference]: With dead ends: 3597 [2024-11-09 18:38:04,872 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 18:38:04,877 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-09 18:38:04,879 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 136 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 18:38:04,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 73 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 18:38:04,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 18:38:04,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 18:38:04,882 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-09 18:38:04,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 18:38:04,882 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 147 [2024-11-09 18:38:04,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:38:04,883 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 18:38:04,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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-09 18:38:04,883 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 18:38:04,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 18:38:04,888 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 18:38:04,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 18:38:04,893 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-09 18:38:04,897 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 18:38:05,008 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 18:38:05,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 06:38:05 BoogieIcfgContainer [2024-11-09 18:38:05,023 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 18:38:05,023 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 18:38:05,024 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 18:38:05,024 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 18:38:05,024 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:38:00" (3/4) ... [2024-11-09 18:38:05,026 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-09 18:38:05,043 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-09 18:38:05,044 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 18:38:05,044 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 18:38:05,045 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 18:38:05,201 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 18:38:05,201 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 18:38:05,202 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 18:38:05,202 INFO L158 Benchmark]: Toolchain (without parser) took 6896.06ms. Allocated memory was 132.1MB in the beginning and 230.7MB in the end (delta: 98.6MB). Free memory was 74.2MB in the beginning and 189.1MB in the end (delta: -114.9MB). Peak memory consumption was 118.5MB. Max. memory is 16.1GB. [2024-11-09 18:38:05,203 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 132.1MB. Free memory is still 101.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 18:38:05,203 INFO L158 Benchmark]: CACSL2BoogieTranslator took 606.22ms. Allocated memory was 132.1MB in the beginning and 172.0MB in the end (delta: 39.8MB). Free memory was 74.2MB in the beginning and 129.5MB in the end (delta: -55.3MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. [2024-11-09 18:38:05,203 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.42ms. Allocated memory is still 172.0MB. Free memory was 129.5MB in the beginning and 124.5MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 18:38:05,204 INFO L158 Benchmark]: Boogie Preprocessor took 81.03ms. Allocated memory is still 172.0MB. Free memory was 124.5MB in the beginning and 119.9MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 18:38:05,204 INFO L158 Benchmark]: IcfgBuilder took 1237.74ms. Allocated memory is still 172.0MB. Free memory was 119.9MB in the beginning and 96.5MB in the end (delta: 23.4MB). Peak memory consumption was 50.7MB. Max. memory is 16.1GB. [2024-11-09 18:38:05,204 INFO L158 Benchmark]: TraceAbstraction took 4692.65ms. Allocated memory was 172.0MB in the beginning and 230.7MB in the end (delta: 58.7MB). Free memory was 96.5MB in the beginning and 66.6MB in the end (delta: 29.9MB). Peak memory consumption was 89.7MB. Max. memory is 16.1GB. [2024-11-09 18:38:05,204 INFO L158 Benchmark]: Witness Printer took 178.28ms. Allocated memory is still 230.7MB. Free memory was 66.6MB in the beginning and 189.1MB in the end (delta: -122.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 18:38:05,206 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 132.1MB. Free memory is still 101.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 606.22ms. Allocated memory was 132.1MB in the beginning and 172.0MB in the end (delta: 39.8MB). Free memory was 74.2MB in the beginning and 129.5MB in the end (delta: -55.3MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 90.42ms. Allocated memory is still 172.0MB. Free memory was 129.5MB in the beginning and 124.5MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.03ms. Allocated memory is still 172.0MB. Free memory was 124.5MB in the beginning and 119.9MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 1237.74ms. Allocated memory is still 172.0MB. Free memory was 119.9MB in the beginning and 96.5MB in the end (delta: 23.4MB). Peak memory consumption was 50.7MB. Max. memory is 16.1GB. * TraceAbstraction took 4692.65ms. Allocated memory was 172.0MB in the beginning and 230.7MB in the end (delta: 58.7MB). Free memory was 96.5MB in the beginning and 66.6MB in the end (delta: 29.9MB). Peak memory consumption was 89.7MB. Max. memory is 16.1GB. * Witness Printer took 178.28ms. Allocated memory is still 230.7MB. Free memory was 66.6MB in the beginning and 189.1MB in the end (delta: -122.5MB). Peak memory consumption was 10.5MB. 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: 464]: 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, 230 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.5s, OverallIterations: 6, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 984 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 984 mSDsluCounter, 420 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 84 mSDsCounter, 372 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2047 IncrementalHoareTripleChecker+Invalid, 2419 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 372 mSolverCounterUnsat, 336 mSDtfsCounter, 2047 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1308occurred in iteration=5, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 291 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 698 NumberOfCodeBlocks, 698 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 692 ConstructedInterpolants, 0 QuantifiedInterpolants, 1058 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 148/148 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: 616]: Location Invariant Derived location invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-09 18:38:05,231 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