./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec4_product51_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/product-lines/minepump_spec4_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 82fb1dfaeb04705f6833d1531288fda63f898d4b ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 09:49:42,825 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 09:49:42,827 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 09:49:42,844 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 09:49:42,844 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 09:49:42,846 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 09:49:42,848 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 09:49:42,850 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 09:49:42,852 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 09:49:42,854 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 09:49:42,855 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 09:49:42,856 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 09:49:42,859 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 09:49:42,860 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 09:49:42,863 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 09:49:42,864 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 09:49:42,865 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 09:49:42,875 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 09:49:42,879 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 09:49:42,882 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 09:49:42,884 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 09:49:42,888 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 09:49:42,890 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 09:49:42,890 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 09:49:42,890 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 09:49:42,892 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 09:49:42,893 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 09:49:42,895 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 09:49:42,896 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 09:49:42,897 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 09:49:42,898 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 09:49:42,898 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 09:49:42,898 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 09:49:42,898 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 09:49:42,901 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 09:49:42,902 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 09:49:42,902 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 09:49:42,927 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 09:49:42,928 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 09:49:42,934 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 09:49:42,934 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 09:49:42,934 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 09:49:42,935 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 09:49:42,935 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 09:49:42,936 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 09:49:42,936 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 09:49:42,936 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 09:49:42,937 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 09:49:42,937 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 09:49:42,937 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 09:49:42,937 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 09:49:42,937 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 09:49:42,937 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 09:49:42,938 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 09:49:42,938 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 09:49:42,938 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 09:49:42,938 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 09:49:42,938 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 09:49:42,939 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 09:49:42,939 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 09:49:42,939 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 09:49:42,939 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 09:49:42,939 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 09:49:42,939 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 09:49:42,940 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 09:49:42,940 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 -> 82fb1dfaeb04705f6833d1531288fda63f898d4b [2018-12-31 09:49:42,983 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 09:49:42,995 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 09:49:42,999 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 09:49:43,001 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 09:49:43,001 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 09:49:43,002 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec4_product51_true-unreach-call_false-termination.cil.c [2018-12-31 09:49:43,057 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a6f692eb/c4928f0a11a04a6090c17ccfbce96966/FLAG3f1bff352 [2018-12-31 09:49:43,551 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 09:49:43,555 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec4_product51_true-unreach-call_false-termination.cil.c [2018-12-31 09:49:43,583 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a6f692eb/c4928f0a11a04a6090c17ccfbce96966/FLAG3f1bff352 [2018-12-31 09:49:43,852 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a6f692eb/c4928f0a11a04a6090c17ccfbce96966 [2018-12-31 09:49:43,856 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 09:49:43,857 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 09:49:43,858 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 09:49:43,861 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 09:49:43,865 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 09:49:43,866 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:49:43" (1/1) ... [2018-12-31 09:49:43,869 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22099427 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:49:43, skipping insertion in model container [2018-12-31 09:49:43,870 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:49:43" (1/1) ... [2018-12-31 09:49:43,878 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 09:49:43,938 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 09:49:44,359 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:49:44,375 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 09:49:44,481 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:49:44,607 INFO L195 MainTranslator]: Completed translation [2018-12-31 09:49:44,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:49:44 WrapperNode [2018-12-31 09:49:44,608 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 09:49:44,609 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 09:49:44,610 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 09:49:44,610 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 09:49:44,619 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:49:44" (1/1) ... [2018-12-31 09:49:44,653 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:49:44" (1/1) ... [2018-12-31 09:49:44,711 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 09:49:44,711 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 09:49:44,711 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 09:49:44,711 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 09:49:44,724 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:49:44" (1/1) ... [2018-12-31 09:49:44,724 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:49:44" (1/1) ... [2018-12-31 09:49:44,729 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:49:44" (1/1) ... [2018-12-31 09:49:44,729 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:49:44" (1/1) ... [2018-12-31 09:49:44,742 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:49:44" (1/1) ... [2018-12-31 09:49:44,753 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:49:44" (1/1) ... [2018-12-31 09:49:44,756 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:49:44" (1/1) ... [2018-12-31 09:49:44,766 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 09:49:44,766 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 09:49:44,767 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 09:49:44,767 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 09:49:44,769 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:49:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 09:49:44,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 09:49:44,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-31 09:49:44,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 09:49:44,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 09:49:46,745 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 09:49:46,745 INFO L280 CfgBuilder]: Removed 160 assue(true) statements. [2018-12-31 09:49:46,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:49:46 BoogieIcfgContainer [2018-12-31 09:49:46,747 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 09:49:46,748 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 09:49:46,748 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 09:49:46,752 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 09:49:46,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 09:49:43" (1/3) ... [2018-12-31 09:49:46,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51e7d366 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:49:46, skipping insertion in model container [2018-12-31 09:49:46,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:49:44" (2/3) ... [2018-12-31 09:49:46,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51e7d366 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:49:46, skipping insertion in model container [2018-12-31 09:49:46,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:49:46" (3/3) ... [2018-12-31 09:49:46,757 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product51_true-unreach-call_false-termination.cil.c [2018-12-31 09:49:46,768 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 09:49:46,779 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 09:49:46,798 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 09:49:46,830 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 09:49:46,831 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 09:49:46,831 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 09:49:46,831 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 09:49:46,831 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 09:49:46,831 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 09:49:46,832 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 09:49:46,832 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 09:49:46,832 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 09:49:46,851 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states. [2018-12-31 09:49:46,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-31 09:49:46,859 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:49:46,860 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:49:46,862 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:49:46,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:49:46,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1844308238, now seen corresponding path program 1 times [2018-12-31 09:49:46,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:49:46,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:49:46,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:49:46,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:49:46,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:49:47,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:49:47,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:49:47,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:49:47,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:49:47,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 09:49:47,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 09:49:47,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 09:49:47,161 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 2 states. [2018-12-31 09:49:47,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:49:47,196 INFO L93 Difference]: Finished difference Result 232 states and 353 transitions. [2018-12-31 09:49:47,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 09:49:47,198 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-12-31 09:49:47,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:49:47,212 INFO L225 Difference]: With dead ends: 232 [2018-12-31 09:49:47,213 INFO L226 Difference]: Without dead ends: 115 [2018-12-31 09:49:47,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 09:49:47,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-31 09:49:47,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-12-31 09:49:47,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-31 09:49:47,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 168 transitions. [2018-12-31 09:49:47,269 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 168 transitions. Word has length 16 [2018-12-31 09:49:47,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:49:47,270 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 168 transitions. [2018-12-31 09:49:47,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 09:49:47,270 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 168 transitions. [2018-12-31 09:49:47,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-31 09:49:47,271 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:49:47,271 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:49:47,272 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:49:47,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:49:47,272 INFO L82 PathProgramCache]: Analyzing trace with hash -323074868, now seen corresponding path program 1 times [2018-12-31 09:49:47,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:49:47,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:49:47,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:49:47,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:49:47,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:49:47,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:49:47,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:49:47,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:49:47,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 09:49:47,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:49:47,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:49:47,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:49:47,431 INFO L87 Difference]: Start difference. First operand 115 states and 168 transitions. Second operand 3 states. [2018-12-31 09:49:47,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:49:47,458 INFO L93 Difference]: Finished difference Result 115 states and 168 transitions. [2018-12-31 09:49:47,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:49:47,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-31 09:49:47,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:49:47,462 INFO L225 Difference]: With dead ends: 115 [2018-12-31 09:49:47,462 INFO L226 Difference]: Without dead ends: 49 [2018-12-31 09:49:47,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:49:47,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-31 09:49:47,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-31 09:49:47,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-31 09:49:47,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 71 transitions. [2018-12-31 09:49:47,471 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 71 transitions. Word has length 17 [2018-12-31 09:49:47,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:49:47,472 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 71 transitions. [2018-12-31 09:49:47,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:49:47,472 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 71 transitions. [2018-12-31 09:49:47,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-31 09:49:47,473 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:49:47,473 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] [2018-12-31 09:49:47,474 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:49:47,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:49:47,474 INFO L82 PathProgramCache]: Analyzing trace with hash -426243093, now seen corresponding path program 1 times [2018-12-31 09:49:47,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:49:47,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:49:47,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:49:47,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:49:47,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:49:47,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:49:47,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:49:47,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:49:47,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:49:47,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 09:49:47,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 09:49:47,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 09:49:47,706 INFO L87 Difference]: Start difference. First operand 49 states and 71 transitions. Second operand 6 states. [2018-12-31 09:49:48,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:49:48,094 INFO L93 Difference]: Finished difference Result 158 states and 235 transitions. [2018-12-31 09:49:48,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 09:49:48,095 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-12-31 09:49:48,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:49:48,097 INFO L225 Difference]: With dead ends: 158 [2018-12-31 09:49:48,097 INFO L226 Difference]: Without dead ends: 115 [2018-12-31 09:49:48,098 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 [2018-12-31 09:49:48,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-31 09:49:48,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 68. [2018-12-31 09:49:48,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-31 09:49:48,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 100 transitions. [2018-12-31 09:49:48,115 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 100 transitions. Word has length 22 [2018-12-31 09:49:48,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:49:48,115 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 100 transitions. [2018-12-31 09:49:48,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 09:49:48,117 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 100 transitions. [2018-12-31 09:49:48,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-31 09:49:48,118 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:49:48,118 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:49:48,118 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:49:48,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:49:48,119 INFO L82 PathProgramCache]: Analyzing trace with hash 844046893, now seen corresponding path program 1 times [2018-12-31 09:49:48,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:49:48,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:49:48,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:49:48,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:49:48,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:49:48,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:49:48,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:49:48,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:49:48,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:49:48,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:49:48,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:49:48,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:49:48,273 INFO L87 Difference]: Start difference. First operand 68 states and 100 transitions. Second operand 3 states. [2018-12-31 09:49:48,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:49:48,512 INFO L93 Difference]: Finished difference Result 151 states and 224 transitions. [2018-12-31 09:49:48,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:49:48,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-31 09:49:48,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:49:48,514 INFO L225 Difference]: With dead ends: 151 [2018-12-31 09:49:48,514 INFO L226 Difference]: Without dead ends: 89 [2018-12-31 09:49:48,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:49:48,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-31 09:49:48,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2018-12-31 09:49:48,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-31 09:49:48,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 124 transitions. [2018-12-31 09:49:48,539 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 124 transitions. Word has length 24 [2018-12-31 09:49:48,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:49:48,539 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 124 transitions. [2018-12-31 09:49:48,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:49:48,540 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 124 transitions. [2018-12-31 09:49:48,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-31 09:49:48,542 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:49:48,542 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:49:48,542 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:49:48,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:49:48,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1604149312, now seen corresponding path program 1 times [2018-12-31 09:49:48,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:49:48,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:49:48,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:49:48,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:49:48,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:49:48,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:49:48,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:49:48,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:49:48,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:49:48,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:49:48,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:49:48,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:49:48,749 INFO L87 Difference]: Start difference. First operand 87 states and 124 transitions. Second operand 5 states. [2018-12-31 09:49:48,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:49:48,995 INFO L93 Difference]: Finished difference Result 307 states and 445 transitions. [2018-12-31 09:49:48,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 09:49:48,998 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-12-31 09:49:48,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:49:49,002 INFO L225 Difference]: With dead ends: 307 [2018-12-31 09:49:49,003 INFO L226 Difference]: Without dead ends: 226 [2018-12-31 09:49:49,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-31 09:49:49,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-12-31 09:49:49,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 146. [2018-12-31 09:49:49,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-12-31 09:49:49,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 203 transitions. [2018-12-31 09:49:49,053 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 203 transitions. Word has length 25 [2018-12-31 09:49:49,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:49:49,058 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 203 transitions. [2018-12-31 09:49:49,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:49:49,058 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 203 transitions. [2018-12-31 09:49:49,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-31 09:49:49,059 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:49:49,062 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] [2018-12-31 09:49:49,063 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:49:49,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:49:49,063 INFO L82 PathProgramCache]: Analyzing trace with hash 731508994, now seen corresponding path program 1 times [2018-12-31 09:49:49,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:49:49,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:49:49,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:49:49,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:49:49,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:49:49,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:49:49,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:49:49,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:49:49,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:49:49,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:49:49,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:49:49,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:49:49,207 INFO L87 Difference]: Start difference. First operand 146 states and 203 transitions. Second operand 5 states. [2018-12-31 09:49:50,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:49:50,259 INFO L93 Difference]: Finished difference Result 303 states and 430 transitions. [2018-12-31 09:49:50,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 09:49:50,259 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-12-31 09:49:50,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:49:50,262 INFO L225 Difference]: With dead ends: 303 [2018-12-31 09:49:50,262 INFO L226 Difference]: Without dead ends: 301 [2018-12-31 09:49:50,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 09:49:50,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-12-31 09:49:50,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 146. [2018-12-31 09:49:50,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-12-31 09:49:50,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 201 transitions. [2018-12-31 09:49:50,307 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 201 transitions. Word has length 26 [2018-12-31 09:49:50,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:49:50,309 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 201 transitions. [2018-12-31 09:49:50,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:49:50,309 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 201 transitions. [2018-12-31 09:49:50,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-31 09:49:50,314 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:49:50,314 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:49:50,314 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:49:50,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:49:50,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1548133156, now seen corresponding path program 1 times [2018-12-31 09:49:50,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:49:50,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:49:50,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:49:50,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:49:50,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:49:50,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:49:50,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:49:50,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:49:50,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:49:50,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:49:50,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:49:50,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:49:50,611 INFO L87 Difference]: Start difference. First operand 146 states and 201 transitions. Second operand 5 states. [2018-12-31 09:49:51,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:49:51,351 INFO L93 Difference]: Finished difference Result 442 states and 607 transitions. [2018-12-31 09:49:51,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 09:49:51,353 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-12-31 09:49:51,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:49:51,356 INFO L225 Difference]: With dead ends: 442 [2018-12-31 09:49:51,356 INFO L226 Difference]: Without dead ends: 302 [2018-12-31 09:49:51,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-31 09:49:51,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-12-31 09:49:51,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 155. [2018-12-31 09:49:51,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-12-31 09:49:51,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 210 transitions. [2018-12-31 09:49:51,388 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 210 transitions. Word has length 31 [2018-12-31 09:49:51,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:49:51,388 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 210 transitions. [2018-12-31 09:49:51,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:49:51,389 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 210 transitions. [2018-12-31 09:49:51,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-31 09:49:51,392 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:49:51,392 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:49:51,393 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:49:51,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:49:51,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1941160166, now seen corresponding path program 1 times [2018-12-31 09:49:51,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:49:51,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:49:51,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:49:51,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:49:51,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:49:51,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:49:51,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:49:51,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:49:51,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 09:49:51,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 09:49:51,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 09:49:51,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 09:49:51,540 INFO L87 Difference]: Start difference. First operand 155 states and 210 transitions. Second operand 6 states. [2018-12-31 09:49:51,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:49:51,782 INFO L93 Difference]: Finished difference Result 407 states and 552 transitions. [2018-12-31 09:49:51,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 09:49:51,784 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-12-31 09:49:51,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:49:51,786 INFO L225 Difference]: With dead ends: 407 [2018-12-31 09:49:51,786 INFO L226 Difference]: Without dead ends: 258 [2018-12-31 09:49:51,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-12-31 09:49:51,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-12-31 09:49:51,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 139. [2018-12-31 09:49:51,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-12-31 09:49:51,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 185 transitions. [2018-12-31 09:49:51,811 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 185 transitions. Word has length 31 [2018-12-31 09:49:51,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:49:51,811 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 185 transitions. [2018-12-31 09:49:51,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 09:49:51,811 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 185 transitions. [2018-12-31 09:49:51,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-31 09:49:51,814 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:49:51,814 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:49:51,814 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:49:51,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:49:51,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1682994728, now seen corresponding path program 1 times [2018-12-31 09:49:51,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:49:51,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:49:51,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:49:51,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:49:51,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:49:51,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:49:52,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:49:52,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:49:52,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:49:52,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:49:52,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:49:52,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:49:52,079 INFO L87 Difference]: Start difference. First operand 139 states and 185 transitions. Second operand 5 states. [2018-12-31 09:49:52,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:49:52,915 INFO L93 Difference]: Finished difference Result 362 states and 496 transitions. [2018-12-31 09:49:52,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 09:49:52,916 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-12-31 09:49:52,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:49:52,919 INFO L225 Difference]: With dead ends: 362 [2018-12-31 09:49:52,919 INFO L226 Difference]: Without dead ends: 271 [2018-12-31 09:49:52,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-31 09:49:52,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-12-31 09:49:52,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 199. [2018-12-31 09:49:52,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-12-31 09:49:52,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 263 transitions. [2018-12-31 09:49:52,956 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 263 transitions. Word has length 31 [2018-12-31 09:49:52,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:49:52,957 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 263 transitions. [2018-12-31 09:49:52,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:49:52,957 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 263 transitions. [2018-12-31 09:49:52,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-31 09:49:52,960 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:49:52,960 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:49:52,961 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:49:52,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:49:52,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1312943258, now seen corresponding path program 1 times [2018-12-31 09:49:52,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:49:52,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:49:52,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:49:52,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:49:52,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:49:53,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:49:53,290 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:49:53,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:49:53,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 09:49:53,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 09:49:53,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 09:49:53,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 09:49:53,291 INFO L87 Difference]: Start difference. First operand 199 states and 263 transitions. Second operand 6 states. [2018-12-31 09:49:54,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:49:54,046 INFO L93 Difference]: Finished difference Result 896 states and 1215 transitions. [2018-12-31 09:49:54,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 09:49:54,047 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2018-12-31 09:49:54,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:49:54,051 INFO L225 Difference]: With dead ends: 896 [2018-12-31 09:49:54,051 INFO L226 Difference]: Without dead ends: 745 [2018-12-31 09:49:54,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-12-31 09:49:54,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2018-12-31 09:49:54,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 310. [2018-12-31 09:49:54,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-12-31 09:49:54,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 420 transitions. [2018-12-31 09:49:54,110 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 420 transitions. Word has length 52 [2018-12-31 09:49:54,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:49:54,111 INFO L480 AbstractCegarLoop]: Abstraction has 310 states and 420 transitions. [2018-12-31 09:49:54,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 09:49:54,112 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 420 transitions. [2018-12-31 09:49:54,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-31 09:49:54,113 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:49:54,113 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:49:54,113 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:49:54,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:49:54,113 INFO L82 PathProgramCache]: Analyzing trace with hash -611878680, now seen corresponding path program 1 times [2018-12-31 09:49:54,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:49:54,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:49:54,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:49:54,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:49:54,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:49:54,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:49:54,256 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-31 09:49:54,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:49:54,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 09:49:54,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 09:49:54,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 09:49:54,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 09:49:54,257 INFO L87 Difference]: Start difference. First operand 310 states and 420 transitions. Second operand 7 states. [2018-12-31 09:49:54,693 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-12-31 09:49:54,899 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-31 09:49:54,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:49:54,986 INFO L93 Difference]: Finished difference Result 674 states and 917 transitions. [2018-12-31 09:49:54,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 09:49:54,987 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2018-12-31 09:49:54,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:49:54,987 INFO L225 Difference]: With dead ends: 674 [2018-12-31 09:49:54,987 INFO L226 Difference]: Without dead ends: 0 [2018-12-31 09:49:54,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-12-31 09:49:54,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-31 09:49:54,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-31 09:49:54,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-31 09:49:54,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-31 09:49:54,989 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2018-12-31 09:49:54,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:49:54,990 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-31 09:49:54,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 09:49:54,990 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-31 09:49:54,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-31 09:49:54,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-31 09:49:55,184 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 138 [2018-12-31 09:49:55,380 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 162 [2018-12-31 09:49:55,675 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 158 [2018-12-31 09:49:55,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:49:55,876 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 156 [2018-12-31 09:49:55,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:49:55,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:49:55,988 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 110 [2018-12-31 09:49:56,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:49:56,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:49:56,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:49:56,352 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 158 [2018-12-31 09:49:56,535 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 164 [2018-12-31 09:49:56,757 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-12-31 09:49:58,538 WARN L181 SmtUtils]: Spent 1.78 s on a formula simplification. DAG size of input: 137 DAG size of output: 29 [2018-12-31 09:49:59,944 WARN L181 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 160 DAG size of output: 28 [2018-12-31 09:50:00,168 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 26 [2018-12-31 09:50:00,402 WARN L181 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 15 [2018-12-31 09:50:01,285 WARN L181 SmtUtils]: Spent 879.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 25 [2018-12-31 09:50:01,980 WARN L181 SmtUtils]: Spent 686.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 28 [2018-12-31 09:50:02,398 WARN L181 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 27 [2018-12-31 09:50:02,659 WARN L181 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 32 [2018-12-31 09:50:02,788 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 15 [2018-12-31 09:50:02,953 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 28 [2018-12-31 09:50:03,862 WARN L181 SmtUtils]: Spent 903.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 25 [2018-12-31 09:50:04,484 WARN L181 SmtUtils]: Spent 620.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 30 [2018-12-31 09:50:04,488 INFO L444 ceAbstractionStarter]: At program point L333(lines 333 339) the Hoare annotation is: (let ((.cse2 (= ~pumpRunning~0 0)) (.cse0 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse3 (<= 2 ~waterLevel~0)) (.cse1 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse4 (= ULTIMATE.start_main_~tmp~0 1))) (or (and (and (and .cse0 (and .cse1 .cse2)) .cse3) .cse4) (and (and .cse0 (and (= 1 ~waterLevel~0) .cse1 .cse2)) .cse4) (and (and .cse0 .cse3 (and .cse1 (not (= 0 ~systemActive~0)))) .cse4))) [2018-12-31 09:50:04,488 INFO L444 ceAbstractionStarter]: At program point L333-1(lines 333 339) the Hoare annotation is: false [2018-12-31 09:50:04,488 INFO L444 ceAbstractionStarter]: At program point L333-2(lines 333 339) the Hoare annotation is: false [2018-12-31 09:50:04,489 INFO L444 ceAbstractionStarter]: At program point L103(lines 99 105) the Hoare annotation is: (and (= ULTIMATE.start_main_~tmp~0 ~systemActive~0) (= 1 ~waterLevel~0) (= |ULTIMATE.start_valid_product_#res| ~systemActive~0) (= ~pumpRunning~0 0) (= ULTIMATE.start_main_~tmp~0 1)) [2018-12-31 09:50:04,489 INFO L444 ceAbstractionStarter]: At program point L303(lines 1 971) the Hoare annotation is: (and (= 1 ~systemActive~0) (= 1 ~waterLevel~0) (= ~pumpRunning~0 0)) [2018-12-31 09:50:04,489 INFO L451 ceAbstractionStarter]: At program point L139(lines 120 142) the Hoare annotation is: true [2018-12-31 09:50:04,489 INFO L448 ceAbstractionStarter]: For program point L602(line 602) no Hoare annotation was computed. [2018-12-31 09:50:04,489 INFO L448 ceAbstractionStarter]: For program point L602-1(line 602) no Hoare annotation was computed. [2018-12-31 09:50:04,489 INFO L448 ceAbstractionStarter]: For program point L602-2(line 602) no Hoare annotation was computed. [2018-12-31 09:50:04,489 INFO L444 ceAbstractionStarter]: At program point L437(lines 432 440) the Hoare annotation is: (and (= |ULTIMATE.start_valid_product_#res| 1) (= 0 |ULTIMATE.start_isPumpRunning_#res|) (= ULTIMATE.start_test_~splverifierCounter~0 0) (<= 1 ~waterLevel~0) (= ~pumpRunning~0 0) (= ULTIMATE.start_main_~tmp~0 1)) [2018-12-31 09:50:04,489 INFO L444 ceAbstractionStarter]: At program point L437-1(lines 432 440) the Hoare annotation is: false [2018-12-31 09:50:04,489 INFO L444 ceAbstractionStarter]: At program point L437-2(lines 432 440) the Hoare annotation is: false [2018-12-31 09:50:04,490 INFO L448 ceAbstractionStarter]: For program point L571(lines 571 584) no Hoare annotation was computed. [2018-12-31 09:50:04,490 INFO L448 ceAbstractionStarter]: For program point L505(lines 505 509) no Hoare annotation was computed. [2018-12-31 09:50:04,490 INFO L448 ceAbstractionStarter]: For program point L505-2(lines 505 509) no Hoare annotation was computed. [2018-12-31 09:50:04,490 INFO L448 ceAbstractionStarter]: For program point L505-3(lines 505 509) no Hoare annotation was computed. [2018-12-31 09:50:04,490 INFO L448 ceAbstractionStarter]: For program point L505-5(lines 505 509) no Hoare annotation was computed. [2018-12-31 09:50:04,490 INFO L448 ceAbstractionStarter]: For program point L505-6(lines 505 509) no Hoare annotation was computed. [2018-12-31 09:50:04,490 INFO L448 ceAbstractionStarter]: For program point L505-8(lines 505 509) no Hoare annotation was computed. [2018-12-31 09:50:04,490 INFO L448 ceAbstractionStarter]: For program point L208(lines 208 212) no Hoare annotation was computed. [2018-12-31 09:50:04,490 INFO L444 ceAbstractionStarter]: At program point L276(lines 271 279) the Hoare annotation is: (and (= |ULTIMATE.start_valid_product_#res| 1) (= 0 |ULTIMATE.start_isLowWaterSensorDry_#res|) (= ULTIMATE.start_test_~splverifierCounter~0 0) (<= 1 ~waterLevel~0) (not (= 0 ~systemActive~0)) (= ULTIMATE.start_main_~tmp~0 1)) [2018-12-31 09:50:04,490 INFO L444 ceAbstractionStarter]: At program point L276-1(lines 271 279) the Hoare annotation is: false [2018-12-31 09:50:04,491 INFO L444 ceAbstractionStarter]: At program point L276-2(lines 271 279) the Hoare annotation is: false [2018-12-31 09:50:04,491 INFO L448 ceAbstractionStarter]: For program point L542(lines 541 588) no Hoare annotation was computed. [2018-12-31 09:50:04,491 INFO L444 ceAbstractionStarter]: At program point L311(lines 306 314) the Hoare annotation is: (and (= 1 ~systemActive~0) (= 1 ~waterLevel~0) (= |ULTIMATE.start_valid_product_#res| ~systemActive~0) (= ~pumpRunning~0 0)) [2018-12-31 09:50:04,491 INFO L448 ceAbstractionStarter]: For program point L543(lines 543 547) no Hoare annotation was computed. [2018-12-31 09:50:04,491 INFO L448 ceAbstractionStarter]: For program point L577(lines 577 583) no Hoare annotation was computed. [2018-12-31 09:50:04,491 INFO L444 ceAbstractionStarter]: At program point L577-1(lines 326 332) the Hoare annotation is: (let ((.cse2 (= ~pumpRunning~0 0)) (.cse0 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse1 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse3 (<= 2 ~waterLevel~0)) (.cse4 (= ULTIMATE.start_main_~tmp~0 1))) (or (and (and (and .cse0 (and .cse1 .cse2)) .cse3) .cse4) (and (and .cse0 (and (= 1 ~waterLevel~0) .cse1 .cse2)) .cse4) (and (and .cse0 (and .cse1 (not (= 0 ~systemActive~0))) .cse3) .cse4))) [2018-12-31 09:50:04,491 INFO L444 ceAbstractionStarter]: At program point L511(lines 496 514) the Hoare annotation is: (and (= |ULTIMATE.start_valid_product_#res| 1) (not (= 0 |ULTIMATE.start_isLowWaterLevel_#res|)) (= 0 |ULTIMATE.start_isLowWaterSensorDry_#res|) (= ULTIMATE.start_test_~splverifierCounter~0 0) (not (= 0 ULTIMATE.start_isLowWaterLevel_~tmp___0~2)) (= 0 ULTIMATE.start_isLowWaterLevel_~tmp~5) (<= 1 ~waterLevel~0) (not (= 0 ~systemActive~0)) (= ULTIMATE.start_main_~tmp~0 1)) [2018-12-31 09:50:04,492 INFO L444 ceAbstractionStarter]: At program point L511-1(lines 496 514) the Hoare annotation is: false [2018-12-31 09:50:04,492 INFO L444 ceAbstractionStarter]: At program point L511-2(lines 496 514) the Hoare annotation is: false [2018-12-31 09:50:04,492 INFO L448 ceAbstractionStarter]: For program point L184(lines 184 188) no Hoare annotation was computed. [2018-12-31 09:50:04,492 INFO L448 ceAbstractionStarter]: For program point L184-3(lines 184 188) no Hoare annotation was computed. [2018-12-31 09:50:04,492 INFO L448 ceAbstractionStarter]: For program point L184-6(lines 184 188) no Hoare annotation was computed. [2018-12-31 09:50:04,492 INFO L444 ceAbstractionStarter]: At program point L52-2(lines 52 66) the Hoare annotation is: false [2018-12-31 09:50:04,492 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-31 09:50:04,492 INFO L448 ceAbstractionStarter]: For program point L53(line 53) no Hoare annotation was computed. [2018-12-31 09:50:04,492 INFO L448 ceAbstractionStarter]: For program point L384(lines 384 401) no Hoare annotation was computed. [2018-12-31 09:50:04,492 INFO L448 ceAbstractionStarter]: For program point L384-1(lines 384 401) no Hoare annotation was computed. [2018-12-31 09:50:04,493 INFO L448 ceAbstractionStarter]: For program point L384-2(lines 384 401) no Hoare annotation was computed. [2018-12-31 09:50:04,493 INFO L444 ceAbstractionStarter]: At program point L253(lines 248 256) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse1 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse2 (= ULTIMATE.start_main_~tmp~0 1))) (or (and (and (<= 1 ~waterLevel~0) (and .cse0 (and .cse1 (= ~pumpRunning~0 0)))) .cse2) (and (and .cse0 (and .cse1 (not (= 0 ~systemActive~0))) (<= 2 ~waterLevel~0) (<= 2 |ULTIMATE.start_getWaterLevel_#res|)) .cse2))) [2018-12-31 09:50:04,493 INFO L444 ceAbstractionStarter]: At program point L253-1(lines 248 256) the Hoare annotation is: false [2018-12-31 09:50:04,493 INFO L444 ceAbstractionStarter]: At program point L253-2(lines 248 256) the Hoare annotation is: false [2018-12-31 09:50:04,493 INFO L448 ceAbstractionStarter]: For program point L551(lines 551 557) no Hoare annotation was computed. [2018-12-31 09:50:04,493 INFO L444 ceAbstractionStarter]: At program point L551-1(lines 551 557) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse1 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse2 (= ULTIMATE.start_main_~tmp~0 1))) (or (and (and .cse0 (and .cse1 (not (= 0 ~systemActive~0))) (<= 2 ~waterLevel~0)) .cse2) (and (and (<= 1 ~waterLevel~0) (and .cse0 (and .cse1 (= ~pumpRunning~0 0)))) .cse2))) [2018-12-31 09:50:04,493 INFO L448 ceAbstractionStarter]: For program point L155(lines 155 168) no Hoare annotation was computed. [2018-12-31 09:50:04,494 INFO L444 ceAbstractionStarter]: At program point L155-1(lines 1 971) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse1 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse2 (= ULTIMATE.start_main_~tmp~0 1))) (or (and (and .cse0 (<= 2 ~waterLevel~0) (<= 2 ULTIMATE.start___utac_acc__Specification4_spec__1_~tmp~1) (and .cse1 (not (= 0 ~systemActive~0))) (<= 2 |ULTIMATE.start_getWaterLevel_#res|)) .cse2) (and (and (and .cse0 (and .cse1 (= ~pumpRunning~0 0))) (<= 1 ~waterLevel~0)) .cse2))) [2018-12-31 09:50:04,494 INFO L448 ceAbstractionStarter]: For program point L155-2(lines 155 168) no Hoare annotation was computed. [2018-12-31 09:50:04,494 INFO L444 ceAbstractionStarter]: At program point L155-3(lines 1 971) the Hoare annotation is: false [2018-12-31 09:50:04,494 INFO L448 ceAbstractionStarter]: For program point L56(lines 56 60) no Hoare annotation was computed. [2018-12-31 09:50:04,494 INFO L448 ceAbstractionStarter]: For program point L56-1(lines 326 332) no Hoare annotation was computed. [2018-12-31 09:50:04,494 INFO L448 ceAbstractionStarter]: For program point L155-4(lines 155 168) no Hoare annotation was computed. [2018-12-31 09:50:04,494 INFO L444 ceAbstractionStarter]: At program point L155-5(lines 1 971) the Hoare annotation is: false [2018-12-31 09:50:04,494 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 602) no Hoare annotation was computed. [2018-12-31 09:50:04,494 INFO L448 ceAbstractionStarter]: For program point L519(lines 519 525) no Hoare annotation was computed. [2018-12-31 09:50:04,495 INFO L444 ceAbstractionStarter]: At program point L519-1(lines 519 525) the Hoare annotation is: (and (= |ULTIMATE.start_valid_product_#res| 1) (= ULTIMATE.start_test_~splverifierCounter~0 0) (<= 1 ~waterLevel~0) (= ~pumpRunning~0 0) (= ULTIMATE.start_main_~tmp~0 1)) [2018-12-31 09:50:04,495 INFO L448 ceAbstractionStarter]: For program point L486(lines 486 490) no Hoare annotation was computed. [2018-12-31 09:50:04,495 INFO L448 ceAbstractionStarter]: For program point L486-2(lines 486 490) no Hoare annotation was computed. [2018-12-31 09:50:04,495 INFO L448 ceAbstractionStarter]: For program point L486-3(lines 486 490) no Hoare annotation was computed. [2018-12-31 09:50:04,495 INFO L448 ceAbstractionStarter]: For program point L486-5(lines 486 490) no Hoare annotation was computed. [2018-12-31 09:50:04,495 INFO L448 ceAbstractionStarter]: For program point L486-6(lines 486 490) no Hoare annotation was computed. [2018-12-31 09:50:04,495 INFO L448 ceAbstractionStarter]: For program point L486-8(lines 486 490) no Hoare annotation was computed. [2018-12-31 09:50:04,495 INFO L448 ceAbstractionStarter]: For program point L486-9(lines 486 490) no Hoare annotation was computed. [2018-12-31 09:50:04,495 INFO L448 ceAbstractionStarter]: For program point L486-11(lines 486 490) no Hoare annotation was computed. [2018-12-31 09:50:04,495 INFO L448 ceAbstractionStarter]: For program point L486-12(lines 486 490) no Hoare annotation was computed. [2018-12-31 09:50:04,496 INFO L448 ceAbstractionStarter]: For program point L486-14(lines 486 490) no Hoare annotation was computed. [2018-12-31 09:50:04,496 INFO L448 ceAbstractionStarter]: For program point L486-15(lines 486 490) no Hoare annotation was computed. [2018-12-31 09:50:04,496 INFO L448 ceAbstractionStarter]: For program point L486-17(lines 486 490) no Hoare annotation was computed. [2018-12-31 09:50:04,496 INFO L448 ceAbstractionStarter]: For program point L388(lines 388 396) no Hoare annotation was computed. [2018-12-31 09:50:04,496 INFO L448 ceAbstractionStarter]: For program point L388-1(lines 388 396) no Hoare annotation was computed. [2018-12-31 09:50:04,496 INFO L448 ceAbstractionStarter]: For program point L388-2(lines 388 396) no Hoare annotation was computed. [2018-12-31 09:50:04,496 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-31 09:50:04,496 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 165) no Hoare annotation was computed. [2018-12-31 09:50:04,496 INFO L448 ceAbstractionStarter]: For program point L159-2(lines 159 165) no Hoare annotation was computed. [2018-12-31 09:50:04,496 INFO L448 ceAbstractionStarter]: For program point L159-4(lines 159 165) no Hoare annotation was computed. [2018-12-31 09:50:04,496 INFO L444 ceAbstractionStarter]: At program point L589(lines 540 590) the Hoare annotation is: false [2018-12-31 09:50:04,497 INFO L448 ceAbstractionStarter]: For program point L358(lines 358 375) no Hoare annotation was computed. [2018-12-31 09:50:04,497 INFO L448 ceAbstractionStarter]: For program point L358-1(lines 358 375) no Hoare annotation was computed. [2018-12-31 09:50:04,497 INFO L448 ceAbstractionStarter]: For program point L358-2(lines 358 375) no Hoare annotation was computed. [2018-12-31 09:50:04,497 INFO L448 ceAbstractionStarter]: For program point L358-3(lines 358 375) no Hoare annotation was computed. [2018-12-31 09:50:04,497 INFO L448 ceAbstractionStarter]: For program point L358-4(lines 358 375) no Hoare annotation was computed. [2018-12-31 09:50:04,497 INFO L448 ceAbstractionStarter]: For program point L358-5(lines 358 375) no Hoare annotation was computed. [2018-12-31 09:50:04,497 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-31 09:50:04,497 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 602) no Hoare annotation was computed. [2018-12-31 09:50:04,497 INFO L444 ceAbstractionStarter]: At program point L326(lines 325 344) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse1 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse3 (= ~pumpRunning~0 0)) (.cse2 (= ULTIMATE.start_main_~tmp~0 1))) (or (and (and (and .cse0 (and .cse1 (not (= 0 ~systemActive~0)))) (<= 1 ~waterLevel~0)) .cse2) (and (and (and .cse0 (and .cse1 .cse3)) (<= 2 ~waterLevel~0)) .cse2) (and (and .cse0 (and (= 1 ~waterLevel~0) .cse1 .cse3)) .cse2))) [2018-12-31 09:50:04,498 INFO L448 ceAbstractionStarter]: For program point L326-1(lines 326 332) no Hoare annotation was computed. [2018-12-31 09:50:04,498 INFO L444 ceAbstractionStarter]: At program point L326-2(lines 325 344) the Hoare annotation is: false [2018-12-31 09:50:04,498 INFO L444 ceAbstractionStarter]: At program point L326-3(lines 325 344) the Hoare annotation is: false [2018-12-31 09:50:04,498 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 602) no Hoare annotation was computed. [2018-12-31 09:50:04,498 INFO L444 ceAbstractionStarter]: At program point L492(lines 477 495) the Hoare annotation is: false [2018-12-31 09:50:04,498 INFO L444 ceAbstractionStarter]: At program point L492-1(lines 477 495) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse1 (and (and (= ULTIMATE.start_test_~splverifierCounter~0 0) (not (= 0 ~systemActive~0))) (= ~pumpRunning~0 0))) (.cse2 (= ULTIMATE.start_main_~tmp~0 1))) (or (and (and (and (= 0 |ULTIMATE.start_isHighWaterLevel_#res|) .cse0 (not (= 0 ULTIMATE.start_isHighWaterLevel_~tmp~4)) .cse1 (= 0 ULTIMATE.start_isHighWaterLevel_~tmp___0~1)) (<= 1 ~waterLevel~0)) .cse2) (and (and .cse0 .cse1 (<= 2 ~waterLevel~0)) .cse2))) [2018-12-31 09:50:04,498 INFO L444 ceAbstractionStarter]: At program point L492-2(lines 477 495) the Hoare annotation is: false [2018-12-31 09:50:04,498 INFO L444 ceAbstractionStarter]: At program point L492-3(lines 477 495) the Hoare annotation is: false [2018-12-31 09:50:04,498 INFO L444 ceAbstractionStarter]: At program point L492-4(lines 477 495) the Hoare annotation is: false [2018-12-31 09:50:04,499 INFO L444 ceAbstractionStarter]: At program point L492-5(lines 477 495) the Hoare annotation is: false [2018-12-31 09:50:04,499 INFO L448 ceAbstractionStarter]: For program point L261(lines 261 267) no Hoare annotation was computed. [2018-12-31 09:50:04,499 INFO L448 ceAbstractionStarter]: For program point L261-1(lines 261 267) no Hoare annotation was computed. [2018-12-31 09:50:04,499 INFO L448 ceAbstractionStarter]: For program point L261-2(lines 261 267) no Hoare annotation was computed. [2018-12-31 09:50:04,499 INFO L448 ceAbstractionStarter]: For program point L261-3(lines 261 267) no Hoare annotation was computed. [2018-12-31 09:50:04,499 INFO L448 ceAbstractionStarter]: For program point L261-4(lines 261 267) no Hoare annotation was computed. [2018-12-31 09:50:04,499 INFO L448 ceAbstractionStarter]: For program point L261-5(lines 261 267) no Hoare annotation was computed. [2018-12-31 09:50:04,499 INFO L448 ceAbstractionStarter]: For program point L196(lines 196 200) no Hoare annotation was computed. [2018-12-31 09:50:04,499 INFO L448 ceAbstractionStarter]: For program point L130(lines 130 137) no Hoare annotation was computed. [2018-12-31 09:50:04,499 INFO L451 ceAbstractionStarter]: At program point L130-1(lines 130 137) the Hoare annotation is: true [2018-12-31 09:50:04,499 INFO L448 ceAbstractionStarter]: For program point L362(lines 362 370) no Hoare annotation was computed. [2018-12-31 09:50:04,500 INFO L448 ceAbstractionStarter]: For program point L362-1(lines 362 370) no Hoare annotation was computed. [2018-12-31 09:50:04,500 INFO L448 ceAbstractionStarter]: For program point L362-2(lines 362 370) no Hoare annotation was computed. [2018-12-31 09:50:04,500 INFO L448 ceAbstractionStarter]: For program point L362-3(lines 362 370) no Hoare annotation was computed. [2018-12-31 09:50:04,500 INFO L448 ceAbstractionStarter]: For program point L362-4(lines 362 370) no Hoare annotation was computed. [2018-12-31 09:50:04,500 INFO L448 ceAbstractionStarter]: For program point L362-5(lines 362 370) no Hoare annotation was computed. [2018-12-31 09:50:04,500 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-31 09:50:04,500 INFO L448 ceAbstractionStarter]: For program point L561(lines 561 567) no Hoare annotation was computed. [2018-12-31 09:50:04,500 INFO L444 ceAbstractionStarter]: At program point L561-1(lines 561 567) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse1 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse2 (= ULTIMATE.start_main_~tmp~0 1))) (or (and (and .cse0 (and .cse1 (not (= 0 ~systemActive~0))) (<= 2 ~waterLevel~0)) .cse2) (and (and (<= 1 ~waterLevel~0) (and .cse0 (and .cse1 (= ~pumpRunning~0 0)))) .cse2))) [2018-12-31 09:50:04,500 INFO L444 ceAbstractionStarter]: At program point L266(lines 257 270) the Hoare annotation is: false [2018-12-31 09:50:04,501 INFO L444 ceAbstractionStarter]: At program point L266-1(lines 257 270) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse1 (and (and (= ULTIMATE.start_test_~splverifierCounter~0 0) (not (= 0 ~systemActive~0))) (= ~pumpRunning~0 0))) (.cse2 (= ULTIMATE.start_main_~tmp~0 1))) (or (and (and .cse0 .cse1 (<= 2 ~waterLevel~0)) .cse2) (and (and (and .cse0 .cse1 (not (= 0 |ULTIMATE.start_isHighWaterSensorDry_#res|))) (<= 1 ~waterLevel~0)) .cse2))) [2018-12-31 09:50:04,501 INFO L444 ceAbstractionStarter]: At program point L266-2(lines 257 270) the Hoare annotation is: false [2018-12-31 09:50:04,501 INFO L444 ceAbstractionStarter]: At program point L266-3(lines 257 270) the Hoare annotation is: false [2018-12-31 09:50:04,501 INFO L444 ceAbstractionStarter]: At program point L266-4(lines 257 270) the Hoare annotation is: false [2018-12-31 09:50:04,501 INFO L444 ceAbstractionStarter]: At program point L266-5(lines 257 270) the Hoare annotation is: false [2018-12-31 09:50:04,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 09:50:04 BoogieIcfgContainer [2018-12-31 09:50:04,531 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 09:50:04,532 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 09:50:04,532 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 09:50:04,532 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 09:50:04,533 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:49:46" (3/4) ... [2018-12-31 09:50:04,537 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-31 09:50:04,558 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 38 nodes and edges [2018-12-31 09:50:04,560 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2018-12-31 09:50:04,561 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2018-12-31 09:50:04,562 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-31 09:50:04,563 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-31 09:50:04,563 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-31 09:50:04,610 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((1 == systemActive && 1 == waterLevel) && \result == systemActive) && pumpRunning == 0 [2018-12-31 09:50:04,610 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((tmp == systemActive && 1 == waterLevel) && \result == systemActive) && pumpRunning == 0) && tmp == 1 [2018-12-31 09:50:04,611 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\result == 1 && 2 <= waterLevel) && 2 <= tmp) && splverifierCounter == 0 && !(0 == systemActive)) && 2 <= \result) && tmp == 1) || (((\result == 1 && splverifierCounter == 0 && pumpRunning == 0) && 1 <= waterLevel) && tmp == 1) [2018-12-31 09:50:04,612 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 1 && splverifierCounter == 0 && !(0 == systemActive)) && 2 <= waterLevel) && tmp == 1) || ((1 <= waterLevel && \result == 1 && splverifierCounter == 0 && pumpRunning == 0) && tmp == 1) [2018-12-31 09:50:04,613 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 1 && splverifierCounter == 0 && !(0 == systemActive)) && 2 <= waterLevel) && tmp == 1) || ((1 <= waterLevel && \result == 1 && splverifierCounter == 0 && pumpRunning == 0) && tmp == 1) [2018-12-31 09:50:04,613 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\result == 1 && splverifierCounter == 0 && pumpRunning == 0) && 2 <= waterLevel) && tmp == 1) || ((\result == 1 && (1 == waterLevel && splverifierCounter == 0) && pumpRunning == 0) && tmp == 1)) || (((\result == 1 && splverifierCounter == 0 && !(0 == systemActive)) && 2 <= waterLevel) && tmp == 1) [2018-12-31 09:50:04,613 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\result == 1 && splverifierCounter == 0 && !(0 == systemActive)) && 1 <= waterLevel) && tmp == 1) || (((\result == 1 && splverifierCounter == 0 && pumpRunning == 0) && 2 <= waterLevel) && tmp == 1)) || ((\result == 1 && (1 == waterLevel && splverifierCounter == 0) && pumpRunning == 0) && tmp == 1) [2018-12-31 09:50:04,614 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\result == 1 && splverifierCounter == 0 && pumpRunning == 0) && 2 <= waterLevel) && tmp == 1) || ((\result == 1 && (1 == waterLevel && splverifierCounter == 0) && pumpRunning == 0) && tmp == 1)) || (((\result == 1 && 2 <= waterLevel) && splverifierCounter == 0 && !(0 == systemActive)) && tmp == 1) [2018-12-31 09:50:04,614 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 1 && splverifierCounter == 0) && 1 <= waterLevel) && pumpRunning == 0) && tmp == 1 [2018-12-31 09:50:04,617 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((1 <= waterLevel && \result == 1 && splverifierCounter == 0 && pumpRunning == 0) && tmp == 1) || ((((\result == 1 && splverifierCounter == 0 && !(0 == systemActive)) && 2 <= waterLevel) && 2 <= \result) && tmp == 1) [2018-12-31 09:50:04,618 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\result == 1 && 0 == \result) && splverifierCounter == 0) && 1 <= waterLevel) && !(0 == systemActive)) && tmp == 1 [2018-12-31 09:50:04,619 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 1 && (splverifierCounter == 0 && !(0 == systemActive)) && pumpRunning == 0) && 2 <= waterLevel) && tmp == 1) || ((((\result == 1 && (splverifierCounter == 0 && !(0 == systemActive)) && pumpRunning == 0) && !(0 == \result)) && 1 <= waterLevel) && tmp == 1) [2018-12-31 09:50:04,619 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\result == 1 && 0 == \result) && splverifierCounter == 0) && 1 <= waterLevel) && pumpRunning == 0) && tmp == 1 [2018-12-31 09:50:04,621 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\result == 1 && !(0 == \result)) && 0 == \result) && splverifierCounter == 0) && !(0 == tmp___0)) && 0 == tmp) && 1 <= waterLevel) && !(0 == systemActive)) && tmp == 1 [2018-12-31 09:50:04,622 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((0 == \result && \result == 1) && !(0 == tmp)) && (splverifierCounter == 0 && !(0 == systemActive)) && pumpRunning == 0) && 0 == tmp___0) && 1 <= waterLevel) && tmp == 1) || (((\result == 1 && (splverifierCounter == 0 && !(0 == systemActive)) && pumpRunning == 0) && 2 <= waterLevel) && tmp == 1) [2018-12-31 09:50:04,734 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 09:50:04,734 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 09:50:04,735 INFO L168 Benchmark]: Toolchain (without parser) took 20878.41 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 329.8 MB). Free memory was 951.4 MB in the beginning and 941.2 MB in the end (delta: 10.1 MB). Peak memory consumption was 339.9 MB. Max. memory is 11.5 GB. [2018-12-31 09:50:04,735 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. [2018-12-31 09:50:04,737 INFO L168 Benchmark]: CACSL2BoogieTranslator took 749.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -194.4 MB). Peak memory consumption was 43.6 MB. Max. memory is 11.5 GB. [2018-12-31 09:50:04,737 INFO L168 Benchmark]: Boogie Procedure Inliner took 101.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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2018-12-31 09:50:04,739 INFO L168 Benchmark]: Boogie Preprocessor took 55.01 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2018-12-31 09:50:04,739 INFO L168 Benchmark]: RCFGBuilder took 1980.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.5 MB). Peak memory consumption was 58.5 MB. Max. memory is 11.5 GB. [2018-12-31 09:50:04,739 INFO L168 Benchmark]: TraceAbstraction took 17783.82 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 177.7 MB). Free memory was 1.1 GB in the beginning and 962.0 MB in the end (delta: 112.0 MB). Peak memory consumption was 406.6 MB. Max. memory is 11.5 GB. [2018-12-31 09:50:04,740 INFO L168 Benchmark]: Witness Printer took 202.13 ms. Allocated memory is still 1.4 GB. Free memory was 962.0 MB in the beginning and 941.2 MB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2018-12-31 09:50:04,744 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 749.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -194.4 MB). Peak memory consumption was 43.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 101.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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 55.01 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1980.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.5 MB). Peak memory consumption was 58.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17783.82 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 177.7 MB). Free memory was 1.1 GB in the beginning and 962.0 MB in the end (delta: 112.0 MB). Peak memory consumption was 406.6 MB. Max. memory is 11.5 GB. * Witness Printer took 202.13 ms. Allocated memory is still 1.4 GB. Free memory was 962.0 MB in the beginning and 941.2 MB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 602]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 602]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 602]: 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: 1]: Loop Invariant Derived loop invariant: (1 == systemActive && 1 == waterLevel) && pumpRunning == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((\result == 1 && 2 <= waterLevel) && 2 <= tmp) && splverifierCounter == 0 && !(0 == systemActive)) && 2 <= \result) && tmp == 1) || (((\result == 1 && splverifierCounter == 0 && pumpRunning == 0) && 1 <= waterLevel) && tmp == 1) - InvariantResult [Line: 271]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 271]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 326]: Loop Invariant Derived loop invariant: ((((\result == 1 && splverifierCounter == 0 && pumpRunning == 0) && 2 <= waterLevel) && tmp == 1) || ((\result == 1 && (1 == waterLevel && splverifierCounter == 0) && pumpRunning == 0) && tmp == 1)) || (((\result == 1 && splverifierCounter == 0 && !(0 == systemActive)) && 2 <= waterLevel) && tmp == 1) - InvariantResult [Line: 271]: Loop Invariant Derived loop invariant: ((((\result == 1 && 0 == \result) && splverifierCounter == 0) && 1 <= waterLevel) && !(0 == systemActive)) && tmp == 1 - InvariantResult [Line: 496]: Loop Invariant Derived loop invariant: (((((((\result == 1 && !(0 == \result)) && 0 == \result) && splverifierCounter == 0) && !(0 == tmp___0)) && 0 == tmp) && 1 <= waterLevel) && !(0 == systemActive)) && tmp == 1 - InvariantResult [Line: 432]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 477]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 432]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 477]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 477]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 519]: Loop Invariant Derived loop invariant: (((\result == 1 && splverifierCounter == 0) && 1 <= waterLevel) && pumpRunning == 0) && tmp == 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 561]: Loop Invariant Derived loop invariant: (((\result == 1 && splverifierCounter == 0 && !(0 == systemActive)) && 2 <= waterLevel) && tmp == 1) || ((1 <= waterLevel && \result == 1 && splverifierCounter == 0 && pumpRunning == 0) && tmp == 1) - InvariantResult [Line: 325]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 325]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 248]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 540]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 333]: Loop Invariant Derived loop invariant: ((((\result == 1 && splverifierCounter == 0 && pumpRunning == 0) && 2 <= waterLevel) && tmp == 1) || ((\result == 1 && (1 == waterLevel && splverifierCounter == 0) && pumpRunning == 0) && tmp == 1)) || (((\result == 1 && 2 <= waterLevel) && splverifierCounter == 0 && !(0 == systemActive)) && tmp == 1) - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 306]: Loop Invariant Derived loop invariant: ((1 == systemActive && 1 == waterLevel) && \result == systemActive) && pumpRunning == 0 - InvariantResult [Line: 248]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: (((tmp == systemActive && 1 == waterLevel) && \result == systemActive) && pumpRunning == 0) && tmp == 1 - InvariantResult [Line: 333]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 477]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 248]: Loop Invariant Derived loop invariant: ((1 <= waterLevel && \result == 1 && splverifierCounter == 0 && pumpRunning == 0) && tmp == 1) || ((((\result == 1 && splverifierCounter == 0 && !(0 == systemActive)) && 2 <= waterLevel) && 2 <= \result) && tmp == 1) - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 333]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 477]: Loop Invariant Derived loop invariant: ((((((0 == \result && \result == 1) && !(0 == tmp)) && (splverifierCounter == 0 && !(0 == systemActive)) && pumpRunning == 0) && 0 == tmp___0) && 1 <= waterLevel) && tmp == 1) || (((\result == 1 && (splverifierCounter == 0 && !(0 == systemActive)) && pumpRunning == 0) && 2 <= waterLevel) && tmp == 1) - InvariantResult [Line: 432]: Loop Invariant Derived loop invariant: ((((\result == 1 && 0 == \result) && splverifierCounter == 0) && 1 <= waterLevel) && pumpRunning == 0) && tmp == 1 - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: (((\result == 1 && (splverifierCounter == 0 && !(0 == systemActive)) && pumpRunning == 0) && 2 <= waterLevel) && tmp == 1) || ((((\result == 1 && (splverifierCounter == 0 && !(0 == systemActive)) && pumpRunning == 0) && !(0 == \result)) && 1 <= waterLevel) && tmp == 1) - InvariantResult [Line: 477]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 496]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 120]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 496]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 130]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 551]: Loop Invariant Derived loop invariant: (((\result == 1 && splverifierCounter == 0 && !(0 == systemActive)) && 2 <= waterLevel) && tmp == 1) || ((1 <= waterLevel && \result == 1 && splverifierCounter == 0 && pumpRunning == 0) && tmp == 1) - InvariantResult [Line: 325]: Loop Invariant Derived loop invariant: ((((\result == 1 && splverifierCounter == 0 && !(0 == systemActive)) && 1 <= waterLevel) && tmp == 1) || (((\result == 1 && splverifierCounter == 0 && pumpRunning == 0) && 2 <= waterLevel) && tmp == 1)) || ((\result == 1 && (1 == waterLevel && splverifierCounter == 0) && pumpRunning == 0) && tmp == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 119 locations, 3 error locations. SAFE Result, 17.6s OverallTime, 11 OverallIterations, 2 TraceHistogramMax, 5.3s AutomataDifference, 0.0s DeadEndRemovalTime, 9.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 1186 SDtfs, 1947 SDslu, 2215 SDs, 0 SdLazy, 306 SolverSat, 62 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=310occurred in iteration=10, 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.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 1057 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 44 LocationsWithAnnotation, 44 PreInvPairs, 215 NumberOfFragments, 606 HoareAnnotationTreeSize, 44 FomulaSimplifications, 202528 FormulaSimplificationTreeSizeReduction, 1.5s HoareSimplificationTime, 44 FomulaSimplificationsInter, 517453 FormulaSimplificationTreeSizeReductionInter, 7.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 327 NumberOfCodeBlocks, 327 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 316 ConstructedInterpolants, 0 QuantifiedInterpolants, 18336 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 28/28 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...