./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec3_product33_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/product-lines/minepump_spec3_product33_true-unreach-call_false-termination.cil.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.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5667765c016e1c72bafcc0c365d87d7652cb3eb1 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 09:47:55,856 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 09:47:55,860 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 09:47:55,871 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 09:47:55,872 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 09:47:55,873 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 09:47:55,874 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 09:47:55,883 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 09:47:55,884 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 09:47:55,885 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 09:47:55,886 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 09:47:55,886 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 09:47:55,888 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 09:47:55,889 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 09:47:55,890 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 09:47:55,891 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 09:47:55,892 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 09:47:55,894 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 09:47:55,897 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 09:47:55,899 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 09:47:55,900 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 09:47:55,901 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 09:47:55,903 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 09:47:55,904 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 09:47:55,904 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 09:47:55,905 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 09:47:55,906 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 09:47:55,907 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 09:47:55,908 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 09:47:55,909 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 09:47:55,909 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 09:47:55,910 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 09:47:55,911 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 09:47:55,911 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 09:47:55,912 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 09:47:55,913 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 09:47:55,913 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 09:47:55,928 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 09:47:55,929 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 09:47:55,930 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 09:47:55,931 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 09:47:55,931 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 09:47:55,931 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 09:47:55,931 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 09:47:55,931 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 09:47:55,932 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 09:47:55,932 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 09:47:55,932 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 09:47:55,932 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 09:47:55,932 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 09:47:55,932 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 09:47:55,933 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 09:47:55,934 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 09:47:55,934 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 09:47:55,934 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 09:47:55,934 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 09:47:55,935 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 09:47:55,935 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 09:47:55,935 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 09:47:55,936 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 09:47:55,936 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 09:47:55,936 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 09:47:55,936 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 09:47:55,936 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 09:47:55,937 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 09:47:55,937 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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.graphml 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(__VERIFIER_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 -> 5667765c016e1c72bafcc0c365d87d7652cb3eb1 [2018-12-31 09:47:55,976 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 09:47:55,995 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 09:47:56,002 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 09:47:56,004 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 09:47:56,004 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 09:47:56,006 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec3_product33_true-unreach-call_false-termination.cil.c [2018-12-31 09:47:56,075 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ee0f84b7/fe03342711f94a39b2dd8a0560322833/FLAG6b032774b [2018-12-31 09:47:56,615 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 09:47:56,616 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec3_product33_true-unreach-call_false-termination.cil.c [2018-12-31 09:47:56,631 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ee0f84b7/fe03342711f94a39b2dd8a0560322833/FLAG6b032774b [2018-12-31 09:47:56,921 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ee0f84b7/fe03342711f94a39b2dd8a0560322833 [2018-12-31 09:47:56,926 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 09:47:56,928 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 09:47:56,929 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 09:47:56,929 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 09:47:56,935 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 09:47:56,936 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:47:56" (1/1) ... [2018-12-31 09:47:56,940 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f4fbf7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:47:56, skipping insertion in model container [2018-12-31 09:47:56,941 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:47:56" (1/1) ... [2018-12-31 09:47:56,951 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 09:47:57,026 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 09:47:57,394 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:47:57,410 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 09:47:57,513 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:47:57,636 INFO L195 MainTranslator]: Completed translation [2018-12-31 09:47:57,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:47:57 WrapperNode [2018-12-31 09:47:57,641 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 09:47:57,643 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 09:47:57,643 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 09:47:57,643 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 09:47:57,652 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:47:57" (1/1) ... [2018-12-31 09:47:57,684 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:47:57" (1/1) ... [2018-12-31 09:47:57,727 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 09:47:57,728 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 09:47:57,728 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 09:47:57,728 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 09:47:57,740 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:47:57" (1/1) ... [2018-12-31 09:47:57,740 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:47:57" (1/1) ... [2018-12-31 09:47:57,745 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:47:57" (1/1) ... [2018-12-31 09:47:57,745 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:47:57" (1/1) ... [2018-12-31 09:47:57,755 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:47:57" (1/1) ... [2018-12-31 09:47:57,764 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:47:57" (1/1) ... [2018-12-31 09:47:57,767 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:47:57" (1/1) ... [2018-12-31 09:47:57,771 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 09:47:57,772 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 09:47:57,772 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 09:47:57,773 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 09:47:57,773 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:47:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 09:47:57,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 09:47:57,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-31 09:47:57,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 09:47:57,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 09:47:59,088 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 09:47:59,089 INFO L280 CfgBuilder]: Removed 102 assue(true) statements. [2018-12-31 09:47:59,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:47:59 BoogieIcfgContainer [2018-12-31 09:47:59,089 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 09:47:59,090 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 09:47:59,091 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 09:47:59,094 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 09:47:59,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 09:47:56" (1/3) ... [2018-12-31 09:47:59,095 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@272fd4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:47:59, skipping insertion in model container [2018-12-31 09:47:59,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:47:57" (2/3) ... [2018-12-31 09:47:59,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@272fd4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:47:59, skipping insertion in model container [2018-12-31 09:47:59,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:47:59" (3/3) ... [2018-12-31 09:47:59,099 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec3_product33_true-unreach-call_false-termination.cil.c [2018-12-31 09:47:59,110 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 09:47:59,118 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 09:47:59,137 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 09:47:59,171 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 09:47:59,171 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 09:47:59,172 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 09:47:59,172 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 09:47:59,173 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 09:47:59,173 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 09:47:59,173 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 09:47:59,173 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 09:47:59,174 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 09:47:59,194 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2018-12-31 09:47:59,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-31 09:47:59,205 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:47:59,206 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:47:59,209 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:47:59,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:47:59,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1284074395, now seen corresponding path program 1 times [2018-12-31 09:47:59,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:47:59,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:47:59,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:47:59,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:47:59,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:47:59,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:47:59,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:47:59,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:47:59,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:47:59,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 09:47:59,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 09:47:59,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 09:47:59,481 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 2 states. [2018-12-31 09:47:59,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:47:59,512 INFO L93 Difference]: Finished difference Result 162 states and 245 transitions. [2018-12-31 09:47:59,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 09:47:59,514 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-12-31 09:47:59,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:47:59,528 INFO L225 Difference]: With dead ends: 162 [2018-12-31 09:47:59,528 INFO L226 Difference]: Without dead ends: 80 [2018-12-31 09:47:59,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 09:47:59,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-31 09:47:59,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-12-31 09:47:59,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-31 09:47:59,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 114 transitions. [2018-12-31 09:47:59,584 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 114 transitions. Word has length 18 [2018-12-31 09:47:59,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:47:59,584 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 114 transitions. [2018-12-31 09:47:59,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 09:47:59,584 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 114 transitions. [2018-12-31 09:47:59,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-31 09:47:59,586 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:47:59,587 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:47:59,587 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:47:59,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:47:59,588 INFO L82 PathProgramCache]: Analyzing trace with hash 373043642, now seen corresponding path program 1 times [2018-12-31 09:47:59,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:47:59,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:47:59,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:47:59,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:47:59,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:47:59,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:47:59,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:47:59,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:47:59,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 09:47:59,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:47:59,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:47:59,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:47:59,786 INFO L87 Difference]: Start difference. First operand 80 states and 114 transitions. Second operand 3 states. [2018-12-31 09:47:59,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:47:59,813 INFO L93 Difference]: Finished difference Result 80 states and 114 transitions. [2018-12-31 09:47:59,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:47:59,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-31 09:47:59,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:47:59,816 INFO L225 Difference]: With dead ends: 80 [2018-12-31 09:47:59,816 INFO L226 Difference]: Without dead ends: 36 [2018-12-31 09:47:59,818 INFO L631 BasicCegarLoop]: 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 [2018-12-31 09:47:59,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-31 09:47:59,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-31 09:47:59,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-31 09:47:59,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 51 transitions. [2018-12-31 09:47:59,825 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 51 transitions. Word has length 19 [2018-12-31 09:47:59,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:47:59,826 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 51 transitions. [2018-12-31 09:47:59,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:47:59,827 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 51 transitions. [2018-12-31 09:47:59,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-31 09:47:59,828 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:47:59,828 INFO L402 BasicCegarLoop]: 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] [2018-12-31 09:47:59,830 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:47:59,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:47:59,830 INFO L82 PathProgramCache]: Analyzing trace with hash -196588044, now seen corresponding path program 1 times [2018-12-31 09:47:59,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:47:59,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:47:59,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:47:59,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:47:59,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:47:59,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:47:59,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:47:59,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:47:59,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:47:59,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:47:59,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:47:59,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:47:59,982 INFO L87 Difference]: Start difference. First operand 36 states and 51 transitions. Second operand 3 states. [2018-12-31 09:48:00,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:48:00,005 INFO L93 Difference]: Finished difference Result 66 states and 96 transitions. [2018-12-31 09:48:00,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:48:00,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-31 09:48:00,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:48:00,007 INFO L225 Difference]: With dead ends: 66 [2018-12-31 09:48:00,008 INFO L226 Difference]: Without dead ends: 36 [2018-12-31 09:48:00,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:48:00,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-31 09:48:00,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-31 09:48:00,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-31 09:48:00,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2018-12-31 09:48:00,016 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 50 transitions. Word has length 24 [2018-12-31 09:48:00,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:48:00,017 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 50 transitions. [2018-12-31 09:48:00,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:48:00,017 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 50 transitions. [2018-12-31 09:48:00,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-31 09:48:00,018 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:48:00,018 INFO L402 BasicCegarLoop]: 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] [2018-12-31 09:48:00,018 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:48:00,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:48:00,020 INFO L82 PathProgramCache]: Analyzing trace with hash 961211503, now seen corresponding path program 1 times [2018-12-31 09:48:00,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:48:00,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:48:00,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:48:00,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:48:00,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:48:00,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:48:00,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:48:00,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:48:00,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:48:00,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:48:00,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:48:00,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:48:00,139 INFO L87 Difference]: Start difference. First operand 36 states and 50 transitions. Second operand 3 states. [2018-12-31 09:48:00,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:48:00,296 INFO L93 Difference]: Finished difference Result 89 states and 127 transitions. [2018-12-31 09:48:00,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:48:00,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-31 09:48:00,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:48:00,298 INFO L225 Difference]: With dead ends: 89 [2018-12-31 09:48:00,298 INFO L226 Difference]: Without dead ends: 59 [2018-12-31 09:48:00,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:48:00,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-31 09:48:00,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2018-12-31 09:48:00,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-31 09:48:00,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 80 transitions. [2018-12-31 09:48:00,312 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 80 transitions. Word has length 25 [2018-12-31 09:48:00,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:48:00,312 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 80 transitions. [2018-12-31 09:48:00,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:48:00,312 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 80 transitions. [2018-12-31 09:48:00,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-31 09:48:00,313 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:48:00,314 INFO L402 BasicCegarLoop]: 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] [2018-12-31 09:48:00,314 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:48:00,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:48:00,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1128412896, now seen corresponding path program 1 times [2018-12-31 09:48:00,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:48:00,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:48:00,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:48:00,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:48:00,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:48:00,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:48:00,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:48:00,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:48:00,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:48:00,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:48:00,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:48:00,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:48:00,511 INFO L87 Difference]: Start difference. First operand 57 states and 80 transitions. Second operand 5 states. [2018-12-31 09:48:00,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:48:00,632 INFO L93 Difference]: Finished difference Result 149 states and 209 transitions. [2018-12-31 09:48:00,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 09:48:00,639 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-12-31 09:48:00,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:48:00,642 INFO L225 Difference]: With dead ends: 149 [2018-12-31 09:48:00,642 INFO L226 Difference]: Without dead ends: 98 [2018-12-31 09:48:00,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-31 09:48:00,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-31 09:48:00,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 60. [2018-12-31 09:48:00,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-31 09:48:00,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 83 transitions. [2018-12-31 09:48:00,659 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 83 transitions. Word has length 31 [2018-12-31 09:48:00,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:48:00,660 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 83 transitions. [2018-12-31 09:48:00,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:48:00,661 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 83 transitions. [2018-12-31 09:48:00,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-31 09:48:00,663 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:48:00,663 INFO L402 BasicCegarLoop]: 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] [2018-12-31 09:48:00,663 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:48:00,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:48:00,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1016803, now seen corresponding path program 1 times [2018-12-31 09:48:00,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:48:00,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:48:00,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:48:00,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:48:00,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:48:00,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:48:00,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:48:00,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:48:00,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:48:00,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:48:00,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:48:00,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:48:00,815 INFO L87 Difference]: Start difference. First operand 60 states and 83 transitions. Second operand 5 states. [2018-12-31 09:48:01,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:48:01,206 INFO L93 Difference]: Finished difference Result 314 states and 451 transitions. [2018-12-31 09:48:01,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 09:48:01,207 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-12-31 09:48:01,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:48:01,210 INFO L225 Difference]: With dead ends: 314 [2018-12-31 09:48:01,210 INFO L226 Difference]: Without dead ends: 260 [2018-12-31 09:48:01,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-31 09:48:01,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-12-31 09:48:01,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 106. [2018-12-31 09:48:01,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-31 09:48:01,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 144 transitions. [2018-12-31 09:48:01,256 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 144 transitions. Word has length 31 [2018-12-31 09:48:01,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:48:01,256 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 144 transitions. [2018-12-31 09:48:01,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:48:01,256 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 144 transitions. [2018-12-31 09:48:01,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-31 09:48:01,264 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:48:01,265 INFO L402 BasicCegarLoop]: 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] [2018-12-31 09:48:01,265 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:48:01,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:48:01,265 INFO L82 PathProgramCache]: Analyzing trace with hash -2111743067, now seen corresponding path program 1 times [2018-12-31 09:48:01,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:48:01,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:48:01,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:48:01,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:48:01,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:48:01,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:48:01,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:48:01,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:48:01,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:48:01,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:48:01,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:48:01,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:48:01,575 INFO L87 Difference]: Start difference. First operand 106 states and 144 transitions. Second operand 5 states. [2018-12-31 09:48:02,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:48:02,604 INFO L93 Difference]: Finished difference Result 446 states and 629 transitions. [2018-12-31 09:48:02,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 09:48:02,605 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-12-31 09:48:02,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:48:02,609 INFO L225 Difference]: With dead ends: 446 [2018-12-31 09:48:02,609 INFO L226 Difference]: Without dead ends: 392 [2018-12-31 09:48:02,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-31 09:48:02,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2018-12-31 09:48:02,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 152. [2018-12-31 09:48:02,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-12-31 09:48:02,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 207 transitions. [2018-12-31 09:48:02,641 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 207 transitions. Word has length 32 [2018-12-31 09:48:02,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:48:02,641 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 207 transitions. [2018-12-31 09:48:02,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:48:02,641 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 207 transitions. [2018-12-31 09:48:02,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-31 09:48:02,645 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:48:02,645 INFO L402 BasicCegarLoop]: 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] [2018-12-31 09:48:02,645 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:48:02,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:48:02,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1172106979, now seen corresponding path program 1 times [2018-12-31 09:48:02,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:48:02,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:48:02,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:48:02,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:48:02,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:48:02,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:48:02,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:48:02,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:48:02,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:48:02,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 09:48:02,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 09:48:02,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 09:48:02,811 INFO L87 Difference]: Start difference. First operand 152 states and 207 transitions. Second operand 4 states. [2018-12-31 09:48:03,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:48:03,023 INFO L93 Difference]: Finished difference Result 352 states and 487 transitions. [2018-12-31 09:48:03,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 09:48:03,024 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-12-31 09:48:03,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:48:03,027 INFO L225 Difference]: With dead ends: 352 [2018-12-31 09:48:03,027 INFO L226 Difference]: Without dead ends: 250 [2018-12-31 09:48:03,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:48:03,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-12-31 09:48:03,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 149. [2018-12-31 09:48:03,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-12-31 09:48:03,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 203 transitions. [2018-12-31 09:48:03,064 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 203 transitions. Word has length 32 [2018-12-31 09:48:03,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:48:03,065 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 203 transitions. [2018-12-31 09:48:03,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 09:48:03,066 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 203 transitions. [2018-12-31 09:48:03,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-31 09:48:03,067 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:48:03,069 INFO L402 BasicCegarLoop]: 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] [2018-12-31 09:48:03,069 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:48:03,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:48:03,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1737298786, now seen corresponding path program 1 times [2018-12-31 09:48:03,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:48:03,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:48:03,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:48:03,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:48:03,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:48:03,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:48:03,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:48:03,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:48:03,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 09:48:03,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 09:48:03,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 09:48:03,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 09:48:03,349 INFO L87 Difference]: Start difference. First operand 149 states and 203 transitions. Second operand 6 states. [2018-12-31 09:48:04,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:48:04,188 INFO L93 Difference]: Finished difference Result 383 states and 531 transitions. [2018-12-31 09:48:04,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 09:48:04,189 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-12-31 09:48:04,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:48:04,190 INFO L225 Difference]: With dead ends: 383 [2018-12-31 09:48:04,190 INFO L226 Difference]: Without dead ends: 120 [2018-12-31 09:48:04,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-12-31 09:48:04,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-12-31 09:48:04,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 60. [2018-12-31 09:48:04,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-31 09:48:04,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 76 transitions. [2018-12-31 09:48:04,205 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 76 transitions. Word has length 32 [2018-12-31 09:48:04,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:48:04,206 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 76 transitions. [2018-12-31 09:48:04,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 09:48:04,206 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 76 transitions. [2018-12-31 09:48:04,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-31 09:48:04,209 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:48:04,209 INFO L402 BasicCegarLoop]: 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] [2018-12-31 09:48:04,210 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:48:04,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:48:04,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1430272417, now seen corresponding path program 1 times [2018-12-31 09:48:04,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:48:04,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:48:04,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:48:04,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:48:04,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:48:04,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:48:04,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:48:04,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:48:04,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:48:04,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:48:04,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:48:04,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:48:04,486 INFO L87 Difference]: Start difference. First operand 60 states and 76 transitions. Second operand 5 states. [2018-12-31 09:48:04,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:48:04,892 INFO L93 Difference]: Finished difference Result 103 states and 131 transitions. [2018-12-31 09:48:04,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 09:48:04,893 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-12-31 09:48:04,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:48:04,894 INFO L225 Difference]: With dead ends: 103 [2018-12-31 09:48:04,894 INFO L226 Difference]: Without dead ends: 0 [2018-12-31 09:48:04,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-31 09:48:04,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-31 09:48:04,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-31 09:48:04,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-31 09:48:04,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-31 09:48:04,896 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2018-12-31 09:48:04,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:48:04,899 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-31 09:48:04,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:48:04,900 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-31 09:48:04,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-31 09:48:04,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-31 09:48:04,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:48:04,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:48:04,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:48:04,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:48:04,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:48:05,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:48:05,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:48:05,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:48:05,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:48:05,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:48:05,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:48:05,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:48:05,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:48:05,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:48:05,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:48:05,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:48:05,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:48:05,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:48:05,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:48:05,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:48:05,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:48:05,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:48:05,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:48:06,462 WARN L181 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 29 DAG size of output: 22 [2018-12-31 09:48:07,324 WARN L181 SmtUtils]: Spent 781.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 16 [2018-12-31 09:48:07,720 WARN L181 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 14 [2018-12-31 09:48:07,912 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 14 [2018-12-31 09:48:08,449 WARN L181 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 27 [2018-12-31 09:48:08,633 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 18 [2018-12-31 09:48:08,810 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 14 [2018-12-31 09:48:08,817 INFO L448 ceAbstractionStarter]: For program point L828(lines 828 832) no Hoare annotation was computed. [2018-12-31 09:48:08,817 INFO L448 ceAbstractionStarter]: For program point L828-2(lines 828 832) no Hoare annotation was computed. [2018-12-31 09:48:08,817 INFO L448 ceAbstractionStarter]: For program point L828-3(lines 828 832) no Hoare annotation was computed. [2018-12-31 09:48:08,817 INFO L448 ceAbstractionStarter]: For program point L828-5(lines 828 832) no Hoare annotation was computed. [2018-12-31 09:48:08,818 INFO L448 ceAbstractionStarter]: For program point L630(lines 630 634) no Hoare annotation was computed. [2018-12-31 09:48:08,818 INFO L448 ceAbstractionStarter]: For program point L828-6(lines 828 832) no Hoare annotation was computed. [2018-12-31 09:48:08,818 INFO L448 ceAbstractionStarter]: For program point L828-8(lines 828 832) no Hoare annotation was computed. [2018-12-31 09:48:08,818 INFO L444 ceAbstractionStarter]: At program point L779(lines 774 782) the Hoare annotation is: (and (not (= 0 ~pumpRunning~0)) (= ULTIMATE.start_isHighWaterLevel_~tmp~6 0) (= ULTIMATE.start_test_~splverifierCounter~0 0) (not (= 0 |ULTIMATE.start_isPumpRunning_#res|)) (= ~systemActive~0 1)) [2018-12-31 09:48:08,818 INFO L444 ceAbstractionStarter]: At program point L779-1(lines 774 782) the Hoare annotation is: false [2018-12-31 09:48:08,818 INFO L444 ceAbstractionStarter]: At program point L779-2(lines 774 782) the Hoare annotation is: false [2018-12-31 09:48:08,819 INFO L444 ceAbstractionStarter]: At program point L135(lines 126 139) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (= ~pumpRunning~0 0)) (.cse2 (= ~systemActive~0 1))) (or (and (and .cse0 .cse1) (= 0 |ULTIMATE.start_isHighWaterSensorDry_#res|) .cse2) (and .cse0 (<= ~waterLevel~0 1) .cse1 .cse2))) [2018-12-31 09:48:08,819 INFO L444 ceAbstractionStarter]: At program point L135-1(lines 126 139) the Hoare annotation is: false [2018-12-31 09:48:08,819 INFO L444 ceAbstractionStarter]: At program point L135-2(lines 126 139) the Hoare annotation is: false [2018-12-31 09:48:08,819 INFO L444 ceAbstractionStarter]: At program point L895(lines 1 906) the Hoare annotation is: (and (= 1 ~waterLevel~0) (= ~pumpRunning~0 0) (= ~systemActive~0 1)) [2018-12-31 09:48:08,819 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-31 09:48:08,819 INFO L448 ceAbstractionStarter]: For program point L730(lines 730 738) no Hoare annotation was computed. [2018-12-31 09:48:08,819 INFO L448 ceAbstractionStarter]: For program point L730-1(lines 730 738) no Hoare annotation was computed. [2018-12-31 09:48:08,819 INFO L448 ceAbstractionStarter]: For program point L664(lines 664 668) no Hoare annotation was computed. [2018-12-31 09:48:08,819 INFO L448 ceAbstractionStarter]: For program point L730-2(lines 730 738) no Hoare annotation was computed. [2018-12-31 09:48:08,819 INFO L448 ceAbstractionStarter]: For program point L664-2(lines 694 700) no Hoare annotation was computed. [2018-12-31 09:48:08,820 INFO L448 ceAbstractionStarter]: For program point L53(lines 53 57) no Hoare annotation was computed. [2018-12-31 09:48:08,820 INFO L448 ceAbstractionStarter]: For program point L53-3(lines 53 57) no Hoare annotation was computed. [2018-12-31 09:48:08,820 INFO L448 ceAbstractionStarter]: For program point L53-6(lines 53 57) no Hoare annotation was computed. [2018-12-31 09:48:08,820 INFO L444 ceAbstractionStarter]: At program point L202(lines 198 204) the Hoare annotation is: (and (= 1 ~waterLevel~0) (= ~pumpRunning~0 0) (= ~systemActive~0 1)) [2018-12-31 09:48:08,820 INFO L448 ceAbstractionStarter]: For program point L648(lines 648 654) no Hoare annotation was computed. [2018-12-31 09:48:08,820 INFO L444 ceAbstractionStarter]: At program point L648-1(lines 648 654) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (= ~systemActive~0 1))) (or (and (= ULTIMATE.start_isHighWaterLevel_~tmp~6 0) .cse0 .cse1) (and (and .cse0 (= ~pumpRunning~0 0)) .cse1))) [2018-12-31 09:48:08,820 INFO L444 ceAbstractionStarter]: At program point L153-2(lines 153 167) the Hoare annotation is: false [2018-12-31 09:48:08,820 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-12-31 09:48:08,821 INFO L448 ceAbstractionStarter]: For program point L848(lines 848 868) no Hoare annotation was computed. [2018-12-31 09:48:08,821 INFO L448 ceAbstractionStarter]: For program point L848-2(lines 848 868) no Hoare annotation was computed. [2018-12-31 09:48:08,821 INFO L448 ceAbstractionStarter]: For program point L848-4(lines 848 868) no Hoare annotation was computed. [2018-12-31 09:48:08,821 INFO L444 ceAbstractionStarter]: At program point L122(lines 117 125) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (= ~systemActive~0 1))) (or (and (not (= 0 ~pumpRunning~0)) (= ULTIMATE.start_isHighWaterLevel_~tmp~6 0) .cse0 .cse1) (and (and (= ULTIMATE.start_processEnvironment_~tmp~5 0) (<= |ULTIMATE.start_getWaterLevel_#res| 1) .cse0 (<= ~waterLevel~0 1) (= ~pumpRunning~0 0)) .cse1))) [2018-12-31 09:48:08,821 INFO L444 ceAbstractionStarter]: At program point L122-1(lines 117 125) the Hoare annotation is: false [2018-12-31 09:48:08,821 INFO L444 ceAbstractionStarter]: At program point L122-2(lines 117 125) the Hoare annotation is: false [2018-12-31 09:48:08,821 INFO L451 ceAbstractionStarter]: At program point L238(lines 219 241) the Hoare annotation is: true [2018-12-31 09:48:08,822 INFO L444 ceAbstractionStarter]: At program point L701(lines 701 707) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (= ~systemActive~0 1))) (or (and (= ULTIMATE.start_processEnvironment_~tmp~5 0) .cse0 (<= ~waterLevel~0 1) (= ~pumpRunning~0 0) .cse1) (and (not (= 0 ~pumpRunning~0)) (= ULTIMATE.start_isHighWaterLevel_~tmp~6 0) .cse0 .cse1))) [2018-12-31 09:48:08,822 INFO L444 ceAbstractionStarter]: At program point L701-1(lines 701 707) the Hoare annotation is: false [2018-12-31 09:48:08,822 INFO L444 ceAbstractionStarter]: At program point L701-2(lines 701 707) the Hoare annotation is: false [2018-12-31 09:48:08,822 INFO L444 ceAbstractionStarter]: At program point L90(lines 85 93) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (= ~systemActive~0 1))) (or (and (= ULTIMATE.start_processEnvironment_~tmp~5 0) .cse0 (<= ~waterLevel~0 1) (= ~pumpRunning~0 0) .cse1) (and (not (= 0 ~pumpRunning~0)) (= ULTIMATE.start_isHighWaterLevel_~tmp~6 0) .cse0 .cse1))) [2018-12-31 09:48:08,822 INFO L444 ceAbstractionStarter]: At program point L90-1(lines 85 93) the Hoare annotation is: false [2018-12-31 09:48:08,822 INFO L444 ceAbstractionStarter]: At program point L90-2(lines 85 93) the Hoare annotation is: false [2018-12-31 09:48:08,822 INFO L444 ceAbstractionStarter]: At program point L834(lines 819 837) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_isHighWaterLevel_~tmp~6 0)) (.cse1 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse2 (<= ~waterLevel~0 1)) (.cse3 (= ~pumpRunning~0 0)) (.cse4 (= ~systemActive~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (and (and .cse1 .cse3) .cse0 (= 0 |ULTIMATE.start_isHighWaterSensorDry_#res|) .cse4) (= 1 |ULTIMATE.start_isHighWaterLevel_#res|) (= 1 ULTIMATE.start_isHighWaterLevel_~tmp___0~1)) (and (and (= 0 |ULTIMATE.start_isHighWaterLevel_#res|) (= 0 ULTIMATE.start_isHighWaterLevel_~tmp___0~1) .cse1 .cse2 .cse3) .cse4))) [2018-12-31 09:48:08,823 INFO L444 ceAbstractionStarter]: At program point L834-1(lines 819 837) the Hoare annotation is: false [2018-12-31 09:48:08,823 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-31 09:48:08,823 INFO L444 ceAbstractionStarter]: At program point L834-2(lines 819 837) the Hoare annotation is: false [2018-12-31 09:48:08,823 INFO L448 ceAbstractionStarter]: For program point L157(lines 157 161) no Hoare annotation was computed. [2018-12-31 09:48:08,823 INFO L448 ceAbstractionStarter]: For program point L157-1(lines 694 700) no Hoare annotation was computed. [2018-12-31 09:48:08,823 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 613) no Hoare annotation was computed. [2018-12-31 09:48:08,823 INFO L448 ceAbstractionStarter]: For program point L638(lines 638 644) no Hoare annotation was computed. [2018-12-31 09:48:08,823 INFO L444 ceAbstractionStarter]: At program point L638-1(lines 638 644) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (= ~systemActive~0 1))) (or (and (= ULTIMATE.start_isHighWaterLevel_~tmp~6 0) .cse0 .cse1) (and (and .cse0 (= ~pumpRunning~0 0)) .cse1))) [2018-12-31 09:48:08,823 INFO L448 ceAbstractionStarter]: For program point L77(lines 77 81) no Hoare annotation was computed. [2018-12-31 09:48:08,824 INFO L444 ceAbstractionStarter]: At program point L903(lines 898 906) the Hoare annotation is: (and (= 1 ~waterLevel~0) (= ~pumpRunning~0 0) (= ~systemActive~0 1)) [2018-12-31 09:48:08,824 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-31 09:48:08,824 INFO L448 ceAbstractionStarter]: For program point L854(lines 854 867) no Hoare annotation was computed. [2018-12-31 09:48:08,824 INFO L444 ceAbstractionStarter]: At program point L854-1(lines 1 906) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (= ~systemActive~0 1))) (or (and (not (= 0 ~pumpRunning~0)) (= ULTIMATE.start_isHighWaterLevel_~tmp~6 0) .cse0 .cse1) (and (<= ~waterLevel~0 1) (and .cse0 (= ~pumpRunning~0 0) .cse1)))) [2018-12-31 09:48:08,824 INFO L448 ceAbstractionStarter]: For program point L854-2(lines 854 867) no Hoare annotation was computed. [2018-12-31 09:48:08,824 INFO L444 ceAbstractionStarter]: At program point L854-3(lines 1 906) the Hoare annotation is: false [2018-12-31 09:48:08,824 INFO L448 ceAbstractionStarter]: For program point L854-4(lines 854 867) no Hoare annotation was computed. [2018-12-31 09:48:08,824 INFO L444 ceAbstractionStarter]: At program point L854-5(lines 1 906) the Hoare annotation is: false [2018-12-31 09:48:08,824 INFO L444 ceAbstractionStarter]: At program point L674(lines 627 675) the Hoare annotation is: false [2018-12-31 09:48:08,825 INFO L448 ceAbstractionStarter]: For program point L658(lines 658 669) no Hoare annotation was computed. [2018-12-31 09:48:08,825 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 613) no Hoare annotation was computed. [2018-12-31 09:48:08,825 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 236) no Hoare annotation was computed. [2018-12-31 09:48:08,825 INFO L451 ceAbstractionStarter]: At program point L229-1(lines 229 236) the Hoare annotation is: true [2018-12-31 09:48:08,825 INFO L448 ceAbstractionStarter]: For program point L130(lines 130 136) no Hoare annotation was computed. [2018-12-31 09:48:08,825 INFO L448 ceAbstractionStarter]: For program point L130-1(lines 130 136) no Hoare annotation was computed. [2018-12-31 09:48:08,825 INFO L448 ceAbstractionStarter]: For program point L130-2(lines 130 136) no Hoare annotation was computed. [2018-12-31 09:48:08,825 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 613) no Hoare annotation was computed. [2018-12-31 09:48:08,825 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 69) no Hoare annotation was computed. [2018-12-31 09:48:08,826 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-31 09:48:08,826 INFO L448 ceAbstractionStarter]: For program point L858(lines 858 864) no Hoare annotation was computed. [2018-12-31 09:48:08,826 INFO L448 ceAbstractionStarter]: For program point L858-2(lines 858 864) no Hoare annotation was computed. [2018-12-31 09:48:08,826 INFO L448 ceAbstractionStarter]: For program point L726(lines 726 743) no Hoare annotation was computed. [2018-12-31 09:48:08,826 INFO L448 ceAbstractionStarter]: For program point L858-4(lines 858 864) no Hoare annotation was computed. [2018-12-31 09:48:08,826 INFO L448 ceAbstractionStarter]: For program point L726-1(lines 726 743) no Hoare annotation was computed. [2018-12-31 09:48:08,826 INFO L448 ceAbstractionStarter]: For program point L726-2(lines 726 743) no Hoare annotation was computed. [2018-12-31 09:48:08,826 INFO L444 ceAbstractionStarter]: At program point L694(lines 693 712) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (= ~systemActive~0 1))) (or (and (= ULTIMATE.start_isHighWaterLevel_~tmp~6 0) .cse0 .cse1) (and (and .cse0 (= ~pumpRunning~0 0)) .cse1))) [2018-12-31 09:48:08,826 INFO L448 ceAbstractionStarter]: For program point L694-1(lines 694 700) no Hoare annotation was computed. [2018-12-31 09:48:08,826 INFO L444 ceAbstractionStarter]: At program point L694-2(lines 693 712) the Hoare annotation is: false [2018-12-31 09:48:08,827 INFO L444 ceAbstractionStarter]: At program point L694-3(lines 693 712) the Hoare annotation is: false [2018-12-31 09:48:08,827 INFO L448 ceAbstractionStarter]: For program point L629(lines 628 673) no Hoare annotation was computed. [2018-12-31 09:48:08,827 INFO L448 ceAbstractionStarter]: For program point L613(line 613) no Hoare annotation was computed. [2018-12-31 09:48:08,827 INFO L448 ceAbstractionStarter]: For program point L613-1(line 613) no Hoare annotation was computed. [2018-12-31 09:48:08,827 INFO L448 ceAbstractionStarter]: For program point L613-2(line 613) no Hoare annotation was computed. [2018-12-31 09:48:08,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 09:48:08 BoogieIcfgContainer [2018-12-31 09:48:08,850 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 09:48:08,850 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 09:48:08,850 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 09:48:08,851 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 09:48:08,851 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:47:59" (3/4) ... [2018-12-31 09:48:08,855 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-31 09:48:08,874 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 38 nodes and edges [2018-12-31 09:48:08,874 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2018-12-31 09:48:08,875 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2018-12-31 09:48:08,876 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-31 09:48:08,876 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-31 09:48:08,877 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-31 09:48:08,914 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((splverifierCounter == 0 && pumpRunning == 0) && 0 == \result) && systemActive == 1) || (((splverifierCounter == 0 && waterLevel <= 1) && pumpRunning == 0) && systemActive == 1) [2018-12-31 09:48:08,914 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(0 == pumpRunning) && tmp == 0) && splverifierCounter == 0) && systemActive == 1) || (((((tmp == 0 && \result <= 1) && splverifierCounter == 0) && waterLevel <= 1) && pumpRunning == 0) && systemActive == 1) [2018-12-31 09:48:08,915 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((tmp == 0 && splverifierCounter == 0) && waterLevel <= 1) && pumpRunning == 0) && systemActive == 1) || ((((((splverifierCounter == 0 && pumpRunning == 0) && tmp == 0) && 0 == \result) && systemActive == 1) && 1 == \result) && 1 == tmp___0)) || (((((0 == \result && 0 == tmp___0) && splverifierCounter == 0) && waterLevel <= 1) && pumpRunning == 0) && systemActive == 1) [2018-12-31 09:48:08,916 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(0 == pumpRunning) && tmp == 0) && splverifierCounter == 0) && !(0 == \result)) && systemActive == 1 [2018-12-31 09:48:08,997 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 09:48:08,998 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 09:48:08,999 INFO L168 Benchmark]: Toolchain (without parser) took 12071.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Free memory was 950.0 MB in the beginning and 977.3 MB in the end (delta: -27.3 MB). Peak memory consumption was 173.5 MB. Max. memory is 11.5 GB. [2018-12-31 09:48:08,999 INFO L168 Benchmark]: CDTParser took 0.53 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 09:48:09,002 INFO L168 Benchmark]: CACSL2BoogieTranslator took 713.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -175.8 MB). Peak memory consumption was 44.7 MB. Max. memory is 11.5 GB. [2018-12-31 09:48:09,002 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-31 09:48:09,003 INFO L168 Benchmark]: Boogie Preprocessor took 44.05 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 09:48:09,003 INFO L168 Benchmark]: RCFGBuilder took 1317.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.2 MB). Peak memory consumption was 58.2 MB. Max. memory is 11.5 GB. [2018-12-31 09:48:09,003 INFO L168 Benchmark]: TraceAbstraction took 9759.65 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.7 MB). Free memory was 1.1 GB in the beginning and 985.1 MB in the end (delta: 75.8 MB). Peak memory consumption was 268.6 MB. Max. memory is 11.5 GB. [2018-12-31 09:48:09,004 INFO L168 Benchmark]: Witness Printer took 147.35 ms. Allocated memory is still 1.2 GB. Free memory was 985.1 MB in the beginning and 977.3 MB in the end (delta: 7.8 MB). Peak memory consumption was 7.8 MB. Max. memory is 11.5 GB. [2018-12-31 09:48:09,008 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.53 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 713.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -175.8 MB). Peak memory consumption was 44.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 84.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.05 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1317.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.2 MB). Peak memory consumption was 58.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9759.65 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.7 MB). Free memory was 1.1 GB in the beginning and 985.1 MB in the end (delta: 75.8 MB). Peak memory consumption was 268.6 MB. Max. memory is 11.5 GB. * Witness Printer took 147.35 ms. Allocated memory is still 1.2 GB. Free memory was 985.1 MB in the beginning and 977.3 MB in the end (delta: 7.8 MB). Peak memory consumption was 7.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 613]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 613]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 613]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (((!(0 == pumpRunning) && tmp == 0) && splverifierCounter == 0) && systemActive == 1) || (((((tmp == 0 && \result <= 1) && splverifierCounter == 0) && waterLevel <= 1) && pumpRunning == 0) && systemActive == 1) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 627]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: (((splverifierCounter == 0 && pumpRunning == 0) && 0 == \result) && systemActive == 1) || (((splverifierCounter == 0 && waterLevel <= 1) && pumpRunning == 0) && systemActive == 1) - InvariantResult [Line: 693]: Loop Invariant Derived loop invariant: ((tmp == 0 && splverifierCounter == 0) && systemActive == 1) || ((splverifierCounter == 0 && pumpRunning == 0) && systemActive == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (1 == waterLevel && pumpRunning == 0) && systemActive == 1 - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: (1 == waterLevel && pumpRunning == 0) && systemActive == 1 - InvariantResult [Line: 774]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 638]: Loop Invariant Derived loop invariant: ((tmp == 0 && splverifierCounter == 0) && systemActive == 1) || ((splverifierCounter == 0 && pumpRunning == 0) && systemActive == 1) - InvariantResult [Line: 898]: Loop Invariant Derived loop invariant: (1 == waterLevel && pumpRunning == 0) && systemActive == 1 - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 85]: Loop Invariant Derived loop invariant: ((((tmp == 0 && splverifierCounter == 0) && waterLevel <= 1) && pumpRunning == 0) && systemActive == 1) || (((!(0 == pumpRunning) && tmp == 0) && splverifierCounter == 0) && systemActive == 1) - InvariantResult [Line: 819]: Loop Invariant Derived loop invariant: (((((tmp == 0 && splverifierCounter == 0) && waterLevel <= 1) && pumpRunning == 0) && systemActive == 1) || ((((((splverifierCounter == 0 && pumpRunning == 0) && tmp == 0) && 0 == \result) && systemActive == 1) && 1 == \result) && 1 == tmp___0)) || (((((0 == \result && 0 == tmp___0) && splverifierCounter == 0) && waterLevel <= 1) && pumpRunning == 0) && systemActive == 1) - InvariantResult [Line: 819]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 774]: Loop Invariant Derived loop invariant: (((!(0 == pumpRunning) && tmp == 0) && splverifierCounter == 0) && !(0 == \result)) && systemActive == 1 - InvariantResult [Line: 819]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((!(0 == pumpRunning) && tmp == 0) && splverifierCounter == 0) && systemActive == 1) || (waterLevel <= 1 && (splverifierCounter == 0 && pumpRunning == 0) && systemActive == 1) - InvariantResult [Line: 774]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 693]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 693]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 701]: Loop Invariant Derived loop invariant: ((((tmp == 0 && splverifierCounter == 0) && waterLevel <= 1) && pumpRunning == 0) && systemActive == 1) || (((!(0 == pumpRunning) && tmp == 0) && splverifierCounter == 0) && systemActive == 1) - InvariantResult [Line: 648]: Loop Invariant Derived loop invariant: ((tmp == 0 && splverifierCounter == 0) && systemActive == 1) || ((splverifierCounter == 0 && pumpRunning == 0) && systemActive == 1) - InvariantResult [Line: 701]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 701]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 85]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 219]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 85]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 229]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 84 locations, 3 error locations. SAFE Result, 9.6s OverallTime, 10 OverallIterations, 1 TraceHistogramMax, 3.3s AutomataDifference, 0.0s DeadEndRemovalTime, 3.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 751 SDtfs, 863 SDslu, 1100 SDs, 0 SdLazy, 178 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 595 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 33 LocationsWithAnnotation, 33 PreInvPairs, 94 NumberOfFragments, 349 HoareAnnotationTreeSize, 33 FomulaSimplifications, 23360 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 33 FomulaSimplificationsInter, 5249 FormulaSimplificationTreeSizeReductionInter, 3.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 276 NumberOfCodeBlocks, 276 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 266 ConstructedInterpolants, 0 QuantifiedInterpolants, 13265 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...