./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec2_product51_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f 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_spec2_product51_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 38d3472c1eb8f4a8d30b3059a3484ecd66f7fba4 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 14:51:51,908 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 14:51:51,909 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 14:51:51,921 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 14:51:51,921 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 14:51:51,922 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 14:51:51,924 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 14:51:51,926 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 14:51:51,928 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 14:51:51,928 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 14:51:51,929 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 14:51:51,930 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 14:51:51,931 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 14:51:51,932 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 14:51:51,933 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 14:51:51,934 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 14:51:51,935 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 14:51:51,941 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 14:51:51,943 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 14:51:51,947 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 14:51:51,949 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 14:51:51,954 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 14:51:51,959 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 14:51:51,959 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 14:51:51,959 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 14:51:51,961 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 14:51:51,962 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 14:51:51,962 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 14:51:51,968 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 14:51:51,969 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 14:51:51,969 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 14:51:51,975 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 14:51:51,977 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 14:51:51,977 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 14:51:51,978 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 14:51:51,980 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 14:51:51,982 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 14:51:52,013 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 14:51:52,014 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 14:51:52,018 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 14:51:52,018 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 14:51:52,018 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 14:51:52,018 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 14:51:52,019 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 14:51:52,019 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 14:51:52,019 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 14:51:52,019 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 14:51:52,019 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 14:51:52,019 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 14:51:52,020 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 14:51:52,021 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 14:51:52,021 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 14:51:52,021 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 14:51:52,021 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 14:51:52,022 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 14:51:52,022 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 14:51:52,023 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 14:51:52,023 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 14:51:52,023 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:51:52,023 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 14:51:52,023 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 14:51:52,023 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 14:51:52,024 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 14:51:52,024 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 14:51:52,024 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 14:51:52,024 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 -> 38d3472c1eb8f4a8d30b3059a3484ecd66f7fba4 [2019-01-12 14:51:52,075 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 14:51:52,087 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 14:51:52,090 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 14:51:52,092 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 14:51:52,092 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 14:51:52,093 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec2_product51_true-unreach-call_false-termination.cil.c [2019-01-12 14:51:52,150 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a2c77622/8ddb3acc05d347938a5ab61ab67d573d/FLAG2a4a2cefc [2019-01-12 14:51:52,654 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 14:51:52,655 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec2_product51_true-unreach-call_false-termination.cil.c [2019-01-12 14:51:52,669 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a2c77622/8ddb3acc05d347938a5ab61ab67d573d/FLAG2a4a2cefc [2019-01-12 14:51:52,984 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a2c77622/8ddb3acc05d347938a5ab61ab67d573d [2019-01-12 14:51:52,987 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 14:51:52,989 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 14:51:52,990 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 14:51:52,990 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 14:51:52,993 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 14:51:52,994 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:51:52" (1/1) ... [2019-01-12 14:51:52,997 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@92648db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:51:52, skipping insertion in model container [2019-01-12 14:51:52,997 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:51:52" (1/1) ... [2019-01-12 14:51:53,005 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 14:51:53,068 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 14:51:53,394 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:51:53,425 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 14:51:53,633 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:51:53,668 INFO L195 MainTranslator]: Completed translation [2019-01-12 14:51:53,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:51:53 WrapperNode [2019-01-12 14:51:53,669 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 14:51:53,670 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 14:51:53,671 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 14:51:53,671 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 14:51:53,679 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:51:53" (1/1) ... [2019-01-12 14:51:53,703 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:51:53" (1/1) ... [2019-01-12 14:51:53,749 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 14:51:53,749 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 14:51:53,749 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 14:51:53,749 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 14:51:53,760 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:51:53" (1/1) ... [2019-01-12 14:51:53,760 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:51:53" (1/1) ... [2019-01-12 14:51:53,765 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:51:53" (1/1) ... [2019-01-12 14:51:53,765 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:51:53" (1/1) ... [2019-01-12 14:51:53,778 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:51:53" (1/1) ... [2019-01-12 14:51:53,788 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:51:53" (1/1) ... [2019-01-12 14:51:53,791 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:51:53" (1/1) ... [2019-01-12 14:51:53,795 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 14:51:53,796 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 14:51:53,796 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 14:51:53,796 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 14:51:53,797 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:51:53" (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 [2019-01-12 14:51:53,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 14:51:53,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-12 14:51:53,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 14:51:53,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 14:51:55,102 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 14:51:55,103 INFO L286 CfgBuilder]: Removed 162 assue(true) statements. [2019-01-12 14:51:55,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:51:55 BoogieIcfgContainer [2019-01-12 14:51:55,105 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 14:51:55,106 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 14:51:55,106 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 14:51:55,109 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 14:51:55,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 02:51:52" (1/3) ... [2019-01-12 14:51:55,110 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68516621 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:51:55, skipping insertion in model container [2019-01-12 14:51:55,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:51:53" (2/3) ... [2019-01-12 14:51:55,111 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68516621 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:51:55, skipping insertion in model container [2019-01-12 14:51:55,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:51:55" (3/3) ... [2019-01-12 14:51:55,113 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product51_true-unreach-call_false-termination.cil.c [2019-01-12 14:51:55,121 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 14:51:55,128 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-12 14:51:55,144 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-12 14:51:55,174 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 14:51:55,175 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 14:51:55,175 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 14:51:55,175 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 14:51:55,176 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 14:51:55,176 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 14:51:55,176 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 14:51:55,176 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 14:51:55,177 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 14:51:55,196 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states. [2019-01-12 14:51:55,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-12 14:51:55,204 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:51:55,205 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:51:55,207 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:51:55,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:51:55,213 INFO L82 PathProgramCache]: Analyzing trace with hash 815277316, now seen corresponding path program 1 times [2019-01-12 14:51:55,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:51:55,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:51:55,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:51:55,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:51:55,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:51:55,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:51:55,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:51:55,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:51:55,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:51:55,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 14:51:55,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 14:51:55,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 14:51:55,511 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 2 states. [2019-01-12 14:51:55,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:51:55,544 INFO L93 Difference]: Finished difference Result 239 states and 366 transitions. [2019-01-12 14:51:55,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 14:51:55,545 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-01-12 14:51:55,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:51:55,564 INFO L225 Difference]: With dead ends: 239 [2019-01-12 14:51:55,564 INFO L226 Difference]: Without dead ends: 119 [2019-01-12 14:51:55,568 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 [2019-01-12 14:51:55,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-12 14:51:55,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-01-12 14:51:55,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-01-12 14:51:55,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 175 transitions. [2019-01-12 14:51:55,627 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 175 transitions. Word has length 18 [2019-01-12 14:51:55,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:51:55,628 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 175 transitions. [2019-01-12 14:51:55,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 14:51:55,628 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 175 transitions. [2019-01-12 14:51:55,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-12 14:51:55,630 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:51:55,630 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:51:55,630 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:51:55,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:51:55,631 INFO L82 PathProgramCache]: Analyzing trace with hash 596441347, now seen corresponding path program 1 times [2019-01-12 14:51:55,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:51:55,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:51:55,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:51:55,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:51:55,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:51:55,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:51:55,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:51:55,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:51:55,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:51:55,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:51:55,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:51:55,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:51:55,846 INFO L87 Difference]: Start difference. First operand 119 states and 175 transitions. Second operand 3 states. [2019-01-12 14:51:55,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:51:55,884 INFO L93 Difference]: Finished difference Result 119 states and 175 transitions. [2019-01-12 14:51:55,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:51:55,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-01-12 14:51:55,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:51:55,887 INFO L225 Difference]: With dead ends: 119 [2019-01-12 14:51:55,887 INFO L226 Difference]: Without dead ends: 51 [2019-01-12 14:51:55,891 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 [2019-01-12 14:51:55,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-12 14:51:55,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-01-12 14:51:55,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-12 14:51:55,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 74 transitions. [2019-01-12 14:51:55,904 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 74 transitions. Word has length 19 [2019-01-12 14:51:55,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:51:55,904 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 74 transitions. [2019-01-12 14:51:55,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:51:55,905 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 74 transitions. [2019-01-12 14:51:55,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-12 14:51:55,906 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:51:55,906 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] [2019-01-12 14:51:55,907 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:51:55,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:51:55,907 INFO L82 PathProgramCache]: Analyzing trace with hash -781547841, now seen corresponding path program 1 times [2019-01-12 14:51:55,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:51:55,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:51:55,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:51:55,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:51:55,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:51:55,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:51:56,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:51:56,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:51:56,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:51:56,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 14:51:56,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 14:51:56,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 14:51:56,160 INFO L87 Difference]: Start difference. First operand 51 states and 74 transitions. Second operand 6 states. [2019-01-12 14:51:56,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:51:56,415 INFO L93 Difference]: Finished difference Result 163 states and 244 transitions. [2019-01-12 14:51:56,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:51:56,418 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-01-12 14:51:56,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:51:56,420 INFO L225 Difference]: With dead ends: 163 [2019-01-12 14:51:56,421 INFO L226 Difference]: Without dead ends: 119 [2019-01-12 14:51:56,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:51:56,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-12 14:51:56,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 71. [2019-01-12 14:51:56,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-12 14:51:56,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 105 transitions. [2019-01-12 14:51:56,437 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 105 transitions. Word has length 24 [2019-01-12 14:51:56,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:51:56,437 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 105 transitions. [2019-01-12 14:51:56,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 14:51:56,438 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 105 transitions. [2019-01-12 14:51:56,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-12 14:51:56,439 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:51:56,439 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] [2019-01-12 14:51:56,440 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:51:56,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:51:56,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1063081859, now seen corresponding path program 1 times [2019-01-12 14:51:56,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:51:56,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:51:56,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:51:56,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:51:56,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:51:56,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:51:56,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:51:56,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:51:56,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:51:56,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:51:56,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:51:56,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:51:56,542 INFO L87 Difference]: Start difference. First operand 71 states and 105 transitions. Second operand 3 states. [2019-01-12 14:51:56,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:51:56,680 INFO L93 Difference]: Finished difference Result 157 states and 235 transitions. [2019-01-12 14:51:56,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:51:56,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-01-12 14:51:56,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:51:56,684 INFO L225 Difference]: With dead ends: 157 [2019-01-12 14:51:56,684 INFO L226 Difference]: Without dead ends: 93 [2019-01-12 14:51:56,685 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 [2019-01-12 14:51:56,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-12 14:51:56,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2019-01-12 14:51:56,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-12 14:51:56,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 131 transitions. [2019-01-12 14:51:56,708 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 131 transitions. Word has length 26 [2019-01-12 14:51:56,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:51:56,709 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 131 transitions. [2019-01-12 14:51:56,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:51:56,710 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 131 transitions. [2019-01-12 14:51:56,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-12 14:51:56,711 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:51:56,711 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] [2019-01-12 14:51:56,712 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:51:56,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:51:56,712 INFO L82 PathProgramCache]: Analyzing trace with hash -460039864, now seen corresponding path program 1 times [2019-01-12 14:51:56,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:51:56,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:51:56,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:51:56,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:51:56,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:51:56,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:51:56,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:51:56,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:51:56,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:51:56,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:51:56,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:51:56,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:51:56,863 INFO L87 Difference]: Start difference. First operand 91 states and 131 transitions. Second operand 5 states. [2019-01-12 14:51:57,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:51:57,247 INFO L93 Difference]: Finished difference Result 452 states and 663 transitions. [2019-01-12 14:51:57,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 14:51:57,248 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-01-12 14:51:57,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:51:57,251 INFO L225 Difference]: With dead ends: 452 [2019-01-12 14:51:57,251 INFO L226 Difference]: Without dead ends: 368 [2019-01-12 14:51:57,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:51:57,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2019-01-12 14:51:57,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 164. [2019-01-12 14:51:57,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-01-12 14:51:57,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 233 transitions. [2019-01-12 14:51:57,279 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 233 transitions. Word has length 27 [2019-01-12 14:51:57,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:51:57,280 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 233 transitions. [2019-01-12 14:51:57,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:51:57,280 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 233 transitions. [2019-01-12 14:51:57,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-12 14:51:57,281 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:51:57,281 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] [2019-01-12 14:51:57,282 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:51:57,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:51:57,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1894185024, now seen corresponding path program 1 times [2019-01-12 14:51:57,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:51:57,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:51:57,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:51:57,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:51:57,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:51:57,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:51:57,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:51:57,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:51:57,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:51:57,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:51:57,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:51:57,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:51:57,590 INFO L87 Difference]: Start difference. First operand 164 states and 233 transitions. Second operand 5 states. [2019-01-12 14:51:58,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:51:58,684 INFO L93 Difference]: Finished difference Result 605 states and 865 transitions. [2019-01-12 14:51:58,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 14:51:58,685 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-01-12 14:51:58,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:51:58,689 INFO L225 Difference]: With dead ends: 605 [2019-01-12 14:51:58,689 INFO L226 Difference]: Without dead ends: 448 [2019-01-12 14:51:58,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:51:58,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2019-01-12 14:51:58,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 162. [2019-01-12 14:51:58,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-01-12 14:51:58,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 227 transitions. [2019-01-12 14:51:58,744 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 227 transitions. Word has length 28 [2019-01-12 14:51:58,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:51:58,746 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 227 transitions. [2019-01-12 14:51:58,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:51:58,746 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 227 transitions. [2019-01-12 14:51:58,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-12 14:51:58,752 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:51:58,752 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, 1] [2019-01-12 14:51:58,752 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:51:58,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:51:58,753 INFO L82 PathProgramCache]: Analyzing trace with hash -44877900, now seen corresponding path program 1 times [2019-01-12 14:51:58,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:51:58,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:51:58,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:51:58,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:51:58,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:51:58,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:51:58,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:51:58,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:51:58,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:51:58,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:51:58,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:51:58,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:51:58,848 INFO L87 Difference]: Start difference. First operand 162 states and 227 transitions. Second operand 5 states. [2019-01-12 14:51:59,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:51:59,424 INFO L93 Difference]: Finished difference Result 479 states and 665 transitions. [2019-01-12 14:51:59,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:51:59,425 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-01-12 14:51:59,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:51:59,427 INFO L225 Difference]: With dead ends: 479 [2019-01-12 14:51:59,428 INFO L226 Difference]: Without dead ends: 324 [2019-01-12 14:51:59,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 14:51:59,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-01-12 14:51:59,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 174. [2019-01-12 14:51:59,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-01-12 14:51:59,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 239 transitions. [2019-01-12 14:51:59,463 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 239 transitions. Word has length 33 [2019-01-12 14:51:59,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:51:59,464 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 239 transitions. [2019-01-12 14:51:59,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:51:59,464 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 239 transitions. [2019-01-12 14:51:59,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-12 14:51:59,465 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:51:59,465 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, 1] [2019-01-12 14:51:59,465 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:51:59,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:51:59,466 INFO L82 PathProgramCache]: Analyzing trace with hash 656186678, now seen corresponding path program 1 times [2019-01-12 14:51:59,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:51:59,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:51:59,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:51:59,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:51:59,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:51:59,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:51:59,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:51:59,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:51:59,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 14:51:59,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 14:51:59,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 14:51:59,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 14:51:59,587 INFO L87 Difference]: Start difference. First operand 174 states and 239 transitions. Second operand 6 states. [2019-01-12 14:52:00,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:52:00,010 INFO L93 Difference]: Finished difference Result 513 states and 699 transitions. [2019-01-12 14:52:00,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 14:52:00,012 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-01-12 14:52:00,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:52:00,014 INFO L225 Difference]: With dead ends: 513 [2019-01-12 14:52:00,015 INFO L226 Difference]: Without dead ends: 346 [2019-01-12 14:52:00,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-01-12 14:52:00,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-01-12 14:52:00,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 182. [2019-01-12 14:52:00,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-01-12 14:52:00,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 247 transitions. [2019-01-12 14:52:00,065 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 247 transitions. Word has length 33 [2019-01-12 14:52:00,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:52:00,067 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 247 transitions. [2019-01-12 14:52:00,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 14:52:00,067 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 247 transitions. [2019-01-12 14:52:00,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-12 14:52:00,074 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:52:00,074 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, 1] [2019-01-12 14:52:00,075 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:52:00,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:52:00,075 INFO L82 PathProgramCache]: Analyzing trace with hash 69380664, now seen corresponding path program 1 times [2019-01-12 14:52:00,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:52:00,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:52:00,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:00,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:52:00,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:00,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:52:00,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:52:00,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:52:00,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:52:00,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:52:00,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:52:00,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:52:00,178 INFO L87 Difference]: Start difference. First operand 182 states and 247 transitions. Second operand 3 states. [2019-01-12 14:52:00,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:52:00,412 INFO L93 Difference]: Finished difference Result 445 states and 603 transitions. [2019-01-12 14:52:00,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:52:00,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-01-12 14:52:00,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:52:00,415 INFO L225 Difference]: With dead ends: 445 [2019-01-12 14:52:00,415 INFO L226 Difference]: Without dead ends: 270 [2019-01-12 14:52:00,416 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 [2019-01-12 14:52:00,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-01-12 14:52:00,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2019-01-12 14:52:00,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-01-12 14:52:00,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 357 transitions. [2019-01-12 14:52:00,456 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 357 transitions. Word has length 33 [2019-01-12 14:52:00,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:52:00,456 INFO L480 AbstractCegarLoop]: Abstraction has 270 states and 357 transitions. [2019-01-12 14:52:00,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:52:00,457 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 357 transitions. [2019-01-12 14:52:00,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-12 14:52:00,457 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:52:00,458 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, 1, 1] [2019-01-12 14:52:00,458 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:52:00,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:52:00,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1964012792, now seen corresponding path program 1 times [2019-01-12 14:52:00,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:52:00,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:52:00,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:00,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:52:00,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:00,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:52:00,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:52:00,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:52:00,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:52:00,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:52:00,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:52:00,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:52:00,547 INFO L87 Difference]: Start difference. First operand 270 states and 357 transitions. Second operand 3 states. [2019-01-12 14:52:00,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:52:00,685 INFO L93 Difference]: Finished difference Result 389 states and 516 transitions. [2019-01-12 14:52:00,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:52:00,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-01-12 14:52:00,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:52:00,688 INFO L225 Difference]: With dead ends: 389 [2019-01-12 14:52:00,688 INFO L226 Difference]: Without dead ends: 387 [2019-01-12 14:52:00,688 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 [2019-01-12 14:52:00,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-01-12 14:52:00,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 316. [2019-01-12 14:52:00,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-01-12 14:52:00,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 425 transitions. [2019-01-12 14:52:00,727 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 425 transitions. Word has length 34 [2019-01-12 14:52:00,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:52:00,728 INFO L480 AbstractCegarLoop]: Abstraction has 316 states and 425 transitions. [2019-01-12 14:52:00,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:52:00,729 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 425 transitions. [2019-01-12 14:52:00,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-12 14:52:00,730 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:52:00,731 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:52:00,731 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:52:00,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:52:00,731 INFO L82 PathProgramCache]: Analyzing trace with hash -2090460060, now seen corresponding path program 1 times [2019-01-12 14:52:00,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:52:00,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:52:00,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:00,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:52:00,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:00,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:52:01,090 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:52:01,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:52:01,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 14:52:01,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 14:52:01,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 14:52:01,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 14:52:01,093 INFO L87 Difference]: Start difference. First operand 316 states and 425 transitions. Second operand 6 states. [2019-01-12 14:52:02,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:52:02,226 INFO L93 Difference]: Finished difference Result 1729 states and 2372 transitions. [2019-01-12 14:52:02,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 14:52:02,227 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-01-12 14:52:02,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:52:02,234 INFO L225 Difference]: With dead ends: 1729 [2019-01-12 14:52:02,234 INFO L226 Difference]: Without dead ends: 1508 [2019-01-12 14:52:02,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-01-12 14:52:02,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2019-01-12 14:52:02,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 659. [2019-01-12 14:52:02,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-01-12 14:52:02,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 886 transitions. [2019-01-12 14:52:02,362 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 886 transitions. Word has length 58 [2019-01-12 14:52:02,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:52:02,363 INFO L480 AbstractCegarLoop]: Abstraction has 659 states and 886 transitions. [2019-01-12 14:52:02,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 14:52:02,363 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 886 transitions. [2019-01-12 14:52:02,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-12 14:52:02,364 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:52:02,364 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:52:02,365 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:52:02,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:52:02,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1832294622, now seen corresponding path program 1 times [2019-01-12 14:52:02,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:52:02,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:52:02,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:02,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:52:02,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:02,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:52:02,508 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-12 14:52:02,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:52:02,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 14:52:02,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 14:52:02,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 14:52:02,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-12 14:52:02,510 INFO L87 Difference]: Start difference. First operand 659 states and 886 transitions. Second operand 7 states. [2019-01-12 14:52:03,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:52:03,054 INFO L93 Difference]: Finished difference Result 1322 states and 1767 transitions. [2019-01-12 14:52:03,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 14:52:03,055 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-01-12 14:52:03,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:52:03,059 INFO L225 Difference]: With dead ends: 1322 [2019-01-12 14:52:03,059 INFO L226 Difference]: Without dead ends: 758 [2019-01-12 14:52:03,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-01-12 14:52:03,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2019-01-12 14:52:03,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 366. [2019-01-12 14:52:03,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-01-12 14:52:03,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 473 transitions. [2019-01-12 14:52:03,134 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 473 transitions. Word has length 58 [2019-01-12 14:52:03,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:52:03,134 INFO L480 AbstractCegarLoop]: Abstraction has 366 states and 473 transitions. [2019-01-12 14:52:03,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 14:52:03,135 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 473 transitions. [2019-01-12 14:52:03,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-12 14:52:03,136 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:52:03,136 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:52:03,136 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:52:03,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:52:03,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1973254398, now seen corresponding path program 1 times [2019-01-12 14:52:03,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:52:03,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:52:03,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:03,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:52:03,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:03,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:52:03,387 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:52:03,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:52:03,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:52:03,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:52:03,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:52:03,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:52:03,389 INFO L87 Difference]: Start difference. First operand 366 states and 473 transitions. Second operand 5 states. [2019-01-12 14:52:03,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:52:03,556 INFO L93 Difference]: Finished difference Result 634 states and 825 transitions. [2019-01-12 14:52:03,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 14:52:03,557 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-01-12 14:52:03,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:52:03,559 INFO L225 Difference]: With dead ends: 634 [2019-01-12 14:52:03,559 INFO L226 Difference]: Without dead ends: 363 [2019-01-12 14:52:03,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 14:52:03,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-01-12 14:52:03,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 359. [2019-01-12 14:52:03,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-01-12 14:52:03,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 456 transitions. [2019-01-12 14:52:03,628 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 456 transitions. Word has length 58 [2019-01-12 14:52:03,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:52:03,629 INFO L480 AbstractCegarLoop]: Abstraction has 359 states and 456 transitions. [2019-01-12 14:52:03,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:52:03,629 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 456 transitions. [2019-01-12 14:52:03,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-12 14:52:03,630 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:52:03,631 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:52:03,631 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:52:03,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:52:03,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1655944216, now seen corresponding path program 1 times [2019-01-12 14:52:03,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:52:03,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:52:03,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:03,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:52:03,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:03,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:52:03,721 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-12 14:52:03,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:52:03,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:52:03,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:52:03,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:52:03,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:52:03,722 INFO L87 Difference]: Start difference. First operand 359 states and 456 transitions. Second operand 3 states. [2019-01-12 14:52:03,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:52:03,856 INFO L93 Difference]: Finished difference Result 707 states and 897 transitions. [2019-01-12 14:52:03,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:52:03,857 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-01-12 14:52:03,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:52:03,857 INFO L225 Difference]: With dead ends: 707 [2019-01-12 14:52:03,857 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 14:52:03,858 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 [2019-01-12 14:52:03,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 14:52:03,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 14:52:03,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 14:52:03,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 14:52:03,860 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 61 [2019-01-12 14:52:03,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:52:03,860 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 14:52:03,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:52:03,860 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 14:52:03,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 14:52:03,865 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 14:52:03,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:04,286 WARN L181 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 253 DAG size of output: 232 [2019-01-12 14:52:04,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:04,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:04,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:04,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:04,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:04,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:04,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:04,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:04,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:04,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:04,510 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 185 [2019-01-12 14:52:04,645 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:04,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:04,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:04,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:04,710 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:04,737 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:04,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:04,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:04,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:04,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:04,807 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 187 [2019-01-12 14:52:04,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:05,079 WARN L181 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 257 DAG size of output: 234 [2019-01-12 14:52:05,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:05,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:05,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:05,315 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 129 [2019-01-12 14:52:05,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:05,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:05,522 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 114 [2019-01-12 14:52:05,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:05,866 WARN L181 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 245 DAG size of output: 225 [2019-01-12 14:52:05,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:06,075 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 241 DAG size of output: 221 [2019-01-12 14:52:06,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:06,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:06,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:06,230 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 184 [2019-01-12 14:52:08,329 WARN L181 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 226 DAG size of output: 38 [2019-01-12 14:52:09,414 WARN L181 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 178 DAG size of output: 28 [2019-01-12 14:52:09,529 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 21 [2019-01-12 14:52:09,871 WARN L181 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 38 [2019-01-12 14:52:11,007 WARN L181 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 180 DAG size of output: 28 [2019-01-12 14:52:12,442 WARN L181 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 228 DAG size of output: 36 [2019-01-12 14:52:12,576 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 29 [2019-01-12 14:52:13,070 WARN L181 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 29 [2019-01-12 14:52:13,531 WARN L181 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 41 [2019-01-12 14:52:14,032 WARN L181 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 25 [2019-01-12 14:52:15,517 WARN L181 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 219 DAG size of output: 32 [2019-01-12 14:52:16,696 WARN L181 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 215 DAG size of output: 29 [2019-01-12 14:52:17,542 WARN L181 SmtUtils]: Spent 842.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 33 [2019-01-12 14:52:17,570 INFO L448 ceAbstractionStarter]: For program point L531(lines 531 535) no Hoare annotation was computed. [2019-01-12 14:52:17,570 INFO L448 ceAbstractionStarter]: For program point L531-1(lines 129 135) no Hoare annotation was computed. [2019-01-12 14:52:17,570 INFO L444 ceAbstractionStarter]: At program point L399(lines 1 986) the Hoare annotation is: (and (= 1 ~systemActive~0) (= ~methAndRunningLastTime~0 0) (= 0 ~methaneLevelCritical~0) (= ~waterLevel~0 1) (= ~pumpRunning~0 0)) [2019-01-12 14:52:17,571 INFO L444 ceAbstractionStarter]: At program point L136(lines 136 142) the Hoare annotation is: (let ((.cse4 (= ULTIMATE.start_test_~splverifierCounter~0 0))) (let ((.cse1 (<= 2 ~waterLevel~0)) (.cse2 (and .cse4 (not (= 0 ~systemActive~0)))) (.cse0 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse3 (= ULTIMATE.start_main_~tmp~6 1))) (or (and (and .cse0 (= ~methAndRunningLastTime~0 0) .cse1 .cse2) .cse3) (and .cse3 (and .cse1 (and .cse0 (and .cse2 (= 0 ~methaneLevelCritical~0))))) (and (and .cse0 .cse3 (and .cse4 (= ~pumpRunning~0 0))) (<= 1 ~waterLevel~0))))) [2019-01-12 14:52:17,571 INFO L444 ceAbstractionStarter]: At program point L103(lines 54 104) the Hoare annotation is: false [2019-01-12 14:52:17,571 INFO L444 ceAbstractionStarter]: At program point L136-1(lines 136 142) the Hoare annotation is: false [2019-01-12 14:52:17,571 INFO L444 ceAbstractionStarter]: At program point L136-2(lines 136 142) the Hoare annotation is: false [2019-01-12 14:52:17,571 INFO L448 ceAbstractionStarter]: For program point L599(lines 599 606) no Hoare annotation was computed. [2019-01-12 14:52:17,572 INFO L451 ceAbstractionStarter]: At program point L599-1(lines 599 606) the Hoare annotation is: true [2019-01-12 14:52:17,572 INFO L444 ceAbstractionStarter]: At program point L501(lines 492 505) the Hoare annotation is: false [2019-01-12 14:52:17,572 INFO L444 ceAbstractionStarter]: At program point L501-1(lines 492 505) the Hoare annotation is: (let ((.cse2 (and (= ULTIMATE.start_test_~splverifierCounter~0 0) (not (= 0 ~systemActive~0))))) (let ((.cse1 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse0 (<= 2 ~waterLevel~0)) (.cse4 (and .cse2 (= ~pumpRunning~0 0))) (.cse3 (= ULTIMATE.start_main_~tmp~6 1))) (or (and (and .cse0 (and .cse1 (and (and .cse2 (= 0 ~methaneLevelCritical~0)) (= 0 ~pumpRunning~0)))) .cse3) (and .cse3 (and (and .cse1 (not (= 0 |ULTIMATE.start_isHighWaterSensorDry_#res|)) .cse4) (<= 1 ~waterLevel~0))) (and (and .cse1 (= ~methAndRunningLastTime~0 0) .cse0 .cse4) .cse3)))) [2019-01-12 14:52:17,572 INFO L444 ceAbstractionStarter]: At program point L501-2(lines 492 505) the Hoare annotation is: false [2019-01-12 14:52:17,572 INFO L444 ceAbstractionStarter]: At program point L501-3(lines 492 505) the Hoare annotation is: false [2019-01-12 14:52:17,572 INFO L444 ceAbstractionStarter]: At program point L501-4(lines 492 505) the Hoare annotation is: false [2019-01-12 14:52:17,572 INFO L444 ceAbstractionStarter]: At program point L501-5(lines 492 505) the Hoare annotation is: false [2019-01-12 14:52:17,573 INFO L444 ceAbstractionStarter]: At program point L240(lines 235 243) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse2 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (= ULTIMATE.start_main_~tmp~6 1))) (or (and (and .cse0 (= 0 |ULTIMATE.start_isPumpRunning_#res|) .cse1 .cse2 (= ~pumpRunning~0 0)) (<= 1 ~waterLevel~0)) (and (not (= 0 ~pumpRunning~0)) (and .cse0 (and .cse2 (not (= 0 ~systemActive~0))) (= ~methAndRunningLastTime~0 0) .cse1 (<= 2 ~waterLevel~0))))) [2019-01-12 14:52:17,573 INFO L444 ceAbstractionStarter]: At program point L240-1(lines 235 243) the Hoare annotation is: false [2019-01-12 14:52:17,573 INFO L444 ceAbstractionStarter]: At program point L240-2(lines 235 243) the Hoare annotation is: false [2019-01-12 14:52:17,573 INFO L448 ceAbstractionStarter]: For program point L75(lines 75 81) no Hoare annotation was computed. [2019-01-12 14:52:17,573 INFO L444 ceAbstractionStarter]: At program point L75-1(lines 75 81) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_main_~tmp~6 1)) (.cse0 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse2 (= ULTIMATE.start_test_~splverifierCounter~0 0))) (or (and (= ~methAndRunningLastTime~0 0) (and .cse0 .cse1 (and .cse2 (= ~pumpRunning~0 0))) (<= 1 ~waterLevel~0)) (and (and .cse1 (and .cse0 (<= 2 ~waterLevel~0) (and .cse2 (not (= 0 ~systemActive~0))))) (not (= 0 ~pumpRunning~0))))) [2019-01-12 14:52:17,573 INFO L444 ceAbstractionStarter]: At program point L407(lines 402 410) the Hoare annotation is: (and (= 1 ~systemActive~0) (= ~methAndRunningLastTime~0 0) (= 0 ~methaneLevelCritical~0) (= ~waterLevel~0 1) (= |ULTIMATE.start_valid_product_#res| ~systemActive~0) (= ~pumpRunning~0 0)) [2019-01-12 14:52:17,573 INFO L444 ceAbstractionStarter]: At program point L341(lines 336 343) the Hoare annotation is: (and (= ~methAndRunningLastTime~0 0) (= 0 ~methaneLevelCritical~0) (= ULTIMATE.start_main_~tmp~6 1) (= ~waterLevel~0 1) (= |ULTIMATE.start_valid_product_#res| ~systemActive~0) (= ~pumpRunning~0 0) (= ULTIMATE.start_main_~tmp~6 ~systemActive~0)) [2019-01-12 14:52:17,573 INFO L448 ceAbstractionStarter]: For program point L308(lines 308 312) no Hoare annotation was computed. [2019-01-12 14:52:17,574 INFO L448 ceAbstractionStarter]: For program point L308-2(lines 308 312) no Hoare annotation was computed. [2019-01-12 14:52:17,574 INFO L448 ceAbstractionStarter]: For program point L308-3(lines 308 312) no Hoare annotation was computed. [2019-01-12 14:52:17,574 INFO L448 ceAbstractionStarter]: For program point L308-5(lines 308 312) no Hoare annotation was computed. [2019-01-12 14:52:17,574 INFO L448 ceAbstractionStarter]: For program point L308-6(lines 308 312) no Hoare annotation was computed. [2019-01-12 14:52:17,574 INFO L448 ceAbstractionStarter]: For program point L308-8(lines 308 312) no Hoare annotation was computed. [2019-01-12 14:52:17,574 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 617) no Hoare annotation was computed. [2019-01-12 14:52:17,574 INFO L451 ceAbstractionStarter]: At program point L608(lines 589 611) the Hoare annotation is: true [2019-01-12 14:52:17,574 INFO L444 ceAbstractionStarter]: At program point L575(lines 571 577) the Hoare annotation is: (and (= ~methAndRunningLastTime~0 0) (= 0 ~methaneLevelCritical~0) (= ULTIMATE.start_main_~tmp~6 1) (= ~waterLevel~0 1) (= |ULTIMATE.start_valid_product_#res| ~systemActive~0) (= ~pumpRunning~0 0) (= ULTIMATE.start_main_~tmp~6 ~systemActive~0)) [2019-01-12 14:52:17,575 INFO L448 ceAbstractionStarter]: For program point L443(lines 443 447) no Hoare annotation was computed. [2019-01-12 14:52:17,575 INFO L444 ceAbstractionStarter]: At program point L511(lines 506 514) the Hoare annotation is: (and (= |ULTIMATE.start_valid_product_#res| 1) (not (= 0 ~pumpRunning~0)) (= ULTIMATE.start_main_~tmp~6 1) (= 0 |ULTIMATE.start_isLowWaterSensorDry_#res|) (= ULTIMATE.start_test_~splverifierCounter~0 0) (<= 1 ~waterLevel~0) (not (= 0 ~systemActive~0))) [2019-01-12 14:52:17,575 INFO L444 ceAbstractionStarter]: At program point L511-1(lines 506 514) the Hoare annotation is: false [2019-01-12 14:52:17,575 INFO L444 ceAbstractionStarter]: At program point L511-2(lines 506 514) the Hoare annotation is: false [2019-01-12 14:52:17,575 INFO L444 ceAbstractionStarter]: At program point L314(lines 299 317) the Hoare annotation is: (and (= |ULTIMATE.start_valid_product_#res| 1) (not (= 0 |ULTIMATE.start_isLowWaterLevel_#res|)) (not (= 0 ~pumpRunning~0)) (= ULTIMATE.start_main_~tmp~6 1) (= 0 |ULTIMATE.start_isLowWaterSensorDry_#res|) (= ULTIMATE.start_test_~splverifierCounter~0 0) (not (= 0 ULTIMATE.start_isLowWaterLevel_~tmp___0~2)) (<= 1 ~waterLevel~0) (= 0 ULTIMATE.start_isLowWaterLevel_~tmp~4) (not (= 0 ~systemActive~0))) [2019-01-12 14:52:17,575 INFO L444 ceAbstractionStarter]: At program point L314-1(lines 299 317) the Hoare annotation is: false [2019-01-12 14:52:17,575 INFO L444 ceAbstractionStarter]: At program point L314-2(lines 299 317) the Hoare annotation is: false [2019-01-12 14:52:17,575 INFO L448 ceAbstractionStarter]: For program point L85(lines 85 98) no Hoare annotation was computed. [2019-01-12 14:52:17,575 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 14:52:17,576 INFO L448 ceAbstractionStarter]: For program point L352(lines 352 369) no Hoare annotation was computed. [2019-01-12 14:52:17,576 INFO L444 ceAbstractionStarter]: At program point L352-1(lines 1 986) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse1 (= ULTIMATE.start_main_~tmp~6 1)) (.cse2 (= ULTIMATE.start_test_~splverifierCounter~0 0))) (or (and (not (= 0 ~pumpRunning~0)) (and .cse0 .cse1 (<= 2 ~waterLevel~0) (and .cse2 (not (= 0 ~systemActive~0))))) (and (= ~methAndRunningLastTime~0 0) (and .cse0 .cse1 (and .cse2 (= ~pumpRunning~0 0))) (<= 1 ~waterLevel~0)))) [2019-01-12 14:52:17,576 INFO L448 ceAbstractionStarter]: For program point L352-2(lines 352 369) no Hoare annotation was computed. [2019-01-12 14:52:17,576 INFO L444 ceAbstractionStarter]: At program point L352-3(lines 1 986) the Hoare annotation is: false [2019-01-12 14:52:17,576 INFO L448 ceAbstractionStarter]: For program point L352-4(lines 352 369) no Hoare annotation was computed. [2019-01-12 14:52:17,576 INFO L448 ceAbstractionStarter]: For program point L187(lines 187 204) no Hoare annotation was computed. [2019-01-12 14:52:17,576 INFO L444 ceAbstractionStarter]: At program point L352-5(lines 1 986) the Hoare annotation is: false [2019-01-12 14:52:17,576 INFO L448 ceAbstractionStarter]: For program point L187-1(lines 187 204) no Hoare annotation was computed. [2019-01-12 14:52:17,576 INFO L448 ceAbstractionStarter]: For program point L187-2(lines 187 204) no Hoare annotation was computed. [2019-01-12 14:52:17,577 INFO L448 ceAbstractionStarter]: For program point L617(line 617) no Hoare annotation was computed. [2019-01-12 14:52:17,577 INFO L448 ceAbstractionStarter]: For program point L617-1(line 617) no Hoare annotation was computed. [2019-01-12 14:52:17,577 INFO L448 ceAbstractionStarter]: For program point L617-2(line 617) no Hoare annotation was computed. [2019-01-12 14:52:17,577 INFO L448 ceAbstractionStarter]: For program point L419(lines 419 423) no Hoare annotation was computed. [2019-01-12 14:52:17,577 INFO L448 ceAbstractionStarter]: For program point L419-3(lines 419 423) no Hoare annotation was computed. [2019-01-12 14:52:17,577 INFO L448 ceAbstractionStarter]: For program point L419-6(lines 419 423) no Hoare annotation was computed. [2019-01-12 14:52:17,577 INFO L448 ceAbstractionStarter]: For program point L56(lines 55 102) no Hoare annotation was computed. [2019-01-12 14:52:17,577 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 617) no Hoare annotation was computed. [2019-01-12 14:52:17,577 INFO L448 ceAbstractionStarter]: For program point L57(lines 57 61) no Hoare annotation was computed. [2019-01-12 14:52:17,577 INFO L448 ceAbstractionStarter]: For program point L322(lines 322 328) no Hoare annotation was computed. [2019-01-12 14:52:17,578 INFO L444 ceAbstractionStarter]: At program point L322-1(lines 322 328) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse3 (= ~pumpRunning~0 0))) (let ((.cse4 (<= 1 ~waterLevel~0)) (.cse0 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse1 (= ULTIMATE.start_main_~tmp~6 1)) (.cse5 (and .cse2 .cse3))) (or (and (and .cse0 .cse1 (and (= 0 ~methaneLevelCritical~0) .cse2 .cse3)) .cse4) (and .cse0 (= ~methAndRunningLastTime~0 0) .cse1 .cse5 .cse4) (and .cse0 (<= 2 ~waterLevel~0) .cse1 .cse5)))) [2019-01-12 14:52:17,578 INFO L448 ceAbstractionStarter]: For program point L289(lines 289 293) no Hoare annotation was computed. [2019-01-12 14:52:17,578 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 14:52:17,578 INFO L448 ceAbstractionStarter]: For program point L289-2(lines 289 293) no Hoare annotation was computed. [2019-01-12 14:52:17,578 INFO L448 ceAbstractionStarter]: For program point L289-3(lines 289 293) no Hoare annotation was computed. [2019-01-12 14:52:17,578 INFO L448 ceAbstractionStarter]: For program point L289-5(lines 289 293) no Hoare annotation was computed. [2019-01-12 14:52:17,578 INFO L448 ceAbstractionStarter]: For program point L91(lines 91 97) no Hoare annotation was computed. [2019-01-12 14:52:17,578 INFO L448 ceAbstractionStarter]: For program point L289-6(lines 289 293) no Hoare annotation was computed. [2019-01-12 14:52:17,578 INFO L444 ceAbstractionStarter]: At program point L91-1(lines 129 135) the Hoare annotation is: (let ((.cse3 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse2 (= ULTIMATE.start_main_~tmp~6 1)) (.cse5 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse7 (= ~pumpRunning~0 0))) (let ((.cse0 (<= 1 ~waterLevel~0)) (.cse6 (= ~systemActive~0 0)) (.cse4 (<= 2 ~waterLevel~0)) (.cse1 (and .cse3 .cse2 (and .cse5 .cse7)))) (or (and (= ~methAndRunningLastTime~0 0) .cse0 .cse1) (and (and .cse2 (and .cse3 .cse4 (and .cse5 (not (= 0 ~systemActive~0))))) (not (= 0 ~pumpRunning~0))) (and .cse6 (and (and .cse3 .cse2 (and (= 0 ~methaneLevelCritical~0) .cse5 .cse7)) .cse0)) (and .cse6 (and .cse4 .cse1))))) [2019-01-12 14:52:17,579 INFO L448 ceAbstractionStarter]: For program point L289-8(lines 289 293) no Hoare annotation was computed. [2019-01-12 14:52:17,579 INFO L448 ceAbstractionStarter]: For program point L289-9(lines 289 293) no Hoare annotation was computed. [2019-01-12 14:52:17,579 INFO L448 ceAbstractionStarter]: For program point L289-11(lines 289 293) no Hoare annotation was computed. [2019-01-12 14:52:17,579 INFO L448 ceAbstractionStarter]: For program point L289-12(lines 289 293) no Hoare annotation was computed. [2019-01-12 14:52:17,579 INFO L448 ceAbstractionStarter]: For program point L289-14(lines 289 293) no Hoare annotation was computed. [2019-01-12 14:52:17,579 INFO L448 ceAbstractionStarter]: For program point L289-15(lines 289 293) no Hoare annotation was computed. [2019-01-12 14:52:17,579 INFO L448 ceAbstractionStarter]: For program point L289-17(lines 289 293) no Hoare annotation was computed. [2019-01-12 14:52:17,579 INFO L448 ceAbstractionStarter]: For program point L356(lines 356 366) no Hoare annotation was computed. [2019-01-12 14:52:17,579 INFO L448 ceAbstractionStarter]: For program point L356-2(lines 356 366) no Hoare annotation was computed. [2019-01-12 14:52:17,579 INFO L448 ceAbstractionStarter]: For program point L356-4(lines 356 366) no Hoare annotation was computed. [2019-01-12 14:52:17,579 INFO L448 ceAbstractionStarter]: For program point L191(lines 191 199) no Hoare annotation was computed. [2019-01-12 14:52:17,580 INFO L448 ceAbstractionStarter]: For program point L191-1(lines 191 199) no Hoare annotation was computed. [2019-01-12 14:52:17,580 INFO L448 ceAbstractionStarter]: For program point L191-2(lines 191 199) no Hoare annotation was computed. [2019-01-12 14:52:17,580 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 617) no Hoare annotation was computed. [2019-01-12 14:52:17,580 INFO L444 ceAbstractionStarter]: At program point L456(lines 451 459) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_test_~splverifierCounter~0 0))) (let ((.cse4 (<= 2 ~waterLevel~0)) (.cse0 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse1 (= ULTIMATE.start_main_~tmp~6 1)) (.cse3 (and .cse2 (not (= 0 ~systemActive~0))))) (or (and (and .cse0 .cse1 (and .cse2 (= ~pumpRunning~0 0))) (<= 1 ~waterLevel~0)) (and .cse0 .cse1 (and .cse3 (= ~methAndRunningLastTime~0 0) .cse4)) (and .cse4 (and .cse0 .cse1 (and .cse3 (= 0 ~methaneLevelCritical~0) (= 0 |ULTIMATE.start_isMethaneLevelCritical_#res|))))))) [2019-01-12 14:52:17,580 INFO L444 ceAbstractionStarter]: At program point L456-1(lines 451 459) the Hoare annotation is: false [2019-01-12 14:52:17,580 INFO L444 ceAbstractionStarter]: At program point L456-2(lines 451 459) the Hoare annotation is: false [2019-01-12 14:52:17,580 INFO L448 ceAbstractionStarter]: For program point L357(lines 357 363) no Hoare annotation was computed. [2019-01-12 14:52:17,580 INFO L448 ceAbstractionStarter]: For program point L357-2(lines 357 363) no Hoare annotation was computed. [2019-01-12 14:52:17,580 INFO L448 ceAbstractionStarter]: For program point L357-4(lines 357 363) no Hoare annotation was computed. [2019-01-12 14:52:17,581 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 14:52:17,581 INFO L448 ceAbstractionStarter]: For program point L161(lines 161 178) no Hoare annotation was computed. [2019-01-12 14:52:17,581 INFO L448 ceAbstractionStarter]: For program point L161-1(lines 161 178) no Hoare annotation was computed. [2019-01-12 14:52:17,581 INFO L448 ceAbstractionStarter]: For program point L161-2(lines 161 178) no Hoare annotation was computed. [2019-01-12 14:52:17,581 INFO L448 ceAbstractionStarter]: For program point L161-3(lines 161 178) no Hoare annotation was computed. [2019-01-12 14:52:17,581 INFO L448 ceAbstractionStarter]: For program point L161-4(lines 161 178) no Hoare annotation was computed. [2019-01-12 14:52:17,581 INFO L448 ceAbstractionStarter]: For program point L161-5(lines 161 178) no Hoare annotation was computed. [2019-01-12 14:52:17,581 INFO L444 ceAbstractionStarter]: At program point L129(lines 128 147) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse3 (= ULTIMATE.start_main_~tmp~6 1)) (.cse4 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse5 (= ~pumpRunning~0 0))) (let ((.cse1 (and .cse2 .cse3 (and .cse4 .cse5))) (.cse0 (<= 1 ~waterLevel~0))) (or (and (= ~methAndRunningLastTime~0 0) .cse0 .cse1) (and (and .cse2 .cse3 (and (= 0 ~methaneLevelCritical~0) .cse4 .cse5)) .cse0) (and (= ~systemActive~0 0) (and (<= 2 ~waterLevel~0) .cse1)) (and (not (= 0 ~pumpRunning~0)) .cse3 (and .cse2 .cse0 (and .cse4 (not (= 0 ~systemActive~0)))))))) [2019-01-12 14:52:17,581 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 129 135) no Hoare annotation was computed. [2019-01-12 14:52:17,582 INFO L444 ceAbstractionStarter]: At program point L129-2(lines 128 147) the Hoare annotation is: false [2019-01-12 14:52:17,582 INFO L444 ceAbstractionStarter]: At program point L129-3(lines 128 147) the Hoare annotation is: false [2019-01-12 14:52:17,582 INFO L444 ceAbstractionStarter]: At program point L295(lines 280 298) the Hoare annotation is: false [2019-01-12 14:52:17,582 INFO L444 ceAbstractionStarter]: At program point L295-1(lines 280 298) the Hoare annotation is: (let ((.cse4 (and (= ULTIMATE.start_test_~splverifierCounter~0 0) (not (= 0 ~systemActive~0))))) (let ((.cse1 (<= 2 ~waterLevel~0)) (.cse0 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse3 (= ULTIMATE.start_main_~tmp~6 1)) (.cse2 (and .cse4 (= ~pumpRunning~0 0)))) (or (and (and .cse0 (= ~methAndRunningLastTime~0 0) .cse1 .cse2) .cse3) (and (and .cse1 (and .cse0 (and (and .cse4 (= 0 ~methaneLevelCritical~0)) (= 0 ~pumpRunning~0)))) .cse3) (and (and (= 0 |ULTIMATE.start_isHighWaterLevel_#res|) .cse0 .cse3 (= 0 ULTIMATE.start_isHighWaterLevel_~tmp___0~1) (not (= 0 ULTIMATE.start_isHighWaterLevel_~tmp~3)) .cse2) (<= 1 ~waterLevel~0))))) [2019-01-12 14:52:17,582 INFO L444 ceAbstractionStarter]: At program point L295-2(lines 280 298) the Hoare annotation is: false [2019-01-12 14:52:17,582 INFO L444 ceAbstractionStarter]: At program point L295-3(lines 280 298) the Hoare annotation is: false [2019-01-12 14:52:17,582 INFO L444 ceAbstractionStarter]: At program point L295-4(lines 280 298) the Hoare annotation is: false [2019-01-12 14:52:17,582 INFO L444 ceAbstractionStarter]: At program point L295-5(lines 280 298) the Hoare annotation is: false [2019-01-12 14:52:17,582 INFO L444 ceAbstractionStarter]: At program point L527-2(lines 527 541) the Hoare annotation is: false [2019-01-12 14:52:17,583 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 71) no Hoare annotation was computed. [2019-01-12 14:52:17,583 INFO L444 ceAbstractionStarter]: At program point L65-1(lines 65 71) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse1 (= ULTIMATE.start_main_~tmp~6 1)) (.cse2 (= ULTIMATE.start_test_~splverifierCounter~0 0))) (or (and (not (= 0 ~pumpRunning~0)) (and .cse0 .cse1 (<= 2 ~waterLevel~0) (and .cse2 (not (= 0 ~systemActive~0))))) (and (= ~methAndRunningLastTime~0 0) (and .cse0 .cse1 (and .cse2 (= ~pumpRunning~0 0))) (<= 1 ~waterLevel~0)))) [2019-01-12 14:52:17,583 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 14:52:17,583 INFO L448 ceAbstractionStarter]: For program point L528(line 528) no Hoare annotation was computed. [2019-01-12 14:52:17,583 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 173) no Hoare annotation was computed. [2019-01-12 14:52:17,583 INFO L448 ceAbstractionStarter]: For program point L165-1(lines 165 173) no Hoare annotation was computed. [2019-01-12 14:52:17,583 INFO L448 ceAbstractionStarter]: For program point L165-2(lines 165 173) no Hoare annotation was computed. [2019-01-12 14:52:17,583 INFO L448 ceAbstractionStarter]: For program point L165-3(lines 165 173) no Hoare annotation was computed. [2019-01-12 14:52:17,583 INFO L448 ceAbstractionStarter]: For program point L165-4(lines 165 173) no Hoare annotation was computed. [2019-01-12 14:52:17,583 INFO L448 ceAbstractionStarter]: For program point L165-5(lines 165 173) no Hoare annotation was computed. [2019-01-12 14:52:17,584 INFO L448 ceAbstractionStarter]: For program point L496(lines 496 502) no Hoare annotation was computed. [2019-01-12 14:52:17,584 INFO L448 ceAbstractionStarter]: For program point L496-1(lines 496 502) no Hoare annotation was computed. [2019-01-12 14:52:17,584 INFO L448 ceAbstractionStarter]: For program point L496-2(lines 496 502) no Hoare annotation was computed. [2019-01-12 14:52:17,584 INFO L448 ceAbstractionStarter]: For program point L496-3(lines 496 502) no Hoare annotation was computed. [2019-01-12 14:52:17,584 INFO L448 ceAbstractionStarter]: For program point L496-4(lines 496 502) no Hoare annotation was computed. [2019-01-12 14:52:17,584 INFO L448 ceAbstractionStarter]: For program point L496-5(lines 496 502) no Hoare annotation was computed. [2019-01-12 14:52:17,584 INFO L448 ceAbstractionStarter]: For program point L431(lines 431 435) no Hoare annotation was computed. [2019-01-12 14:52:17,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 02:52:17 BoogieIcfgContainer [2019-01-12 14:52:17,616 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 14:52:17,616 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 14:52:17,616 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 14:52:17,616 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 14:52:17,617 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:51:55" (3/4) ... [2019-01-12 14:52:17,621 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 14:52:17,642 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 38 nodes and edges [2019-01-12 14:52:17,643 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2019-01-12 14:52:17,644 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-01-12 14:52:17,645 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 14:52:17,647 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 14:52:17,648 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-12 14:52:17,687 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((1 == systemActive && methAndRunningLastTime == 0) && 0 == methaneLevelCritical) && waterLevel == 1) && \result == systemActive) && pumpRunning == 0 [2019-01-12 14:52:17,687 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((methAndRunningLastTime == 0 && 0 == methaneLevelCritical) && tmp == 1) && waterLevel == 1) && \result == systemActive) && pumpRunning == 0) && tmp == systemActive [2019-01-12 14:52:17,688 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((methAndRunningLastTime == 0 && 0 == methaneLevelCritical) && tmp == 1) && waterLevel == 1) && \result == systemActive) && pumpRunning == 0) && tmp == systemActive [2019-01-12 14:52:17,688 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(0 == pumpRunning) && ((\result == 1 && tmp == 1) && 2 <= waterLevel) && splverifierCounter == 0 && !(0 == systemActive)) || ((methAndRunningLastTime == 0 && (\result == 1 && tmp == 1) && splverifierCounter == 0 && pumpRunning == 0) && 1 <= waterLevel) [2019-01-12 14:52:17,688 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(0 == pumpRunning) && ((\result == 1 && tmp == 1) && 2 <= waterLevel) && splverifierCounter == 0 && !(0 == systemActive)) || ((methAndRunningLastTime == 0 && (\result == 1 && tmp == 1) && splverifierCounter == 0 && pumpRunning == 0) && 1 <= waterLevel) [2019-01-12 14:52:17,689 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((methAndRunningLastTime == 0 && (\result == 1 && tmp == 1) && splverifierCounter == 0 && pumpRunning == 0) && 1 <= waterLevel) || ((tmp == 1 && (\result == 1 && 2 <= waterLevel) && splverifierCounter == 0 && !(0 == systemActive)) && !(0 == pumpRunning)) [2019-01-12 14:52:17,689 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((methAndRunningLastTime == 0 && 1 <= waterLevel) && (\result == 1 && tmp == 1) && splverifierCounter == 0 && pumpRunning == 0) || ((tmp == 1 && (\result == 1 && 2 <= waterLevel) && splverifierCounter == 0 && !(0 == systemActive)) && !(0 == pumpRunning))) || (systemActive == 0 && ((\result == 1 && tmp == 1) && (0 == methaneLevelCritical && splverifierCounter == 0) && pumpRunning == 0) && 1 <= waterLevel)) || (systemActive == 0 && 2 <= waterLevel && (\result == 1 && tmp == 1) && splverifierCounter == 0 && pumpRunning == 0) [2019-01-12 14:52:17,689 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((methAndRunningLastTime == 0 && 1 <= waterLevel) && (\result == 1 && tmp == 1) && splverifierCounter == 0 && pumpRunning == 0) || (((\result == 1 && tmp == 1) && (0 == methaneLevelCritical && splverifierCounter == 0) && pumpRunning == 0) && 1 <= waterLevel)) || (systemActive == 0 && 2 <= waterLevel && (\result == 1 && tmp == 1) && splverifierCounter == 0 && pumpRunning == 0)) || ((!(0 == pumpRunning) && tmp == 1) && (\result == 1 && 1 <= waterLevel) && splverifierCounter == 0 && !(0 == systemActive)) [2019-01-12 14:52:17,690 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\result == 1 && methAndRunningLastTime == 0) && 2 <= waterLevel) && splverifierCounter == 0 && !(0 == systemActive)) && tmp == 1) || (tmp == 1 && 2 <= waterLevel && \result == 1 && (splverifierCounter == 0 && !(0 == systemActive)) && 0 == methaneLevelCritical)) || (((\result == 1 && tmp == 1) && splverifierCounter == 0 && pumpRunning == 0) && 1 <= waterLevel) [2019-01-12 14:52:17,690 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\result == 1 && tmp == 1) && (0 == methaneLevelCritical && splverifierCounter == 0) && pumpRunning == 0) && 1 <= waterLevel) || ((((\result == 1 && methAndRunningLastTime == 0) && tmp == 1) && splverifierCounter == 0 && pumpRunning == 0) && 1 <= waterLevel)) || (((\result == 1 && 2 <= waterLevel) && tmp == 1) && splverifierCounter == 0 && pumpRunning == 0) [2019-01-12 14:52:17,691 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\result == 1 && tmp == 1) && splverifierCounter == 0 && pumpRunning == 0) && 1 <= waterLevel) || ((\result == 1 && tmp == 1) && ((splverifierCounter == 0 && !(0 == systemActive)) && methAndRunningLastTime == 0) && 2 <= waterLevel)) || (2 <= waterLevel && (\result == 1 && tmp == 1) && ((splverifierCounter == 0 && !(0 == systemActive)) && 0 == methaneLevelCritical) && 0 == \result) [2019-01-12 14:52:17,692 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\result == 1 && !(0 == pumpRunning)) && tmp == 1) && 0 == \result) && splverifierCounter == 0) && 1 <= waterLevel) && !(0 == systemActive) [2019-01-12 14:52:17,692 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((2 <= waterLevel && \result == 1 && ((splverifierCounter == 0 && !(0 == systemActive)) && 0 == methaneLevelCritical) && 0 == pumpRunning) && tmp == 1) || (tmp == 1 && ((\result == 1 && !(0 == \result)) && (splverifierCounter == 0 && !(0 == systemActive)) && pumpRunning == 0) && 1 <= waterLevel)) || ((((\result == 1 && methAndRunningLastTime == 0) && 2 <= waterLevel) && (splverifierCounter == 0 && !(0 == systemActive)) && pumpRunning == 0) && tmp == 1) [2019-01-12 14:52:17,693 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\result == 1 && 0 == \result) && tmp == 1) && splverifierCounter == 0) && pumpRunning == 0) && 1 <= waterLevel) || (!(0 == pumpRunning) && (((\result == 1 && splverifierCounter == 0 && !(0 == systemActive)) && methAndRunningLastTime == 0) && tmp == 1) && 2 <= waterLevel) [2019-01-12 14:52:17,693 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((\result == 1 && !(0 == \result)) && !(0 == pumpRunning)) && tmp == 1) && 0 == \result) && splverifierCounter == 0) && !(0 == tmp___0)) && 1 <= waterLevel) && 0 == tmp) && !(0 == systemActive) [2019-01-12 14:52:17,694 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\result == 1 && methAndRunningLastTime == 0) && 2 <= waterLevel) && (splverifierCounter == 0 && !(0 == systemActive)) && pumpRunning == 0) && tmp == 1) || ((2 <= waterLevel && \result == 1 && ((splverifierCounter == 0 && !(0 == systemActive)) && 0 == methaneLevelCritical) && 0 == pumpRunning) && tmp == 1)) || ((((((0 == \result && \result == 1) && tmp == 1) && 0 == tmp___0) && !(0 == tmp)) && (splverifierCounter == 0 && !(0 == systemActive)) && pumpRunning == 0) && 1 <= waterLevel) [2019-01-12 14:52:17,781 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 14:52:17,781 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 14:52:17,782 INFO L168 Benchmark]: Toolchain (without parser) took 24793.86 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 469.8 MB). Free memory was 950.0 MB in the beginning and 1.2 GB in the end (delta: -263.6 MB). Peak memory consumption was 206.2 MB. Max. memory is 11.5 GB. [2019-01-12 14:52:17,783 INFO L168 Benchmark]: CDTParser took 0.15 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. [2019-01-12 14:52:17,783 INFO L168 Benchmark]: CACSL2BoogieTranslator took 679.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -170.6 MB). Peak memory consumption was 36.8 MB. Max. memory is 11.5 GB. [2019-01-12 14:52:17,783 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.46 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. [2019-01-12 14:52:17,783 INFO L168 Benchmark]: Boogie Preprocessor took 46.12 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. [2019-01-12 14:52:17,784 INFO L168 Benchmark]: RCFGBuilder took 1309.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 65.9 MB). Peak memory consumption was 65.9 MB. Max. memory is 11.5 GB. [2019-01-12 14:52:17,784 INFO L168 Benchmark]: TraceAbstraction took 22510.02 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 335.0 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -178.9 MB). Peak memory consumption was 496.3 MB. Max. memory is 11.5 GB. [2019-01-12 14:52:17,784 INFO L168 Benchmark]: Witness Printer took 164.94 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2019-01-12 14:52:17,787 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.15 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 679.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -170.6 MB). Peak memory consumption was 36.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 78.46 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 46.12 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 1309.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 65.9 MB). Peak memory consumption was 65.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22510.02 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 335.0 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -178.9 MB). Peak memory consumption was 496.3 MB. Max. memory is 11.5 GB. * Witness Printer took 164.94 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 617]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 617]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 617]: 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: 299]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: ((((methAndRunningLastTime == 0 && 1 <= waterLevel) && (\result == 1 && tmp == 1) && splverifierCounter == 0 && pumpRunning == 0) || ((tmp == 1 && (\result == 1 && 2 <= waterLevel) && splverifierCounter == 0 && !(0 == systemActive)) && !(0 == pumpRunning))) || (systemActive == 0 && ((\result == 1 && tmp == 1) && (0 == methaneLevelCritical && splverifierCounter == 0) && pumpRunning == 0) && 1 <= waterLevel)) || (systemActive == 0 && 2 <= waterLevel && (\result == 1 && tmp == 1) && splverifierCounter == 0 && pumpRunning == 0) - InvariantResult [Line: 299]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 402]: Loop Invariant Derived loop invariant: ((((1 == systemActive && methAndRunningLastTime == 0) && 0 == methaneLevelCritical) && waterLevel == 1) && \result == systemActive) && pumpRunning == 0 - InvariantResult [Line: 599]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 589]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 336]: Loop Invariant Derived loop invariant: (((((methAndRunningLastTime == 0 && 0 == methaneLevelCritical) && tmp == 1) && waterLevel == 1) && \result == systemActive) && pumpRunning == 0) && tmp == systemActive - InvariantResult [Line: 571]: Loop Invariant Derived loop invariant: (((((methAndRunningLastTime == 0 && 0 == methaneLevelCritical) && tmp == 1) && waterLevel == 1) && \result == systemActive) && pumpRunning == 0) && tmp == systemActive - InvariantResult [Line: 506]: Loop Invariant Derived loop invariant: (((((\result == 1 && !(0 == pumpRunning)) && tmp == 1) && 0 == \result) && splverifierCounter == 0) && 1 <= waterLevel) && !(0 == systemActive) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (!(0 == pumpRunning) && ((\result == 1 && tmp == 1) && 2 <= waterLevel) && splverifierCounter == 0 && !(0 == systemActive)) || ((methAndRunningLastTime == 0 && (\result == 1 && tmp == 1) && splverifierCounter == 0 && pumpRunning == 0) && 1 <= waterLevel) - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 492]: Loop Invariant Derived loop invariant: (((2 <= waterLevel && \result == 1 && ((splverifierCounter == 0 && !(0 == systemActive)) && 0 == methaneLevelCritical) && 0 == pumpRunning) && tmp == 1) || (tmp == 1 && ((\result == 1 && !(0 == \result)) && (splverifierCounter == 0 && !(0 == systemActive)) && pumpRunning == 0) && 1 <= waterLevel)) || ((((\result == 1 && methAndRunningLastTime == 0) && 2 <= waterLevel) && (splverifierCounter == 0 && !(0 == systemActive)) && pumpRunning == 0) && tmp == 1) - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: (!(0 == pumpRunning) && ((\result == 1 && tmp == 1) && 2 <= waterLevel) && splverifierCounter == 0 && !(0 == systemActive)) || ((methAndRunningLastTime == 0 && (\result == 1 && tmp == 1) && splverifierCounter == 0 && pumpRunning == 0) && 1 <= waterLevel) - InvariantResult [Line: 492]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 492]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: ((((methAndRunningLastTime == 0 && 1 <= waterLevel) && (\result == 1 && tmp == 1) && splverifierCounter == 0 && pumpRunning == 0) || (((\result == 1 && tmp == 1) && (0 == methaneLevelCritical && splverifierCounter == 0) && pumpRunning == 0) && 1 <= waterLevel)) || (systemActive == 0 && 2 <= waterLevel && (\result == 1 && tmp == 1) && splverifierCounter == 0 && pumpRunning == 0)) || ((!(0 == pumpRunning) && tmp == 1) && (\result == 1 && 1 <= waterLevel) && splverifierCounter == 0 && !(0 == systemActive)) - InvariantResult [Line: 492]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 492]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 299]: Loop Invariant Derived loop invariant: ((((((((\result == 1 && !(0 == \result)) && !(0 == pumpRunning)) && tmp == 1) && 0 == \result) && splverifierCounter == 0) && !(0 == tmp___0)) && 1 <= waterLevel) && 0 == tmp) && !(0 == systemActive) - InvariantResult [Line: 235]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 280]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 235]: Loop Invariant Derived loop invariant: (((((\result == 1 && 0 == \result) && tmp == 1) && splverifierCounter == 0) && pumpRunning == 0) && 1 <= waterLevel) || (!(0 == pumpRunning) && (((\result == 1 && splverifierCounter == 0 && !(0 == systemActive)) && methAndRunningLastTime == 0) && tmp == 1) && 2 <= waterLevel) - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 280]: Loop Invariant Derived loop invariant: (((((\result == 1 && methAndRunningLastTime == 0) && 2 <= waterLevel) && (splverifierCounter == 0 && !(0 == systemActive)) && pumpRunning == 0) && tmp == 1) || ((2 <= waterLevel && \result == 1 && ((splverifierCounter == 0 && !(0 == systemActive)) && 0 == methaneLevelCritical) && 0 == pumpRunning) && tmp == 1)) || ((((((0 == \result && \result == 1) && tmp == 1) && 0 == tmp___0) && !(0 == tmp)) && (splverifierCounter == 0 && !(0 == systemActive)) && pumpRunning == 0) && 1 <= waterLevel) - InvariantResult [Line: 527]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 280]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 322]: Loop Invariant Derived loop invariant: ((((\result == 1 && tmp == 1) && (0 == methaneLevelCritical && splverifierCounter == 0) && pumpRunning == 0) && 1 <= waterLevel) || ((((\result == 1 && methAndRunningLastTime == 0) && tmp == 1) && splverifierCounter == 0 && pumpRunning == 0) && 1 <= waterLevel)) || (((\result == 1 && 2 <= waterLevel) && tmp == 1) && splverifierCounter == 0 && pumpRunning == 0) - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: (((((\result == 1 && methAndRunningLastTime == 0) && 2 <= waterLevel) && splverifierCounter == 0 && !(0 == systemActive)) && tmp == 1) || (tmp == 1 && 2 <= waterLevel && \result == 1 && (splverifierCounter == 0 && !(0 == systemActive)) && 0 == methaneLevelCritical)) || (((\result == 1 && tmp == 1) && splverifierCounter == 0 && pumpRunning == 0) && 1 <= waterLevel) - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 492]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: ((methAndRunningLastTime == 0 && (\result == 1 && tmp == 1) && splverifierCounter == 0 && pumpRunning == 0) && 1 <= waterLevel) || ((tmp == 1 && (\result == 1 && 2 <= waterLevel) && splverifierCounter == 0 && !(0 == systemActive)) && !(0 == pumpRunning)) - InvariantResult [Line: 506]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 451]: Loop Invariant Derived loop invariant: ((((\result == 1 && tmp == 1) && splverifierCounter == 0 && pumpRunning == 0) && 1 <= waterLevel) || ((\result == 1 && tmp == 1) && ((splverifierCounter == 0 && !(0 == systemActive)) && methAndRunningLastTime == 0) && 2 <= waterLevel)) || (2 <= waterLevel && (\result == 1 && tmp == 1) && ((splverifierCounter == 0 && !(0 == systemActive)) && 0 == methaneLevelCritical) && 0 == \result) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 506]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 451]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 280]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 451]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 280]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 235]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((1 == systemActive && methAndRunningLastTime == 0) && 0 == methaneLevelCritical) && waterLevel == 1) && pumpRunning == 0 - InvariantResult [Line: 280]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 123 locations, 3 error locations. SAFE Result, 22.4s OverallTime, 14 OverallIterations, 2 TraceHistogramMax, 5.4s AutomataDifference, 0.0s DeadEndRemovalTime, 13.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 1407 SDtfs, 2159 SDslu, 2418 SDs, 0 SdLazy, 280 SolverSat, 63 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 103 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=659occurred in iteration=11, 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.5s AutomataMinimizationTime, 14 MinimizatonAttempts, 2170 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 45 LocationsWithAnnotation, 45 PreInvPairs, 188 NumberOfFragments, 896 HoareAnnotationTreeSize, 45 FomulaSimplifications, 725194 FormulaSimplificationTreeSizeReduction, 2.3s HoareSimplificationTime, 45 FomulaSimplificationsInter, 1110556 FormulaSimplificationTreeSizeReductionInter, 11.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 510 NumberOfCodeBlocks, 510 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 496 ConstructedInterpolants, 0 QuantifiedInterpolants, 35356 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 82/82 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...