./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem10_label05.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/Problem10_label05.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 7fb47f955ea6ba1edf33456e69e9d22d4cc1ecd78cb5e200db0c0a5026f9dd33 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 19:19:29,693 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 19:19:29,769 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 19:19:29,773 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 19:19:29,774 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 19:19:29,801 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 19:19:29,803 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 19:19:29,804 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 19:19:29,805 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 19:19:29,806 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 19:19:29,806 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 19:19:29,806 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 19:19:29,807 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 19:19:29,809 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 19:19:29,809 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 19:19:29,809 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 19:19:29,810 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 19:19:29,810 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 19:19:29,810 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 19:19:29,811 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 19:19:29,811 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 19:19:29,815 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 19:19:29,815 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 19:19:29,815 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 19:19:29,816 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 19:19:29,816 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 19:19:29,816 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 19:19:29,816 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 19:19:29,817 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 19:19:29,817 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 19:19:29,817 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 19:19:29,817 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 19:19:29,818 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:19:29,818 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 19:19:29,818 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 19:19:29,818 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 19:19:29,819 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 19:19:29,819 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 19:19:29,819 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 19:19:29,819 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 19:19:29,820 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 19:19:29,821 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 19:19:29,822 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 -> 7fb47f955ea6ba1edf33456e69e9d22d4cc1ecd78cb5e200db0c0a5026f9dd33 [2024-11-09 19:19:30,072 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 19:19:30,096 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 19:19:30,100 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 19:19:30,101 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 19:19:30,102 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 19:19:30,103 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label05.c [2024-11-09 19:19:31,483 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 19:19:31,768 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 19:19:31,772 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label05.c [2024-11-09 19:19:31,788 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21c85084a/3baa3024f24b40c492a887a1ce4c66ab/FLAG69964e2d0 [2024-11-09 19:19:31,804 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21c85084a/3baa3024f24b40c492a887a1ce4c66ab [2024-11-09 19:19:31,808 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 19:19:31,810 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 19:19:31,812 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 19:19:31,813 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 19:19:31,819 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 19:19:31,820 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:19:31" (1/1) ... [2024-11-09 19:19:31,820 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50154b30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:19:31, skipping insertion in model container [2024-11-09 19:19:31,821 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:19:31" (1/1) ... [2024-11-09 19:19:31,867 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 19:19:32,120 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/Problem10_label05.c[5981,5994] [2024-11-09 19:19:32,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:19:32,273 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 19:19:32,301 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/Problem10_label05.c[5981,5994] [2024-11-09 19:19:32,342 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:19:32,361 INFO L204 MainTranslator]: Completed translation [2024-11-09 19:19:32,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:19:32 WrapperNode [2024-11-09 19:19:32,362 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 19:19:32,363 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 19:19:32,363 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 19:19:32,363 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 19:19:32,370 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:19:32" (1/1) ... [2024-11-09 19:19:32,392 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:19:32" (1/1) ... [2024-11-09 19:19:32,463 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 597 [2024-11-09 19:19:32,463 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 19:19:32,464 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 19:19:32,464 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 19:19:32,464 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 19:19:32,475 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:19:32" (1/1) ... [2024-11-09 19:19:32,475 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:19:32" (1/1) ... [2024-11-09 19:19:32,481 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:19:32" (1/1) ... [2024-11-09 19:19:32,525 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 19:19:32,525 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:19:32" (1/1) ... [2024-11-09 19:19:32,525 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:19:32" (1/1) ... [2024-11-09 19:19:32,548 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:19:32" (1/1) ... [2024-11-09 19:19:32,550 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:19:32" (1/1) ... [2024-11-09 19:19:32,553 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:19:32" (1/1) ... [2024-11-09 19:19:32,556 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:19:32" (1/1) ... [2024-11-09 19:19:32,562 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 19:19:32,563 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 19:19:32,563 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 19:19:32,563 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 19:19:32,564 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:19:32" (1/1) ... [2024-11-09 19:19:32,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:19:32,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:19:32,601 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 19:19:32,607 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 19:19:32,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 19:19:32,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 19:19:32,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 19:19:32,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 19:19:32,721 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 19:19:32,723 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 19:19:33,857 INFO L? ?]: Removed 158 outVars from TransFormulas that were not future-live. [2024-11-09 19:19:33,857 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 19:19:33,882 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 19:19:33,883 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 19:19:33,884 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:19:33 BoogieIcfgContainer [2024-11-09 19:19:33,884 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 19:19:33,886 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 19:19:33,887 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 19:19:33,890 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 19:19:33,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:19:31" (1/3) ... [2024-11-09 19:19:33,892 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e8c6a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:19:33, skipping insertion in model container [2024-11-09 19:19:33,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:19:32" (2/3) ... [2024-11-09 19:19:33,893 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e8c6a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:19:33, skipping insertion in model container [2024-11-09 19:19:33,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:19:33" (3/3) ... [2024-11-09 19:19:33,895 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label05.c [2024-11-09 19:19:33,913 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 19:19:33,914 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 19:19:33,979 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 19:19:33,984 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;@195eb8bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 19:19:33,985 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 19:19:33,991 INFO L276 IsEmpty]: Start isEmpty. Operand has 209 states, 207 states have (on average 2.033816425120773) internal successors, (421), 208 states have internal predecessors, (421), 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 19:19:34,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 19:19:34,000 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:19:34,001 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] [2024-11-09 19:19:34,001 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:19:34,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:19:34,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1756134157, now seen corresponding path program 1 times [2024-11-09 19:19:34,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:19:34,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348415570] [2024-11-09 19:19:34,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:19:34,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:19:34,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:19:34,596 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 19:19:34,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:19:34,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348415570] [2024-11-09 19:19:34,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348415570] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:19:34,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:19:34,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:19:34,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693333554] [2024-11-09 19:19:34,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:19:34,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:19:34,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:19:34,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:19:34,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:19:34,635 INFO L87 Difference]: Start difference. First operand has 209 states, 207 states have (on average 2.033816425120773) internal successors, (421), 208 states have internal predecessors, (421), 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 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 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 19:19:36,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:19:36,007 INFO L93 Difference]: Finished difference Result 703 states and 1551 transitions. [2024-11-09 19:19:36,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:19:36,010 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 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 54 [2024-11-09 19:19:36,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:19:36,025 INFO L225 Difference]: With dead ends: 703 [2024-11-09 19:19:36,026 INFO L226 Difference]: Without dead ends: 425 [2024-11-09 19:19:36,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:19:36,033 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 691 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 290 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 1195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 290 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 19:19:36,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [691 Valid, 50 Invalid, 1195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [290 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 19:19:36,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2024-11-09 19:19:36,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 425. [2024-11-09 19:19:36,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 424 states have (on average 1.903301886792453) internal successors, (807), 424 states have internal predecessors, (807), 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 19:19:36,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 807 transitions. [2024-11-09 19:19:36,090 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 807 transitions. Word has length 54 [2024-11-09 19:19:36,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:19:36,091 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 807 transitions. [2024-11-09 19:19:36,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 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 19:19:36,092 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 807 transitions. [2024-11-09 19:19:36,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-09 19:19:36,101 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:19:36,101 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-09 19:19:36,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 19:19:36,102 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:19:36,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:19:36,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1508408255, now seen corresponding path program 1 times [2024-11-09 19:19:36,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:19:36,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4413770] [2024-11-09 19:19:36,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:19:36,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:19:36,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:19:36,563 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-09 19:19:36,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:19:36,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4413770] [2024-11-09 19:19:36,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4413770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:19:36,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:19:36,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:19:36,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817964606] [2024-11-09 19:19:36,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:19:36,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:19:36,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:19:36,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:19:36,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:19:36,570 INFO L87 Difference]: Start difference. First operand 425 states and 807 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 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 19:19:37,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:19:37,219 INFO L93 Difference]: Finished difference Result 988 states and 1967 transitions. [2024-11-09 19:19:37,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:19:37,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 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 237 [2024-11-09 19:19:37,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:19:37,224 INFO L225 Difference]: With dead ends: 988 [2024-11-09 19:19:37,224 INFO L226 Difference]: Without dead ends: 705 [2024-11-09 19:19:37,225 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 19:19:37,226 INFO L432 NwaCegarLoop]: 298 mSDtfsCounter, 164 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:19:37,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 305 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 19:19:37,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2024-11-09 19:19:37,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 565. [2024-11-09 19:19:37,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 564 states have (on average 1.8368794326241136) internal successors, (1036), 564 states have internal predecessors, (1036), 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 19:19:37,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 1036 transitions. [2024-11-09 19:19:37,255 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 1036 transitions. Word has length 237 [2024-11-09 19:19:37,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:19:37,259 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 1036 transitions. [2024-11-09 19:19:37,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 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 19:19:37,259 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 1036 transitions. [2024-11-09 19:19:37,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-09 19:19:37,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:19:37,271 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-09 19:19:37,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 19:19:37,273 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:19:37,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:19:37,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1522155665, now seen corresponding path program 1 times [2024-11-09 19:19:37,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:19:37,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485880229] [2024-11-09 19:19:37,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:19:37,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:19:37,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:19:37,541 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:19:37,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:19:37,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485880229] [2024-11-09 19:19:37,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485880229] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:19:37,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:19:37,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:19:37,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651028818] [2024-11-09 19:19:37,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:19:37,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:19:37,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:19:37,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:19:37,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:19:37,547 INFO L87 Difference]: Start difference. First operand 565 states and 1036 transitions. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 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 19:19:38,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:19:38,143 INFO L93 Difference]: Finished difference Result 1128 states and 2135 transitions. [2024-11-09 19:19:38,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:19:38,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 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 243 [2024-11-09 19:19:38,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:19:38,149 INFO L225 Difference]: With dead ends: 1128 [2024-11-09 19:19:38,149 INFO L226 Difference]: Without dead ends: 705 [2024-11-09 19:19:38,150 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 19:19:38,151 INFO L432 NwaCegarLoop]: 287 mSDtfsCounter, 97 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:19:38,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 294 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 19:19:38,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2024-11-09 19:19:38,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 705. [2024-11-09 19:19:38,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 704 states have (on average 1.7897727272727273) internal successors, (1260), 704 states have internal predecessors, (1260), 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 19:19:38,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 1260 transitions. [2024-11-09 19:19:38,184 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 1260 transitions. Word has length 243 [2024-11-09 19:19:38,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:19:38,186 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 1260 transitions. [2024-11-09 19:19:38,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 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 19:19:38,187 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 1260 transitions. [2024-11-09 19:19:38,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-09 19:19:38,191 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:19:38,191 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2024-11-09 19:19:38,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 19:19:38,192 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:19:38,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:19:38,193 INFO L85 PathProgramCache]: Analyzing trace with hash 381081445, now seen corresponding path program 1 times [2024-11-09 19:19:38,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:19:38,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660715801] [2024-11-09 19:19:38,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:19:38,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:19:38,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:19:38,672 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:19:38,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:19:38,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660715801] [2024-11-09 19:19:38,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660715801] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:19:38,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:19:38,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 19:19:38,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626926091] [2024-11-09 19:19:38,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:19:38,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 19:19:38,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:19:38,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 19:19:38,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-09 19:19:38,677 INFO L87 Difference]: Start difference. First operand 705 states and 1260 transitions. Second operand has 7 states, 7 states have (on average 36.0) internal successors, (252), 6 states have internal predecessors, (252), 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 19:19:39,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:19:39,234 INFO L93 Difference]: Finished difference Result 1324 states and 2350 transitions. [2024-11-09 19:19:39,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 19:19:39,235 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 36.0) internal successors, (252), 6 states have internal predecessors, (252), 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 252 [2024-11-09 19:19:39,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:19:39,238 INFO L225 Difference]: With dead ends: 1324 [2024-11-09 19:19:39,238 INFO L226 Difference]: Without dead ends: 705 [2024-11-09 19:19:39,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-09 19:19:39,240 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 217 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:19:39,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 23 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 19:19:39,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2024-11-09 19:19:39,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 705. [2024-11-09 19:19:39,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 704 states have (on average 1.7855113636363635) internal successors, (1257), 704 states have internal predecessors, (1257), 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 19:19:39,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 1257 transitions. [2024-11-09 19:19:39,259 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 1257 transitions. Word has length 252 [2024-11-09 19:19:39,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:19:39,259 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 1257 transitions. [2024-11-09 19:19:39,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.0) internal successors, (252), 6 states have internal predecessors, (252), 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 19:19:39,260 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 1257 transitions. [2024-11-09 19:19:39,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2024-11-09 19:19:39,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:19:39,264 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:19:39,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 19:19:39,264 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:19:39,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:19:39,265 INFO L85 PathProgramCache]: Analyzing trace with hash -92944703, now seen corresponding path program 1 times [2024-11-09 19:19:39,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:19:39,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476863426] [2024-11-09 19:19:39,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:19:39,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:19:39,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:19:39,775 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-09 19:19:39,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:19:39,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476863426] [2024-11-09 19:19:39,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476863426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:19:39,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:19:39,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:19:39,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100342572] [2024-11-09 19:19:39,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:19:39,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:19:39,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:19:39,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:19:39,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:19:39,780 INFO L87 Difference]: Start difference. First operand 705 states and 1257 transitions. Second operand has 4 states, 4 states have (on average 53.5) internal successors, (214), 3 states have internal predecessors, (214), 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 19:19:40,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:19:40,495 INFO L93 Difference]: Finished difference Result 1268 states and 2289 transitions. [2024-11-09 19:19:40,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:19:40,496 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 53.5) internal successors, (214), 3 states have internal predecessors, (214), 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 264 [2024-11-09 19:19:40,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:19:40,499 INFO L225 Difference]: With dead ends: 1268 [2024-11-09 19:19:40,499 INFO L226 Difference]: Without dead ends: 705 [2024-11-09 19:19:40,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:19:40,500 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 201 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:19:40,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 93 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 19:19:40,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2024-11-09 19:19:40,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 705. [2024-11-09 19:19:40,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 704 states have (on average 1.7784090909090908) internal successors, (1252), 704 states have internal predecessors, (1252), 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 19:19:40,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 1252 transitions. [2024-11-09 19:19:40,517 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 1252 transitions. Word has length 264 [2024-11-09 19:19:40,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:19:40,517 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 1252 transitions. [2024-11-09 19:19:40,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.5) internal successors, (214), 3 states have internal predecessors, (214), 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 19:19:40,518 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 1252 transitions. [2024-11-09 19:19:40,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2024-11-09 19:19:40,521 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:19:40,521 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:19:40,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 19:19:40,522 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:19:40,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:19:40,522 INFO L85 PathProgramCache]: Analyzing trace with hash -2054093447, now seen corresponding path program 1 times [2024-11-09 19:19:40,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:19:40,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570950900] [2024-11-09 19:19:40,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:19:40,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:19:40,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:19:41,029 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 116 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:19:41,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:19:41,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570950900] [2024-11-09 19:19:41,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570950900] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:19:41,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418888732] [2024-11-09 19:19:41,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:19:41,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:19:41,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:19:41,032 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-09 19:19:41,034 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-09 19:19:41,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:19:41,173 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 19:19:41,187 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:19:41,518 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-11-09 19:19:41,519 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:19:41,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418888732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:19:41,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:19:41,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-09 19:19:41,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826088993] [2024-11-09 19:19:41,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:19:41,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:19:41,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:19:41,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:19:41,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 19:19:41,522 INFO L87 Difference]: Start difference. First operand 705 states and 1252 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 2 states have internal predecessors, (178), 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 19:19:42,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:19:42,204 INFO L93 Difference]: Finished difference Result 1408 states and 2572 transitions. [2024-11-09 19:19:42,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:19:42,205 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 2 states have internal predecessors, (178), 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 288 [2024-11-09 19:19:42,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:19:42,209 INFO L225 Difference]: With dead ends: 1408 [2024-11-09 19:19:42,209 INFO L226 Difference]: Without dead ends: 845 [2024-11-09 19:19:42,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 19:19:42,211 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 130 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:19:42,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 37 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 19:19:42,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2024-11-09 19:19:42,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 845. [2024-11-09 19:19:42,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 844 states have (on average 1.7654028436018958) internal successors, (1490), 844 states have internal predecessors, (1490), 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 19:19:42,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1490 transitions. [2024-11-09 19:19:42,232 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1490 transitions. Word has length 288 [2024-11-09 19:19:42,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:19:42,232 INFO L471 AbstractCegarLoop]: Abstraction has 845 states and 1490 transitions. [2024-11-09 19:19:42,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 2 states have internal predecessors, (178), 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 19:19:42,233 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1490 transitions. [2024-11-09 19:19:42,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2024-11-09 19:19:42,239 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:19:42,239 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:19:42,258 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-09 19:19:42,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-09 19:19:42,444 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:19:42,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:19:42,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1785850743, now seen corresponding path program 1 times [2024-11-09 19:19:42,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:19:42,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037174381] [2024-11-09 19:19:42,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:19:42,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:19:42,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:19:42,904 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 355 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:19:42,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:19:42,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037174381] [2024-11-09 19:19:42,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037174381] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:19:42,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618587163] [2024-11-09 19:19:42,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:19:42,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:19:42,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:19:42,908 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-09 19:19:42,913 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-09 19:19:43,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:19:43,052 INFO L255 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 19:19:43,060 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:19:43,220 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 332 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-09 19:19:43,220 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:19:43,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618587163] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:19:43,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:19:43,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-09 19:19:43,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985927837] [2024-11-09 19:19:43,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:19:43,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:19:43,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:19:43,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:19:43,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 19:19:43,223 INFO L87 Difference]: Start difference. First operand 845 states and 1490 transitions. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 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 19:19:43,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:19:43,871 INFO L93 Difference]: Finished difference Result 2108 states and 3764 transitions. [2024-11-09 19:19:43,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:19:43,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 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 357 [2024-11-09 19:19:43,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:19:43,877 INFO L225 Difference]: With dead ends: 2108 [2024-11-09 19:19:43,877 INFO L226 Difference]: Without dead ends: 1405 [2024-11-09 19:19:43,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 19:19:43,879 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 100 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:19:43,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 274 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 19:19:43,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2024-11-09 19:19:43,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 1405. [2024-11-09 19:19:43,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1405 states, 1404 states have (on average 1.7243589743589745) internal successors, (2421), 1404 states have internal predecessors, (2421), 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 19:19:43,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1405 states and 2421 transitions. [2024-11-09 19:19:43,904 INFO L78 Accepts]: Start accepts. Automaton has 1405 states and 2421 transitions. Word has length 357 [2024-11-09 19:19:43,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:19:43,905 INFO L471 AbstractCegarLoop]: Abstraction has 1405 states and 2421 transitions. [2024-11-09 19:19:43,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 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 19:19:43,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1405 states and 2421 transitions. [2024-11-09 19:19:43,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2024-11-09 19:19:43,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:19:43,909 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:19:43,926 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-09 19:19:44,110 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,SelfDestructingSolverStorable6 [2024-11-09 19:19:44,110 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:19:44,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:19:44,111 INFO L85 PathProgramCache]: Analyzing trace with hash 679441221, now seen corresponding path program 1 times [2024-11-09 19:19:44,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:19:44,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833275467] [2024-11-09 19:19:44,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:19:44,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:19:44,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:19:44,409 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2024-11-09 19:19:44,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:19:44,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833275467] [2024-11-09 19:19:44,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833275467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:19:44,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:19:44,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:19:44,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899820898] [2024-11-09 19:19:44,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:19:44,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:19:44,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:19:44,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:19:44,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:19:44,413 INFO L87 Difference]: Start difference. First operand 1405 states and 2421 transitions. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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 19:19:45,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:19:45,026 INFO L93 Difference]: Finished difference Result 3088 states and 5388 transitions. [2024-11-09 19:19:45,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:19:45,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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 370 [2024-11-09 19:19:45,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:19:45,034 INFO L225 Difference]: With dead ends: 3088 [2024-11-09 19:19:45,035 INFO L226 Difference]: Without dead ends: 1825 [2024-11-09 19:19:45,036 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 19:19:45,039 INFO L432 NwaCegarLoop]: 297 mSDtfsCounter, 164 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:19:45,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 304 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 19:19:45,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1825 states. [2024-11-09 19:19:45,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1825 to 1685. [2024-11-09 19:19:45,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1685 states, 1684 states have (on average 1.7066508313539193) internal successors, (2874), 1684 states have internal predecessors, (2874), 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 19:19:45,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1685 states to 1685 states and 2874 transitions. [2024-11-09 19:19:45,070 INFO L78 Accepts]: Start accepts. Automaton has 1685 states and 2874 transitions. Word has length 370 [2024-11-09 19:19:45,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:19:45,071 INFO L471 AbstractCegarLoop]: Abstraction has 1685 states and 2874 transitions. [2024-11-09 19:19:45,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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 19:19:45,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1685 states and 2874 transitions. [2024-11-09 19:19:45,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2024-11-09 19:19:45,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:19:45,078 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:19:45,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 19:19:45,079 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:19:45,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:19:45,079 INFO L85 PathProgramCache]: Analyzing trace with hash -270464459, now seen corresponding path program 1 times [2024-11-09 19:19:45,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:19:45,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561437075] [2024-11-09 19:19:45,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:19:45,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:19:45,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:19:45,389 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2024-11-09 19:19:45,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:19:45,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561437075] [2024-11-09 19:19:45,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561437075] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:19:45,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:19:45,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:19:45,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819016622] [2024-11-09 19:19:45,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:19:45,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:19:45,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:19:45,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:19:45,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:19:45,393 INFO L87 Difference]: Start difference. First operand 1685 states and 2874 transitions. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 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 19:19:45,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:19:45,972 INFO L93 Difference]: Finished difference Result 3645 states and 6316 transitions. [2024-11-09 19:19:45,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:19:45,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 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 371 [2024-11-09 19:19:45,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:19:45,973 INFO L225 Difference]: With dead ends: 3645 [2024-11-09 19:19:45,974 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 19:19:45,977 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 19:19:45,978 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 166 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:19:45,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 81 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 19:19:45,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 19:19:45,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 19:19:45,979 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 19:19:45,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 19:19:45,979 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 371 [2024-11-09 19:19:45,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:19:45,979 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 19:19:45,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 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 19:19:45,979 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 19:19:45,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 19:19:45,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 19:19:45,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 19:19:45,989 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:19:45,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 19:19:46,105 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 19:19:46,117 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:19:46 BoogieIcfgContainer [2024-11-09 19:19:46,117 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 19:19:46,118 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 19:19:46,118 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 19:19:46,118 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 19:19:46,119 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:19:33" (3/4) ... [2024-11-09 19:19:46,121 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-09 19:19:46,143 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-09 19:19:46,144 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 19:19:46,145 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 19:19:46,146 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 19:19:46,305 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 19:19:46,305 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 19:19:46,305 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 19:19:46,306 INFO L158 Benchmark]: Toolchain (without parser) took 14496.45ms. Allocated memory was 148.9MB in the beginning and 377.5MB in the end (delta: 228.6MB). Free memory was 77.5MB in the beginning and 221.3MB in the end (delta: -143.8MB). Peak memory consumption was 87.2MB. Max. memory is 16.1GB. [2024-11-09 19:19:46,306 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 148.9MB. Free memory is still 104.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 19:19:46,306 INFO L158 Benchmark]: CACSL2BoogieTranslator took 550.30ms. Allocated memory is still 148.9MB. Free memory was 77.3MB in the beginning and 97.4MB in the end (delta: -20.2MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. [2024-11-09 19:19:46,307 INFO L158 Benchmark]: Boogie Procedure Inliner took 100.35ms. Allocated memory is still 148.9MB. Free memory was 97.0MB in the beginning and 89.0MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-09 19:19:46,307 INFO L158 Benchmark]: Boogie Preprocessor took 98.46ms. Allocated memory is still 148.9MB. Free memory was 89.0MB in the beginning and 79.7MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-09 19:19:46,308 INFO L158 Benchmark]: IcfgBuilder took 1321.05ms. Allocated memory was 148.9MB in the beginning and 218.1MB in the end (delta: 69.2MB). Free memory was 79.3MB in the beginning and 160.3MB in the end (delta: -81.0MB). Peak memory consumption was 47.7MB. Max. memory is 16.1GB. [2024-11-09 19:19:46,308 INFO L158 Benchmark]: TraceAbstraction took 12231.13ms. Allocated memory was 218.1MB in the beginning and 377.5MB in the end (delta: 159.4MB). Free memory was 160.3MB in the beginning and 235.0MB in the end (delta: -74.7MB). Peak memory consumption was 83.6MB. Max. memory is 16.1GB. [2024-11-09 19:19:46,309 INFO L158 Benchmark]: Witness Printer took 187.52ms. Allocated memory is still 377.5MB. Free memory was 235.0MB in the beginning and 221.3MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 19:19:46,310 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 148.9MB. Free memory is still 104.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 550.30ms. Allocated memory is still 148.9MB. Free memory was 77.3MB in the beginning and 97.4MB in the end (delta: -20.2MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 100.35ms. Allocated memory is still 148.9MB. Free memory was 97.0MB in the beginning and 89.0MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 98.46ms. Allocated memory is still 148.9MB. Free memory was 89.0MB in the beginning and 79.7MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1321.05ms. Allocated memory was 148.9MB in the beginning and 218.1MB in the end (delta: 69.2MB). Free memory was 79.3MB in the beginning and 160.3MB in the end (delta: -81.0MB). Peak memory consumption was 47.7MB. Max. memory is 16.1GB. * TraceAbstraction took 12231.13ms. Allocated memory was 218.1MB in the beginning and 377.5MB in the end (delta: 159.4MB). Free memory was 160.3MB in the beginning and 235.0MB in the end (delta: -74.7MB). Peak memory consumption was 83.6MB. Max. memory is 16.1GB. * Witness Printer took 187.52ms. Allocated memory is still 377.5MB. Free memory was 235.0MB in the beginning and 221.3MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. 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: 170]: 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, 209 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.0s, OverallIterations: 9, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1930 SdHoareTripleChecker+Valid, 6.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1930 mSDsluCounter, 1461 SdHoareTripleChecker+Invalid, 5.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 78 mSDsCounter, 722 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5354 IncrementalHoareTripleChecker+Invalid, 6076 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 722 mSolverCounterUnsat, 1383 mSDtfsCounter, 5354 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 679 GetRequests, 654 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1685occurred in iteration=8, 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.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 280 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 3081 NumberOfCodeBlocks, 3081 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 3070 ConstructedInterpolants, 0 QuantifiedInterpolants, 11438 SizeOfPredicates, 0 NumberOfNonLiveVariables, 879 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 2633/2774 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: 592]: Location Invariant Derived location invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-09 19:19:46,343 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