./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec2_product59_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/product-lines/minepump_spec2_product59_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 8a74a11a5d5c8fe8b4adcf5c10f76ddbc8ce0734 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 14:52:13,336 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 14:52:13,341 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 14:52:13,353 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 14:52:13,353 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 14:52:13,354 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 14:52:13,355 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 14:52:13,358 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 14:52:13,359 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 14:52:13,360 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 14:52:13,361 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 14:52:13,361 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 14:52:13,362 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 14:52:13,363 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 14:52:13,364 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 14:52:13,365 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 14:52:13,366 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 14:52:13,368 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 14:52:13,370 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 14:52:13,372 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 14:52:13,373 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 14:52:13,374 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 14:52:13,377 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 14:52:13,377 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 14:52:13,377 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 14:52:13,378 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 14:52:13,379 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 14:52:13,380 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 14:52:13,381 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 14:52:13,382 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 14:52:13,383 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 14:52:13,383 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 14:52:13,384 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 14:52:13,384 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 14:52:13,385 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 14:52:13,386 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 14:52:13,386 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 14:52:13,402 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 14:52:13,402 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 14:52:13,404 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 14:52:13,404 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 14:52:13,404 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 14:52:13,404 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 14:52:13,404 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 14:52:13,405 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 14:52:13,405 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 14:52:13,405 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 14:52:13,405 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 14:52:13,405 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 14:52:13,406 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 14:52:13,406 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 14:52:13,406 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 14:52:13,406 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 14:52:13,406 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 14:52:13,407 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 14:52:13,407 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 14:52:13,407 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 14:52:13,407 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 14:52:13,407 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:52:13,408 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 14:52:13,408 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 14:52:13,408 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 14:52:13,408 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 14:52:13,408 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 14:52:13,409 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 14:52:13,409 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 -> 8a74a11a5d5c8fe8b4adcf5c10f76ddbc8ce0734 [2019-01-12 14:52:13,442 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 14:52:13,455 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 14:52:13,458 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 14:52:13,459 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 14:52:13,459 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 14:52:13,460 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec2_product59_true-unreach-call_false-termination.cil.c [2019-01-12 14:52:13,513 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c30c941d3/32b3bc096502417d81426b134b2e8435/FLAG2a2eab1fd [2019-01-12 14:52:14,026 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 14:52:14,029 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec2_product59_true-unreach-call_false-termination.cil.c [2019-01-12 14:52:14,055 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c30c941d3/32b3bc096502417d81426b134b2e8435/FLAG2a2eab1fd [2019-01-12 14:52:14,306 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c30c941d3/32b3bc096502417d81426b134b2e8435 [2019-01-12 14:52:14,310 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 14:52:14,312 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 14:52:14,313 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 14:52:14,313 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 14:52:14,317 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 14:52:14,318 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:52:14" (1/1) ... [2019-01-12 14:52:14,322 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4998b6ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:52:14, skipping insertion in model container [2019-01-12 14:52:14,323 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:52:14" (1/1) ... [2019-01-12 14:52:14,332 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 14:52:14,392 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 14:52:14,755 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:52:14,777 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 14:52:14,934 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:52:14,974 INFO L195 MainTranslator]: Completed translation [2019-01-12 14:52:14,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:52:14 WrapperNode [2019-01-12 14:52:14,974 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 14:52:14,975 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 14:52:14,975 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 14:52:14,975 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 14:52:14,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:52:14" (1/1) ... [2019-01-12 14:52:15,002 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:52:14" (1/1) ... [2019-01-12 14:52:15,058 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 14:52:15,058 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 14:52:15,058 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 14:52:15,059 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 14:52:15,069 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:52:14" (1/1) ... [2019-01-12 14:52:15,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:52:14" (1/1) ... [2019-01-12 14:52:15,075 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:52:14" (1/1) ... [2019-01-12 14:52:15,075 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:52:14" (1/1) ... [2019-01-12 14:52:15,088 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:52:14" (1/1) ... [2019-01-12 14:52:15,109 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:52:14" (1/1) ... [2019-01-12 14:52:15,113 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:52:14" (1/1) ... [2019-01-12 14:52:15,119 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 14:52:15,119 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 14:52:15,119 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 14:52:15,120 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 14:52:15,121 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:52:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:52:15,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 14:52:15,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-12 14:52:15,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 14:52:15,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 14:52:16,839 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 14:52:16,839 INFO L286 CfgBuilder]: Removed 198 assue(true) statements. [2019-01-12 14:52:16,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:52:16 BoogieIcfgContainer [2019-01-12 14:52:16,841 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 14:52:16,842 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 14:52:16,842 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 14:52:16,846 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 14:52:16,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 02:52:14" (1/3) ... [2019-01-12 14:52:16,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@170acb8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:52:16, skipping insertion in model container [2019-01-12 14:52:16,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:52:14" (2/3) ... [2019-01-12 14:52:16,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@170acb8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:52:16, skipping insertion in model container [2019-01-12 14:52:16,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:52:16" (3/3) ... [2019-01-12 14:52:16,851 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product59_true-unreach-call_false-termination.cil.c [2019-01-12 14:52:16,861 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 14:52:16,870 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-12 14:52:16,887 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-12 14:52:16,921 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 14:52:16,922 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 14:52:16,922 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 14:52:16,922 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 14:52:16,923 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 14:52:16,923 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 14:52:16,923 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 14:52:16,923 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 14:52:16,923 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 14:52:16,943 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states. [2019-01-12 14:52:16,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-12 14:52:16,951 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:52:16,952 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:52:16,955 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:52:16,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:52:16,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1941296929, now seen corresponding path program 1 times [2019-01-12 14:52:16,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:52:16,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:52:17,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:17,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:52:17,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:17,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:52:17,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:52:17,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:52:17,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:52:17,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 14:52:17,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 14:52:17,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 14:52:17,228 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 2 states. [2019-01-12 14:52:17,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:52:17,264 INFO L93 Difference]: Finished difference Result 275 states and 414 transitions. [2019-01-12 14:52:17,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 14:52:17,266 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-01-12 14:52:17,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:52:17,280 INFO L225 Difference]: With dead ends: 275 [2019-01-12 14:52:17,280 INFO L226 Difference]: Without dead ends: 137 [2019-01-12 14:52:17,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 14:52:17,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-01-12 14:52:17,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2019-01-12 14:52:17,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-01-12 14:52:17,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 199 transitions. [2019-01-12 14:52:17,330 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 199 transitions. Word has length 18 [2019-01-12 14:52:17,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:52:17,331 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 199 transitions. [2019-01-12 14:52:17,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 14:52:17,331 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 199 transitions. [2019-01-12 14:52:17,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-12 14:52:17,332 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:52:17,333 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:52:17,333 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:52:17,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:52:17,334 INFO L82 PathProgramCache]: Analyzing trace with hash 530190787, now seen corresponding path program 1 times [2019-01-12 14:52:17,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:52:17,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:52:17,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:17,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:52:17,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:17,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:52:17,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:52:17,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:52:17,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:52:17,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:52:17,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:52:17,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:52:17,484 INFO L87 Difference]: Start difference. First operand 137 states and 199 transitions. Second operand 3 states. [2019-01-12 14:52:17,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:52:17,512 INFO L93 Difference]: Finished difference Result 137 states and 199 transitions. [2019-01-12 14:52:17,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:52:17,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-01-12 14:52:17,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:52:17,515 INFO L225 Difference]: With dead ends: 137 [2019-01-12 14:52:17,515 INFO L226 Difference]: Without dead ends: 57 [2019-01-12 14:52:17,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:52:17,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-12 14:52:17,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-01-12 14:52:17,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-12 14:52:17,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 82 transitions. [2019-01-12 14:52:17,525 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 82 transitions. Word has length 19 [2019-01-12 14:52:17,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:52:17,525 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 82 transitions. [2019-01-12 14:52:17,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:52:17,525 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 82 transitions. [2019-01-12 14:52:17,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-12 14:52:17,527 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:52:17,527 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:52:17,528 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:52:17,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:52:17,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1901621695, now seen corresponding path program 1 times [2019-01-12 14:52:17,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:52:17,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:52:17,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:17,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:52:17,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:17,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:52:17,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:52:17,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:52:17,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:52:17,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 14:52:17,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 14:52:17,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 14:52:17,773 INFO L87 Difference]: Start difference. First operand 57 states and 82 transitions. Second operand 6 states. [2019-01-12 14:52:17,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:52:17,984 INFO L93 Difference]: Finished difference Result 181 states and 268 transitions. [2019-01-12 14:52:17,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:52:17,989 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-01-12 14:52:17,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:52:17,992 INFO L225 Difference]: With dead ends: 181 [2019-01-12 14:52:17,992 INFO L226 Difference]: Without dead ends: 131 [2019-01-12 14:52:17,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:52:17,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-01-12 14:52:18,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 77. [2019-01-12 14:52:18,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-12 14:52:18,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 113 transitions. [2019-01-12 14:52:18,012 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 113 transitions. Word has length 24 [2019-01-12 14:52:18,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:52:18,013 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 113 transitions. [2019-01-12 14:52:18,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 14:52:18,013 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 113 transitions. [2019-01-12 14:52:18,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-12 14:52:18,014 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:52:18,014 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:52:18,015 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:52:18,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:52:18,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1082042232, now seen corresponding path program 1 times [2019-01-12 14:52:18,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:52:18,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:52:18,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:18,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:52:18,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:18,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:52:18,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:52:18,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:52:18,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:52:18,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:52:18,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:52:18,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:52:18,125 INFO L87 Difference]: Start difference. First operand 77 states and 113 transitions. Second operand 3 states. [2019-01-12 14:52:18,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:52:18,246 INFO L93 Difference]: Finished difference Result 169 states and 251 transitions. [2019-01-12 14:52:18,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:52:18,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-01-12 14:52:18,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:52:18,248 INFO L225 Difference]: With dead ends: 169 [2019-01-12 14:52:18,249 INFO L226 Difference]: Without dead ends: 99 [2019-01-12 14:52:18,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:52:18,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-12 14:52:18,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2019-01-12 14:52:18,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-12 14:52:18,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 139 transitions. [2019-01-12 14:52:18,265 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 139 transitions. Word has length 26 [2019-01-12 14:52:18,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:52:18,265 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 139 transitions. [2019-01-12 14:52:18,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:52:18,265 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2019-01-12 14:52:18,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-12 14:52:18,268 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:52:18,268 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:52:18,268 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:52:18,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:52:18,269 INFO L82 PathProgramCache]: Analyzing trace with hash -2071837624, now seen corresponding path program 1 times [2019-01-12 14:52:18,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:52:18,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:52:18,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:18,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:52:18,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:18,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:52:18,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:52:18,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:52:18,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:52:18,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:52:18,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:52:18,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:52:18,545 INFO L87 Difference]: Start difference. First operand 97 states and 139 transitions. Second operand 5 states. [2019-01-12 14:52:19,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:52:19,291 INFO L93 Difference]: Finished difference Result 355 states and 513 transitions. [2019-01-12 14:52:19,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 14:52:19,292 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-01-12 14:52:19,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:52:19,295 INFO L225 Difference]: With dead ends: 355 [2019-01-12 14:52:19,295 INFO L226 Difference]: Without dead ends: 265 [2019-01-12 14:52:19,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:52:19,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-01-12 14:52:19,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 95. [2019-01-12 14:52:19,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-12 14:52:19,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 133 transitions. [2019-01-12 14:52:19,327 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 133 transitions. Word has length 27 [2019-01-12 14:52:19,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:52:19,328 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 133 transitions. [2019-01-12 14:52:19,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:52:19,328 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 133 transitions. [2019-01-12 14:52:19,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-12 14:52:19,330 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:52:19,330 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:52:19,331 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:52:19,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:52:19,331 INFO L82 PathProgramCache]: Analyzing trace with hash -413684142, now seen corresponding path program 1 times [2019-01-12 14:52:19,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:52:19,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:52:19,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:19,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:52:19,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:19,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:52:19,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:52:19,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:52:19,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:52:19,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 14:52:19,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 14:52:19,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 14:52:19,423 INFO L87 Difference]: Start difference. First operand 95 states and 133 transitions. Second operand 4 states. [2019-01-12 14:52:19,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:52:19,604 INFO L93 Difference]: Finished difference Result 269 states and 381 transitions. [2019-01-12 14:52:19,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 14:52:19,606 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-01-12 14:52:19,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:52:19,608 INFO L225 Difference]: With dead ends: 269 [2019-01-12 14:52:19,609 INFO L226 Difference]: Without dead ends: 181 [2019-01-12 14:52:19,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:52:19,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-01-12 14:52:19,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 99. [2019-01-12 14:52:19,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-12 14:52:19,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 137 transitions. [2019-01-12 14:52:19,634 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 137 transitions. Word has length 35 [2019-01-12 14:52:19,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:52:19,634 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 137 transitions. [2019-01-12 14:52:19,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 14:52:19,635 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 137 transitions. [2019-01-12 14:52:19,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-12 14:52:19,637 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:52:19,637 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:52:19,638 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:52:19,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:52:19,638 INFO L82 PathProgramCache]: Analyzing trace with hash 597433108, now seen corresponding path program 1 times [2019-01-12 14:52:19,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:52:19,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:52:19,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:19,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:52:19,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:19,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:52:19,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:52:19,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:52:19,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:52:19,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:52:19,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:52:19,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:52:19,842 INFO L87 Difference]: Start difference. First operand 99 states and 137 transitions. Second operand 5 states. [2019-01-12 14:52:20,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:52:20,131 INFO L93 Difference]: Finished difference Result 276 states and 384 transitions. [2019-01-12 14:52:20,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:52:20,134 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-01-12 14:52:20,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:52:20,136 INFO L225 Difference]: With dead ends: 276 [2019-01-12 14:52:20,136 INFO L226 Difference]: Without dead ends: 184 [2019-01-12 14:52:20,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 14:52:20,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-01-12 14:52:20,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 105. [2019-01-12 14:52:20,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-12 14:52:20,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 143 transitions. [2019-01-12 14:52:20,157 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 143 transitions. Word has length 35 [2019-01-12 14:52:20,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:52:20,158 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 143 transitions. [2019-01-12 14:52:20,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:52:20,158 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 143 transitions. [2019-01-12 14:52:20,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-12 14:52:20,160 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:52:20,160 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:52:20,160 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:52:20,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:52:20,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1434752496, now seen corresponding path program 1 times [2019-01-12 14:52:20,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:52:20,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:52:20,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:20,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:52:20,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:20,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:52:20,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:52:20,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:52:20,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:52:20,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:52:20,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:52:20,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:52:20,226 INFO L87 Difference]: Start difference. First operand 105 states and 143 transitions. Second operand 3 states. [2019-01-12 14:52:20,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:52:20,398 INFO L93 Difference]: Finished difference Result 249 states and 341 transitions. [2019-01-12 14:52:20,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:52:20,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-01-12 14:52:20,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:52:20,400 INFO L225 Difference]: With dead ends: 249 [2019-01-12 14:52:20,400 INFO L226 Difference]: Without dead ends: 151 [2019-01-12 14:52:20,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:52:20,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-01-12 14:52:20,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2019-01-12 14:52:20,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-01-12 14:52:20,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 202 transitions. [2019-01-12 14:52:20,426 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 202 transitions. Word has length 35 [2019-01-12 14:52:20,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:52:20,428 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 202 transitions. [2019-01-12 14:52:20,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:52:20,428 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 202 transitions. [2019-01-12 14:52:20,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-12 14:52:20,430 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:52:20,431 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:52:20,431 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:52:20,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:52:20,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1759410992, now seen corresponding path program 1 times [2019-01-12 14:52:20,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:52:20,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:52:20,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:20,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:52:20,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:20,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:52:20,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:52:20,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:52:20,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:52:20,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:52:20,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:52:20,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:52:20,525 INFO L87 Difference]: Start difference. First operand 151 states and 202 transitions. Second operand 3 states. [2019-01-12 14:52:20,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:52:20,650 INFO L93 Difference]: Finished difference Result 225 states and 302 transitions. [2019-01-12 14:52:20,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:52:20,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-01-12 14:52:20,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:52:20,654 INFO L225 Difference]: With dead ends: 225 [2019-01-12 14:52:20,654 INFO L226 Difference]: Without dead ends: 223 [2019-01-12 14:52:20,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:52:20,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-01-12 14:52:20,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 203. [2019-01-12 14:52:20,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-01-12 14:52:20,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 278 transitions. [2019-01-12 14:52:20,690 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 278 transitions. Word has length 36 [2019-01-12 14:52:20,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:52:20,693 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 278 transitions. [2019-01-12 14:52:20,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:52:20,693 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 278 transitions. [2019-01-12 14:52:20,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-12 14:52:20,695 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:52:20,695 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:52:20,702 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:52:20,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:52:20,703 INFO L82 PathProgramCache]: Analyzing trace with hash -321551471, now seen corresponding path program 1 times [2019-01-12 14:52:20,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:52:20,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:52:20,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:20,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:52:20,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:20,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:52:21,104 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:52:21,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:52:21,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 14:52:21,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 14:52:21,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 14:52:21,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 14:52:21,111 INFO L87 Difference]: Start difference. First operand 203 states and 278 transitions. Second operand 6 states. [2019-01-12 14:52:21,827 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-12 14:52:22,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:52:22,348 INFO L93 Difference]: Finished difference Result 1093 states and 1529 transitions. [2019-01-12 14:52:22,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 14:52:22,348 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-01-12 14:52:22,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:52:22,355 INFO L225 Difference]: With dead ends: 1093 [2019-01-12 14:52:22,356 INFO L226 Difference]: Without dead ends: 943 [2019-01-12 14:52:22,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-01-12 14:52:22,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2019-01-12 14:52:22,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 413. [2019-01-12 14:52:22,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-01-12 14:52:22,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 568 transitions. [2019-01-12 14:52:22,410 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 568 transitions. Word has length 60 [2019-01-12 14:52:22,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:52:22,411 INFO L480 AbstractCegarLoop]: Abstraction has 413 states and 568 transitions. [2019-01-12 14:52:22,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 14:52:22,411 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 568 transitions. [2019-01-12 14:52:22,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-12 14:52:22,412 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:52:22,412 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:52:22,413 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:52:22,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:52:22,413 INFO L82 PathProgramCache]: Analyzing trace with hash -63386033, now seen corresponding path program 1 times [2019-01-12 14:52:22,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:52:22,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:52:22,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:22,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:52:22,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:22,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:52:22,572 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-12 14:52:22,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:52:22,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:52:22,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:52:22,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:52:22,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:52:22,574 INFO L87 Difference]: Start difference. First operand 413 states and 568 transitions. Second operand 5 states. [2019-01-12 14:52:22,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:52:22,712 INFO L93 Difference]: Finished difference Result 811 states and 1108 transitions. [2019-01-12 14:52:22,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 14:52:22,713 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-01-12 14:52:22,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:52:22,716 INFO L225 Difference]: With dead ends: 811 [2019-01-12 14:52:22,716 INFO L226 Difference]: Without dead ends: 451 [2019-01-12 14:52:22,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 14:52:22,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-01-12 14:52:22,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 219. [2019-01-12 14:52:22,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-01-12 14:52:22,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 289 transitions. [2019-01-12 14:52:22,753 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 289 transitions. Word has length 60 [2019-01-12 14:52:22,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:52:22,753 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 289 transitions. [2019-01-12 14:52:22,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:52:22,754 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 289 transitions. [2019-01-12 14:52:22,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-12 14:52:22,755 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:52:22,757 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:52:22,757 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:52:22,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:52:22,757 INFO L82 PathProgramCache]: Analyzing trace with hash 804240128, now seen corresponding path program 1 times [2019-01-12 14:52:22,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:52:22,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:52:22,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:22,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:52:22,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:22,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:52:23,033 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:52:23,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:52:23,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:52:23,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:52:23,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:52:23,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:52:23,035 INFO L87 Difference]: Start difference. First operand 219 states and 289 transitions. Second operand 5 states. [2019-01-12 14:52:23,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:52:23,642 INFO L93 Difference]: Finished difference Result 382 states and 508 transitions. [2019-01-12 14:52:23,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 14:52:23,643 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-01-12 14:52:23,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:52:23,645 INFO L225 Difference]: With dead ends: 382 [2019-01-12 14:52:23,645 INFO L226 Difference]: Without dead ends: 216 [2019-01-12 14:52:23,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 14:52:23,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-01-12 14:52:23,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 212. [2019-01-12 14:52:23,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-01-12 14:52:23,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 275 transitions. [2019-01-12 14:52:23,685 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 275 transitions. Word has length 63 [2019-01-12 14:52:23,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:52:23,685 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 275 transitions. [2019-01-12 14:52:23,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:52:23,685 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 275 transitions. [2019-01-12 14:52:23,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-12 14:52:23,688 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:52:23,688 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:52:23,688 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:52:23,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:52:23,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1296994022, now seen corresponding path program 1 times [2019-01-12 14:52:23,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:52:23,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:52:23,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:23,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:52:23,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:23,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:52:23,774 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-12 14:52:23,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:52:23,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:52:23,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:52:23,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:52:23,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:52:23,776 INFO L87 Difference]: Start difference. First operand 212 states and 275 transitions. Second operand 3 states. [2019-01-12 14:52:23,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:52:23,871 INFO L93 Difference]: Finished difference Result 404 states and 525 transitions. [2019-01-12 14:52:23,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:52:23,877 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-01-12 14:52:23,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:52:23,877 INFO L225 Difference]: With dead ends: 404 [2019-01-12 14:52:23,877 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 14:52:23,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:52:23,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 14:52:23,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 14:52:23,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 14:52:23,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 14:52:23,880 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2019-01-12 14:52:23,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:52:23,881 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 14:52:23,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:52:23,881 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 14:52:23,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 14:52:23,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 14:52:24,020 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 118 [2019-01-12 14:52:24,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:24,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:24,289 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 126 [2019-01-12 14:52:24,476 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 117 [2019-01-12 14:52:24,622 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 70 [2019-01-12 14:52:24,803 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 110 [2019-01-12 14:52:24,940 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 118 [2019-01-12 14:52:25,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:25,102 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 118 [2019-01-12 14:52:25,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:25,268 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 127 [2019-01-12 14:52:26,748 WARN L181 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 118 DAG size of output: 28 [2019-01-12 14:52:27,217 WARN L181 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 30 [2019-01-12 14:52:27,434 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 31 [2019-01-12 14:52:27,963 WARN L181 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 31 [2019-01-12 14:52:28,734 WARN L181 SmtUtils]: Spent 617.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 28 [2019-01-12 14:52:29,089 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 22 [2019-01-12 14:52:29,213 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 22 [2019-01-12 14:52:29,654 WARN L181 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 26 [2019-01-12 14:52:30,148 WARN L181 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 28 [2019-01-12 14:52:30,613 WARN L181 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 26 [2019-01-12 14:52:30,865 WARN L181 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 29 [2019-01-12 14:52:31,386 WARN L181 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 31 [2019-01-12 14:52:31,390 INFO L444 ceAbstractionStarter]: At program point L68-3(lines 67 86) the Hoare annotation is: false [2019-01-12 14:52:31,390 INFO L444 ceAbstractionStarter]: At program point L367(lines 362 369) the Hoare annotation is: (and (= ULTIMATE.start_main_~tmp~7 ~systemActive~0) (= ~methAndRunningLastTime~0 0) (= ULTIMATE.start_main_~tmp~7 1) (= ~waterLevel~0 1) (= |ULTIMATE.start_valid_product_#res| ~systemActive~0) (= ~pumpRunning~0 0)) [2019-01-12 14:52:31,391 INFO L448 ceAbstractionStarter]: For program point L334(lines 334 347) no Hoare annotation was computed. [2019-01-12 14:52:31,391 INFO L448 ceAbstractionStarter]: For program point L104(lines 104 112) no Hoare annotation was computed. [2019-01-12 14:52:31,391 INFO L448 ceAbstractionStarter]: For program point L104-1(lines 104 112) no Hoare annotation was computed. [2019-01-12 14:52:31,391 INFO L448 ceAbstractionStarter]: For program point L104-2(lines 104 112) no Hoare annotation was computed. [2019-01-12 14:52:31,391 INFO L448 ceAbstractionStarter]: For program point L104-3(lines 104 112) no Hoare annotation was computed. [2019-01-12 14:52:31,391 INFO L448 ceAbstractionStarter]: For program point L104-4(lines 104 112) no Hoare annotation was computed. [2019-01-12 14:52:31,391 INFO L448 ceAbstractionStarter]: For program point L104-5(lines 104 112) no Hoare annotation was computed. [2019-01-12 14:52:31,391 INFO L444 ceAbstractionStarter]: At program point L271(lines 256 274) the Hoare annotation is: (and (= |ULTIMATE.start_valid_product_#res| 1) (not (= 0 ~pumpRunning~0)) (= ULTIMATE.start_main_~tmp~7 1) (= 0 |ULTIMATE.start_isLowWaterSensorDry_#res|) (= ULTIMATE.start_test_~splverifierCounter~0 0) (= 1 |ULTIMATE.start_isLowWaterLevel_#res|) (= 1 ULTIMATE.start_isLowWaterLevel_~tmp___0~1) (<= 1 ~waterLevel~0) (= ULTIMATE.start_isLowWaterLevel_~tmp~4 0) (not (= 0 ~systemActive~0))) [2019-01-12 14:52:31,391 INFO L444 ceAbstractionStarter]: At program point L271-1(lines 256 274) the Hoare annotation is: false [2019-01-12 14:52:31,392 INFO L444 ceAbstractionStarter]: At program point L271-2(lines 256 274) the Hoare annotation is: false [2019-01-12 14:52:31,392 INFO L448 ceAbstractionStarter]: For program point L932(lines 932 936) no Hoare annotation was computed. [2019-01-12 14:52:31,392 INFO L448 ceAbstractionStarter]: For program point L305(lines 304 351) no Hoare annotation was computed. [2019-01-12 14:52:31,392 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 310) no Hoare annotation was computed. [2019-01-12 14:52:31,392 INFO L444 ceAbstractionStarter]: At program point L75(lines 75 81) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse1 (= ULTIMATE.start_main_~tmp~7 1)) (.cse2 (= ULTIMATE.start_test_~splverifierCounter~0 0))) (or (and .cse0 .cse1 (and (and .cse2 (= ~pumpRunning~0 0)) (<= 1 ~waterLevel~0))) (and .cse0 .cse1 (and (and .cse2 (not (= 0 ~systemActive~0))) (= ~methAndRunningLastTime~0 0) (<= 2 ~waterLevel~0))))) [2019-01-12 14:52:31,392 INFO L444 ceAbstractionStarter]: At program point L75-1(lines 75 81) the Hoare annotation is: false [2019-01-12 14:52:31,392 INFO L444 ceAbstractionStarter]: At program point L75-2(lines 75 81) the Hoare annotation is: false [2019-01-12 14:52:31,393 INFO L444 ceAbstractionStarter]: At program point L1000(lines 995 1003) the Hoare annotation is: (and (= |ULTIMATE.start_valid_product_#res| 1) (not (= 0 ~pumpRunning~0)) (= ULTIMATE.start_main_~tmp~7 1) (= 0 |ULTIMATE.start_isLowWaterSensorDry_#res|) (= ULTIMATE.start_test_~splverifierCounter~0 0) (<= 1 ~waterLevel~0) (not (= 0 ~systemActive~0))) [2019-01-12 14:52:31,393 INFO L444 ceAbstractionStarter]: At program point L1000-1(lines 995 1003) the Hoare annotation is: false [2019-01-12 14:52:31,393 INFO L444 ceAbstractionStarter]: At program point L1000-2(lines 995 1003) the Hoare annotation is: false [2019-01-12 14:52:31,393 INFO L448 ceAbstractionStarter]: For program point L340(lines 340 346) no Hoare annotation was computed. [2019-01-12 14:52:31,393 INFO L444 ceAbstractionStarter]: At program point L340-1(lines 68 74) the Hoare annotation is: (let ((.cse4 (= ULTIMATE.start_test_~splverifierCounter~0 0))) (let ((.cse3 (and .cse4 (= ~pumpRunning~0 0))) (.cse0 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse1 (= ULTIMATE.start_main_~tmp~7 1)) (.cse2 (<= 2 ~waterLevel~0))) (or (and .cse0 (= ~systemActive~0 0) .cse1 (and .cse2 .cse3)) (and .cse0 .cse1 (and (= ~methAndRunningLastTime~0 0) (<= 1 ~waterLevel~0) .cse3)) (and .cse0 (not (= 0 ~pumpRunning~0)) .cse1 (and (and .cse4 (not (= 0 ~systemActive~0))) .cse2))))) [2019-01-12 14:52:31,393 INFO L448 ceAbstractionStarter]: For program point L44(line 44) no Hoare annotation was computed. [2019-01-12 14:52:31,393 INFO L448 ceAbstractionStarter]: For program point L44-1(line 44) no Hoare annotation was computed. [2019-01-12 14:52:31,393 INFO L448 ceAbstractionStarter]: For program point L44-2(line 44) no Hoare annotation was computed. [2019-01-12 14:52:31,394 INFO L448 ceAbstractionStarter]: For program point L378(lines 378 395) no Hoare annotation was computed. [2019-01-12 14:52:31,394 INFO L444 ceAbstractionStarter]: At program point L378-1(lines 1 1003) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse1 (= ULTIMATE.start_main_~tmp~7 1)) (.cse2 (= ULTIMATE.start_test_~splverifierCounter~0 0))) (or (and .cse0 (not (= 0 ~pumpRunning~0)) .cse1 (and (and .cse2 (not (= 0 ~systemActive~0))) (<= 2 ~waterLevel~0))) (and .cse0 .cse1 (and (= ~methAndRunningLastTime~0 0) (and .cse2 (= ~pumpRunning~0 0)) (<= 1 ~waterLevel~0))))) [2019-01-12 14:52:31,394 INFO L444 ceAbstractionStarter]: At program point L411-2(lines 411 425) the Hoare annotation is: false [2019-01-12 14:52:31,394 INFO L448 ceAbstractionStarter]: For program point L378-2(lines 378 395) no Hoare annotation was computed. [2019-01-12 14:52:31,394 INFO L448 ceAbstractionStarter]: For program point L279(lines 279 285) no Hoare annotation was computed. [2019-01-12 14:52:31,394 INFO L444 ceAbstractionStarter]: At program point L378-3(lines 1 1003) the Hoare annotation is: false [2019-01-12 14:52:31,394 INFO L444 ceAbstractionStarter]: At program point L279-1(lines 279 285) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse2 (= ULTIMATE.start_main_~tmp~7 1)) (.cse0 (and (= ULTIMATE.start_test_~splverifierCounter~0 0) (= ~pumpRunning~0 0)))) (or (and (and .cse0 (= ~methAndRunningLastTime~0 0) (<= 1 ~waterLevel~0)) .cse1 .cse2) (and .cse1 .cse2 (and .cse0 (<= 2 ~waterLevel~0))))) [2019-01-12 14:52:31,394 INFO L448 ceAbstractionStarter]: For program point L246(lines 246 250) no Hoare annotation was computed. [2019-01-12 14:52:31,394 INFO L448 ceAbstractionStarter]: For program point L378-4(lines 378 395) no Hoare annotation was computed. [2019-01-12 14:52:31,395 INFO L444 ceAbstractionStarter]: At program point L378-5(lines 1 1003) the Hoare annotation is: false [2019-01-12 14:52:31,395 INFO L448 ceAbstractionStarter]: For program point L246-2(lines 246 250) no Hoare annotation was computed. [2019-01-12 14:52:31,395 INFO L448 ceAbstractionStarter]: For program point L246-3(lines 246 250) no Hoare annotation was computed. [2019-01-12 14:52:31,395 INFO L448 ceAbstractionStarter]: For program point L246-5(lines 246 250) no Hoare annotation was computed. [2019-01-12 14:52:31,395 INFO L448 ceAbstractionStarter]: For program point L246-6(lines 246 250) no Hoare annotation was computed. [2019-01-12 14:52:31,395 INFO L448 ceAbstractionStarter]: For program point L246-8(lines 246 250) no Hoare annotation was computed. [2019-01-12 14:52:31,395 INFO L448 ceAbstractionStarter]: For program point L246-9(lines 246 250) no Hoare annotation was computed. [2019-01-12 14:52:31,395 INFO L448 ceAbstractionStarter]: For program point L246-11(lines 246 250) no Hoare annotation was computed. [2019-01-12 14:52:31,395 INFO L448 ceAbstractionStarter]: For program point L246-12(lines 246 250) no Hoare annotation was computed. [2019-01-12 14:52:31,395 INFO L448 ceAbstractionStarter]: For program point L246-14(lines 246 250) no Hoare annotation was computed. [2019-01-12 14:52:31,395 INFO L448 ceAbstractionStarter]: For program point L246-15(lines 246 250) no Hoare annotation was computed. [2019-01-12 14:52:31,396 INFO L448 ceAbstractionStarter]: For program point L246-17(lines 246 250) no Hoare annotation was computed. [2019-01-12 14:52:31,396 INFO L448 ceAbstractionStarter]: For program point L412(line 412) no Hoare annotation was computed. [2019-01-12 14:52:31,396 INFO L448 ceAbstractionStarter]: For program point L908(lines 908 912) no Hoare annotation was computed. [2019-01-12 14:52:31,396 INFO L448 ceAbstractionStarter]: For program point L908-3(lines 908 912) no Hoare annotation was computed. [2019-01-12 14:52:31,396 INFO L448 ceAbstractionStarter]: For program point L908-6(lines 908 912) no Hoare annotation was computed. [2019-01-12 14:52:31,396 INFO L448 ceAbstractionStarter]: For program point L314(lines 314 320) no Hoare annotation was computed. [2019-01-12 14:52:31,396 INFO L444 ceAbstractionStarter]: At program point L314-1(lines 314 320) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse1 (= ULTIMATE.start_main_~tmp~7 1)) (.cse2 (= ULTIMATE.start_test_~splverifierCounter~0 0))) (or (and .cse0 (not (= 0 ~pumpRunning~0)) .cse1 (and (and .cse2 (not (= 0 ~systemActive~0))) (<= 2 ~waterLevel~0))) (and .cse0 .cse1 (and (= ~methAndRunningLastTime~0 0) (and .cse2 (= ~pumpRunning~0 0)) (<= 1 ~waterLevel~0))))) [2019-01-12 14:52:31,396 INFO L448 ceAbstractionStarter]: For program point L415(lines 415 419) no Hoare annotation was computed. [2019-01-12 14:52:31,396 INFO L448 ceAbstractionStarter]: For program point L382(lines 382 392) no Hoare annotation was computed. [2019-01-12 14:52:31,397 INFO L448 ceAbstractionStarter]: For program point L415-1(lines 68 74) no Hoare annotation was computed. [2019-01-12 14:52:31,397 INFO L448 ceAbstractionStarter]: For program point L382-2(lines 382 392) no Hoare annotation was computed. [2019-01-12 14:52:31,397 INFO L448 ceAbstractionStarter]: For program point L382-4(lines 382 392) no Hoare annotation was computed. [2019-01-12 14:52:31,397 INFO L448 ceAbstractionStarter]: For program point L383(lines 383 389) no Hoare annotation was computed. [2019-01-12 14:52:31,397 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 14:52:31,397 INFO L448 ceAbstractionStarter]: For program point L383-2(lines 383 389) no Hoare annotation was computed. [2019-01-12 14:52:31,397 INFO L448 ceAbstractionStarter]: For program point L383-4(lines 383 389) no Hoare annotation was computed. [2019-01-12 14:52:31,397 INFO L444 ceAbstractionStarter]: At program point L945(lines 940 948) the Hoare annotation is: false [2019-01-12 14:52:31,397 INFO L444 ceAbstractionStarter]: At program point L945-1(lines 940 948) the Hoare annotation is: (and (= |ULTIMATE.start_valid_product_#res| 1) (= ~methAndRunningLastTime~0 0) (= ULTIMATE.start_main_~tmp~7 1) (<= 2 ~waterLevel~0) (= ULTIMATE.start_test_~splverifierCounter~0 0) (= ~pumpRunning~0 0) (not (= 0 ~systemActive~0))) [2019-01-12 14:52:31,398 INFO L444 ceAbstractionStarter]: At program point L945-2(lines 940 948) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse1 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse2 (= ULTIMATE.start_main_~tmp~7 1))) (or (and .cse0 (and (= ~methAndRunningLastTime~0 0) (and .cse1 (not (= 0 ~systemActive~0))) (<= 2 ~waterLevel~0)) .cse2) (and .cse0 (and (<= 1 ~waterLevel~0) (and .cse1 (= ~pumpRunning~0 0))) .cse2))) [2019-01-12 14:52:31,398 INFO L444 ceAbstractionStarter]: At program point L945-3(lines 940 948) the Hoare annotation is: false [2019-01-12 14:52:31,398 INFO L444 ceAbstractionStarter]: At program point L945-4(lines 940 948) the Hoare annotation is: false [2019-01-12 14:52:31,398 INFO L444 ceAbstractionStarter]: At program point L945-5(lines 940 948) the Hoare annotation is: false [2019-01-12 14:52:31,398 INFO L444 ceAbstractionStarter]: At program point L945-6(lines 940 948) the Hoare annotation is: false [2019-01-12 14:52:31,398 INFO L444 ceAbstractionStarter]: At program point L945-7(lines 940 948) the Hoare annotation is: false [2019-01-12 14:52:31,398 INFO L444 ceAbstractionStarter]: At program point L945-8(lines 940 948) the Hoare annotation is: false [2019-01-12 14:52:31,398 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 44) no Hoare annotation was computed. [2019-01-12 14:52:31,399 INFO L444 ceAbstractionStarter]: At program point L252(lines 237 255) the Hoare annotation is: false [2019-01-12 14:52:31,399 INFO L444 ceAbstractionStarter]: At program point L252-1(lines 237 255) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse1 (= ULTIMATE.start_main_~tmp~7 1)) (.cse2 (and (and (= ULTIMATE.start_test_~splverifierCounter~0 0) (not (= 0 ~systemActive~0))) (= ~pumpRunning~0 0)))) (or (and .cse0 .cse1 (and (and (= 0 |ULTIMATE.start_isHighWaterLevel_#res|) .cse2 (= 0 ULTIMATE.start_isHighWaterLevel_~tmp___0~0)) (<= 1 ~waterLevel~0))) (and .cse0 .cse1 (and (= ~methAndRunningLastTime~0 0) (<= 2 ~waterLevel~0) .cse2)))) [2019-01-12 14:52:31,399 INFO L444 ceAbstractionStarter]: At program point L252-2(lines 237 255) the Hoare annotation is: false [2019-01-12 14:52:31,399 INFO L444 ceAbstractionStarter]: At program point L252-3(lines 237 255) the Hoare annotation is: false [2019-01-12 14:52:31,399 INFO L444 ceAbstractionStarter]: At program point L252-4(lines 237 255) the Hoare annotation is: false [2019-01-12 14:52:31,399 INFO L444 ceAbstractionStarter]: At program point L252-5(lines 237 255) the Hoare annotation is: false [2019-01-12 14:52:31,399 INFO L444 ceAbstractionStarter]: At program point L352(lines 303 353) the Hoare annotation is: false [2019-01-12 14:52:31,399 INFO L444 ceAbstractionStarter]: At program point L188(lines 181 191) the Hoare annotation is: false [2019-01-12 14:52:31,399 INFO L444 ceAbstractionStarter]: At program point L188-1(lines 181 191) the Hoare annotation is: (and (= |ULTIMATE.start_valid_product_#res| 1) (= ~methAndRunningLastTime~0 0) (= ULTIMATE.start_main_~tmp~7 1) (<= 2 ~waterLevel~0) (= ULTIMATE.start_test_~splverifierCounter~0 0) (= ~pumpRunning~0 0) (not (= 0 ~systemActive~0))) [2019-01-12 14:52:31,399 INFO L444 ceAbstractionStarter]: At program point L188-2(lines 181 191) the Hoare annotation is: false [2019-01-12 14:52:31,400 INFO L444 ceAbstractionStarter]: At program point L188-3(lines 181 191) the Hoare annotation is: false [2019-01-12 14:52:31,400 INFO L444 ceAbstractionStarter]: At program point L188-4(lines 181 191) the Hoare annotation is: false [2019-01-12 14:52:31,400 INFO L444 ceAbstractionStarter]: At program point L188-5(lines 181 191) the Hoare annotation is: false [2019-01-12 14:52:31,400 INFO L448 ceAbstractionStarter]: For program point L486(lines 486 493) no Hoare annotation was computed. [2019-01-12 14:52:31,400 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 44) no Hoare annotation was computed. [2019-01-12 14:52:31,400 INFO L451 ceAbstractionStarter]: At program point L486-1(lines 486 493) the Hoare annotation is: true [2019-01-12 14:52:31,400 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 14:52:31,400 INFO L444 ceAbstractionStarter]: At program point L522(lines 1 1003) the Hoare annotation is: (and (= 1 ~systemActive~0) (= ~methAndRunningLastTime~0 0) (= ~waterLevel~0 1) (= ~pumpRunning~0 0)) [2019-01-12 14:52:31,400 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 330) no Hoare annotation was computed. [2019-01-12 14:52:31,401 INFO L444 ceAbstractionStarter]: At program point L324-1(lines 324 330) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse1 (= ULTIMATE.start_main_~tmp~7 1)) (.cse2 (= ULTIMATE.start_test_~splverifierCounter~0 0))) (or (and .cse0 (not (= 0 ~pumpRunning~0)) .cse1 (and (and .cse2 (not (= 0 ~systemActive~0))) (<= 2 ~waterLevel~0))) (and .cse0 .cse1 (and (= ~methAndRunningLastTime~0 0) (and .cse2 (= ~pumpRunning~0 0)) (<= 1 ~waterLevel~0))))) [2019-01-12 14:52:31,401 INFO L448 ceAbstractionStarter]: For program point L126(lines 126 143) no Hoare annotation was computed. [2019-01-12 14:52:31,401 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 126 143) no Hoare annotation was computed. [2019-01-12 14:52:31,401 INFO L448 ceAbstractionStarter]: For program point L126-2(lines 126 143) no Hoare annotation was computed. [2019-01-12 14:52:31,401 INFO L448 ceAbstractionStarter]: For program point L985(lines 985 991) no Hoare annotation was computed. [2019-01-12 14:52:31,401 INFO L448 ceAbstractionStarter]: For program point L985-1(lines 985 991) no Hoare annotation was computed. [2019-01-12 14:52:31,401 INFO L448 ceAbstractionStarter]: For program point L985-2(lines 985 991) no Hoare annotation was computed. [2019-01-12 14:52:31,401 INFO L448 ceAbstractionStarter]: For program point L985-3(lines 985 991) no Hoare annotation was computed. [2019-01-12 14:52:31,401 INFO L448 ceAbstractionStarter]: For program point L985-4(lines 985 991) no Hoare annotation was computed. [2019-01-12 14:52:31,401 INFO L448 ceAbstractionStarter]: For program point L985-5(lines 985 991) no Hoare annotation was computed. [2019-01-12 14:52:31,401 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 14:52:31,401 INFO L448 ceAbstractionStarter]: For program point L920(lines 920 924) no Hoare annotation was computed. [2019-01-12 14:52:31,402 INFO L444 ceAbstractionStarter]: At program point L459(lines 455 461) the Hoare annotation is: (and (= ULTIMATE.start_main_~tmp~7 ~systemActive~0) (= ~methAndRunningLastTime~0 0) (= ULTIMATE.start_main_~tmp~7 1) (= ~waterLevel~0 1) (= |ULTIMATE.start_valid_product_#res| ~systemActive~0) (= ~pumpRunning~0 0)) [2019-01-12 14:52:31,402 INFO L448 ceAbstractionStarter]: For program point L163(lines 163 169) no Hoare annotation was computed. [2019-01-12 14:52:31,402 INFO L448 ceAbstractionStarter]: For program point L130(lines 130 138) no Hoare annotation was computed. [2019-01-12 14:52:31,402 INFO L448 ceAbstractionStarter]: For program point L163-2(lines 163 169) no Hoare annotation was computed. [2019-01-12 14:52:31,402 INFO L448 ceAbstractionStarter]: For program point L130-1(lines 130 138) no Hoare annotation was computed. [2019-01-12 14:52:31,402 INFO L448 ceAbstractionStarter]: For program point L130-2(lines 130 138) no Hoare annotation was computed. [2019-01-12 14:52:31,402 INFO L448 ceAbstractionStarter]: For program point L163-4(lines 163 169) no Hoare annotation was computed. [2019-01-12 14:52:31,402 INFO L448 ceAbstractionStarter]: For program point L163-6(lines 163 169) no Hoare annotation was computed. [2019-01-12 14:52:31,402 INFO L448 ceAbstractionStarter]: For program point L163-8(lines 163 169) no Hoare annotation was computed. [2019-01-12 14:52:31,402 INFO L448 ceAbstractionStarter]: For program point L163-10(lines 163 169) no Hoare annotation was computed. [2019-01-12 14:52:31,403 INFO L444 ceAbstractionStarter]: At program point L197(lines 192 200) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse1 (= ULTIMATE.start_main_~tmp~7 1)) (.cse2 (= ULTIMATE.start_test_~splverifierCounter~0 0))) (or (and .cse0 (not (= 0 ~pumpRunning~0)) .cse1 (and (= ~methAndRunningLastTime~0 0) (<= 2 ~waterLevel~0) (and .cse2 (not (= 0 ~systemActive~0))))) (and .cse0 .cse1 (and (and (= 0 |ULTIMATE.start_isPumpRunning_#res|) .cse2 (= ~pumpRunning~0 0)) (<= 1 ~waterLevel~0))))) [2019-01-12 14:52:31,403 INFO L444 ceAbstractionStarter]: At program point L197-1(lines 192 200) the Hoare annotation is: false [2019-01-12 14:52:31,403 INFO L444 ceAbstractionStarter]: At program point L197-2(lines 192 200) the Hoare annotation is: false [2019-01-12 14:52:31,403 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 14:52:31,403 INFO L444 ceAbstractionStarter]: At program point L990(lines 981 994) the Hoare annotation is: false [2019-01-12 14:52:31,403 INFO L444 ceAbstractionStarter]: At program point L990-1(lines 981 994) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse0 (and (and (= ULTIMATE.start_test_~splverifierCounter~0 0) (not (= 0 ~systemActive~0))) (= ~pumpRunning~0 0))) (.cse2 (= ULTIMATE.start_main_~tmp~7 1))) (or (and (and (= ~methAndRunningLastTime~0 0) (<= 2 ~waterLevel~0) .cse0) .cse1 .cse2) (and .cse1 (and (and (= 1 |ULTIMATE.start_isHighWaterSensorDry_#res|) .cse0) (<= 1 ~waterLevel~0)) .cse2))) [2019-01-12 14:52:31,403 INFO L444 ceAbstractionStarter]: At program point L990-2(lines 981 994) the Hoare annotation is: false [2019-01-12 14:52:31,403 INFO L444 ceAbstractionStarter]: At program point L990-3(lines 981 994) the Hoare annotation is: false [2019-01-12 14:52:31,403 INFO L444 ceAbstractionStarter]: At program point L990-4(lines 981 994) the Hoare annotation is: false [2019-01-12 14:52:31,404 INFO L444 ceAbstractionStarter]: At program point L990-5(lines 981 994) the Hoare annotation is: false [2019-01-12 14:52:31,404 INFO L451 ceAbstractionStarter]: At program point L495(lines 476 498) the Hoare annotation is: true [2019-01-12 14:52:31,404 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 269) no Hoare annotation was computed. [2019-01-12 14:52:31,404 INFO L448 ceAbstractionStarter]: For program point L265-2(lines 265 269) no Hoare annotation was computed. [2019-01-12 14:52:31,404 INFO L448 ceAbstractionStarter]: For program point L265-3(lines 265 269) no Hoare annotation was computed. [2019-01-12 14:52:31,404 INFO L448 ceAbstractionStarter]: For program point L100(lines 100 117) no Hoare annotation was computed. [2019-01-12 14:52:31,404 INFO L448 ceAbstractionStarter]: For program point L265-5(lines 265 269) no Hoare annotation was computed. [2019-01-12 14:52:31,404 INFO L448 ceAbstractionStarter]: For program point L100-1(lines 100 117) no Hoare annotation was computed. [2019-01-12 14:52:31,404 INFO L448 ceAbstractionStarter]: For program point L265-6(lines 265 269) no Hoare annotation was computed. [2019-01-12 14:52:31,404 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 44) no Hoare annotation was computed. [2019-01-12 14:52:31,405 INFO L448 ceAbstractionStarter]: For program point L100-2(lines 100 117) no Hoare annotation was computed. [2019-01-12 14:52:31,405 INFO L448 ceAbstractionStarter]: For program point L100-3(lines 100 117) no Hoare annotation was computed. [2019-01-12 14:52:31,405 INFO L448 ceAbstractionStarter]: For program point L265-8(lines 265 269) no Hoare annotation was computed. [2019-01-12 14:52:31,405 INFO L448 ceAbstractionStarter]: For program point L100-4(lines 100 117) no Hoare annotation was computed. [2019-01-12 14:52:31,405 INFO L448 ceAbstractionStarter]: For program point L100-5(lines 100 117) no Hoare annotation was computed. [2019-01-12 14:52:31,405 INFO L444 ceAbstractionStarter]: At program point L530(lines 525 533) the Hoare annotation is: (and (= 1 ~systemActive~0) (= ~methAndRunningLastTime~0 0) (= ~waterLevel~0 1) (= |ULTIMATE.start_valid_product_#res| ~systemActive~0) (= ~pumpRunning~0 0)) [2019-01-12 14:52:31,405 INFO L444 ceAbstractionStarter]: At program point L68(lines 67 86) the Hoare annotation is: (let ((.cse4 (= ULTIMATE.start_test_~splverifierCounter~0 0))) (let ((.cse2 (and .cse4 (= ~pumpRunning~0 0))) (.cse0 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse3 (<= 1 ~waterLevel~0)) (.cse1 (= ULTIMATE.start_main_~tmp~7 1))) (or (and .cse0 (= ~systemActive~0 0) .cse1 (and (<= 2 ~waterLevel~0) .cse2)) (and .cse0 .cse1 (and (= ~methAndRunningLastTime~0 0) .cse3 .cse2)) (and .cse0 (and (and .cse4 (not (= 0 ~systemActive~0))) .cse3) (not (= 0 ~pumpRunning~0)) .cse1)))) [2019-01-12 14:52:31,405 INFO L448 ceAbstractionStarter]: For program point L68-1(lines 68 74) no Hoare annotation was computed. [2019-01-12 14:52:31,405 INFO L444 ceAbstractionStarter]: At program point L68-2(lines 67 86) the Hoare annotation is: false [2019-01-12 14:52:31,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 02:52:31 BoogieIcfgContainer [2019-01-12 14:52:31,453 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 14:52:31,454 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 14:52:31,454 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 14:52:31,454 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 14:52:31,455 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:52:16" (3/4) ... [2019-01-12 14:52:31,460 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 14:52:31,487 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 38 nodes and edges [2019-01-12 14:52:31,491 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2019-01-12 14:52:31,492 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-01-12 14:52:31,493 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-12 14:52:31,496 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 14:52:31,497 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-12 14:52:31,534 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 == systemActive && methAndRunningLastTime == 0) && waterLevel == 1) && \result == systemActive) && pumpRunning == 0 [2019-01-12 14:52:31,535 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((tmp == systemActive && methAndRunningLastTime == 0) && tmp == 1) && waterLevel == 1) && \result == systemActive) && pumpRunning == 0 [2019-01-12 14:52:31,535 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((tmp == systemActive && methAndRunningLastTime == 0) && tmp == 1) && waterLevel == 1) && \result == systemActive) && pumpRunning == 0 [2019-01-12 14:52:31,535 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 1 && !(0 == pumpRunning)) && tmp == 1) && (splverifierCounter == 0 && !(0 == systemActive)) && 2 <= waterLevel) || ((\result == 1 && tmp == 1) && (methAndRunningLastTime == 0 && splverifierCounter == 0 && pumpRunning == 0) && 1 <= waterLevel) [2019-01-12 14:52:31,536 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 1 && !(0 == pumpRunning)) && tmp == 1) && (splverifierCounter == 0 && !(0 == systemActive)) && 2 <= waterLevel) || ((\result == 1 && tmp == 1) && (methAndRunningLastTime == 0 && splverifierCounter == 0 && pumpRunning == 0) && 1 <= waterLevel) [2019-01-12 14:52:31,538 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 1 && !(0 == pumpRunning)) && tmp == 1) && (splverifierCounter == 0 && !(0 == systemActive)) && 2 <= waterLevel) || ((\result == 1 && tmp == 1) && (methAndRunningLastTime == 0 && splverifierCounter == 0 && pumpRunning == 0) && 1 <= waterLevel) [2019-01-12 14:52:31,539 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\result == 1 && systemActive == 0) && tmp == 1) && 2 <= waterLevel && splverifierCounter == 0 && pumpRunning == 0) || ((\result == 1 && tmp == 1) && (methAndRunningLastTime == 0 && 1 <= waterLevel) && splverifierCounter == 0 && pumpRunning == 0)) || (((\result == 1 && !(0 == pumpRunning)) && tmp == 1) && (splverifierCounter == 0 && !(0 == systemActive)) && 2 <= waterLevel) [2019-01-12 14:52:31,540 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\result == 1 && systemActive == 0) && tmp == 1) && 2 <= waterLevel && splverifierCounter == 0 && pumpRunning == 0) || ((\result == 1 && tmp == 1) && (methAndRunningLastTime == 0 && 1 <= waterLevel) && splverifierCounter == 0 && pumpRunning == 0)) || (((\result == 1 && (splverifierCounter == 0 && !(0 == systemActive)) && 1 <= waterLevel) && !(0 == pumpRunning)) && tmp == 1) [2019-01-12 14:52:31,540 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\result == 1 && tmp == 1) && (splverifierCounter == 0 && pumpRunning == 0) && 1 <= waterLevel) || ((\result == 1 && tmp == 1) && ((splverifierCounter == 0 && !(0 == systemActive)) && methAndRunningLastTime == 0) && 2 <= waterLevel) [2019-01-12 14:52:31,540 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((splverifierCounter == 0 && pumpRunning == 0) && methAndRunningLastTime == 0) && 1 <= waterLevel) && \result == 1) && tmp == 1) || ((\result == 1 && tmp == 1) && (splverifierCounter == 0 && pumpRunning == 0) && 2 <= waterLevel) [2019-01-12 14:52:31,544 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\result == 1 && (methAndRunningLastTime == 0 && splverifierCounter == 0 && !(0 == systemActive)) && 2 <= waterLevel) && tmp == 1) || ((\result == 1 && 1 <= waterLevel && splverifierCounter == 0 && pumpRunning == 0) && tmp == 1) [2019-01-12 14:52:31,545 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\result == 1 && !(0 == pumpRunning)) && tmp == 1) && 0 == \result) && splverifierCounter == 0) && 1 <= waterLevel) && !(0 == systemActive) [2019-01-12 14:52:31,545 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((methAndRunningLastTime == 0 && 2 <= waterLevel) && (splverifierCounter == 0 && !(0 == systemActive)) && pumpRunning == 0) && \result == 1) && tmp == 1) || ((\result == 1 && (1 == \result && (splverifierCounter == 0 && !(0 == systemActive)) && pumpRunning == 0) && 1 <= waterLevel) && tmp == 1) [2019-01-12 14:52:31,546 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 1 && !(0 == pumpRunning)) && tmp == 1) && (methAndRunningLastTime == 0 && 2 <= waterLevel) && splverifierCounter == 0 && !(0 == systemActive)) || ((\result == 1 && tmp == 1) && ((0 == \result && splverifierCounter == 0) && pumpRunning == 0) && 1 <= waterLevel) [2019-01-12 14:52:31,546 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((\result == 1 && !(0 == pumpRunning)) && tmp == 1) && 0 == \result) && splverifierCounter == 0) && 1 == \result) && 1 == tmp___0) && 1 <= waterLevel) && tmp == 0) && !(0 == systemActive) [2019-01-12 14:52:31,549 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\result == 1 && tmp == 1) && ((0 == \result && (splverifierCounter == 0 && !(0 == systemActive)) && pumpRunning == 0) && 0 == tmp___0) && 1 <= waterLevel) || ((\result == 1 && tmp == 1) && (methAndRunningLastTime == 0 && 2 <= waterLevel) && (splverifierCounter == 0 && !(0 == systemActive)) && pumpRunning == 0) [2019-01-12 14:52:31,551 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\result == 1 && methAndRunningLastTime == 0) && tmp == 1) && 2 <= waterLevel) && splverifierCounter == 0) && pumpRunning == 0) && !(0 == systemActive) [2019-01-12 14:52:31,552 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\result == 1 && methAndRunningLastTime == 0) && tmp == 1) && 2 <= waterLevel) && splverifierCounter == 0) && pumpRunning == 0) && !(0 == systemActive) [2019-01-12 14:52:31,673 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 14:52:31,673 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 14:52:31,674 INFO L168 Benchmark]: Toolchain (without parser) took 17363.65 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 333.4 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -104.3 MB). Peak memory consumption was 229.1 MB. Max. memory is 11.5 GB. [2019-01-12 14:52:31,676 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:52:31,676 INFO L168 Benchmark]: CACSL2BoogieTranslator took 661.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -176.7 MB). Peak memory consumption was 37.4 MB. Max. memory is 11.5 GB. [2019-01-12 14:52:31,677 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-12 14:52:31,678 INFO L168 Benchmark]: Boogie Preprocessor took 60.66 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:52:31,679 INFO L168 Benchmark]: RCFGBuilder took 1721.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 71.4 MB). Peak memory consumption was 71.4 MB. Max. memory is 11.5 GB. [2019-01-12 14:52:31,680 INFO L168 Benchmark]: TraceAbstraction took 14611.14 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 188.7 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -15.2 MB). Peak memory consumption was 400.2 MB. Max. memory is 11.5 GB. [2019-01-12 14:52:31,680 INFO L168 Benchmark]: Witness Printer took 219.71 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 11.5 GB. [2019-01-12 14:52:31,685 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.16 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 661.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -176.7 MB). Peak memory consumption was 37.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 82.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 60.66 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1721.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 71.4 MB). Peak memory consumption was 71.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14611.14 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 188.7 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -15.2 MB). Peak memory consumption was 400.2 MB. Max. memory is 11.5 GB. * Witness Printer took 219.71 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 44]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 44]: 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: 314]: Loop Invariant Derived loop invariant: (((\result == 1 && !(0 == pumpRunning)) && tmp == 1) && (splverifierCounter == 0 && !(0 == systemActive)) && 2 <= waterLevel) || ((\result == 1 && tmp == 1) && (methAndRunningLastTime == 0 && splverifierCounter == 0 && pumpRunning == 0) && 1 <= waterLevel) - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: (((\result == 1 && !(0 == pumpRunning)) && tmp == 1) && (methAndRunningLastTime == 0 && 2 <= waterLevel) && splverifierCounter == 0 && !(0 == systemActive)) || ((\result == 1 && tmp == 1) && ((0 == \result && splverifierCounter == 0) && pumpRunning == 0) && 1 <= waterLevel) - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: ((\result == 1 && tmp == 1) && ((0 == \result && (splverifierCounter == 0 && !(0 == systemActive)) && pumpRunning == 0) && 0 == tmp___0) && 1 <= waterLevel) || ((\result == 1 && tmp == 1) && (methAndRunningLastTime == 0 && 2 <= waterLevel) && (splverifierCounter == 0 && !(0 == systemActive)) && pumpRunning == 0) - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((1 == systemActive && methAndRunningLastTime == 0) && waterLevel == 1) && pumpRunning == 0 - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: ((((\result == 1 && systemActive == 0) && tmp == 1) && 2 <= waterLevel && splverifierCounter == 0 && pumpRunning == 0) || ((\result == 1 && tmp == 1) && (methAndRunningLastTime == 0 && 1 <= waterLevel) && splverifierCounter == 0 && pumpRunning == 0)) || (((\result == 1 && !(0 == pumpRunning)) && tmp == 1) && (splverifierCounter == 0 && !(0 == systemActive)) && 2 <= waterLevel) - InvariantResult [Line: 525]: Loop Invariant Derived loop invariant: (((1 == systemActive && methAndRunningLastTime == 0) && waterLevel == 1) && \result == systemActive) && pumpRunning == 0 - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 486]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 256]: Loop Invariant Derived loop invariant: ((((((((\result == 1 && !(0 == pumpRunning)) && tmp == 1) && 0 == \result) && splverifierCounter == 0) && 1 == \result) && 1 == tmp___0) && 1 <= waterLevel) && tmp == 0) && !(0 == systemActive) - InvariantResult [Line: 940]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 256]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 256]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((\result == 1 && !(0 == pumpRunning)) && tmp == 1) && (splverifierCounter == 0 && !(0 == systemActive)) && 2 <= waterLevel) || ((\result == 1 && tmp == 1) && (methAndRunningLastTime == 0 && splverifierCounter == 0 && pumpRunning == 0) && 1 <= waterLevel) - InvariantResult [Line: 411]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 940]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: (((((\result == 1 && methAndRunningLastTime == 0) && tmp == 1) && 2 <= waterLevel) && splverifierCounter == 0) && pumpRunning == 0) && !(0 == systemActive) - InvariantResult [Line: 940]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 940]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 940]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 303]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 940]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 995]: Loop Invariant Derived loop invariant: (((((\result == 1 && !(0 == pumpRunning)) && tmp == 1) && 0 == \result) && splverifierCounter == 0) && 1 <= waterLevel) && !(0 == systemActive) - InvariantResult [Line: 279]: Loop Invariant Derived loop invariant: (((((splverifierCounter == 0 && pumpRunning == 0) && methAndRunningLastTime == 0) && 1 <= waterLevel) && \result == 1) && tmp == 1) || ((\result == 1 && tmp == 1) && (splverifierCounter == 0 && pumpRunning == 0) && 2 <= waterLevel) - InvariantResult [Line: 995]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 940]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 995]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 940]: Loop Invariant Derived loop invariant: (((((\result == 1 && methAndRunningLastTime == 0) && tmp == 1) && 2 <= waterLevel) && splverifierCounter == 0) && pumpRunning == 0) && !(0 == systemActive) - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 362]: Loop Invariant Derived loop invariant: ((((tmp == systemActive && methAndRunningLastTime == 0) && tmp == 1) && waterLevel == 1) && \result == systemActive) && pumpRunning == 0 - InvariantResult [Line: 476]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 940]: Loop Invariant Derived loop invariant: ((\result == 1 && (methAndRunningLastTime == 0 && splverifierCounter == 0 && !(0 == systemActive)) && 2 <= waterLevel) && tmp == 1) || ((\result == 1 && 1 <= waterLevel && splverifierCounter == 0 && pumpRunning == 0) && tmp == 1) - InvariantResult [Line: 981]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 324]: Loop Invariant Derived loop invariant: (((\result == 1 && !(0 == pumpRunning)) && tmp == 1) && (splverifierCounter == 0 && !(0 == systemActive)) && 2 <= waterLevel) || ((\result == 1 && tmp == 1) && (methAndRunningLastTime == 0 && splverifierCounter == 0 && pumpRunning == 0) && 1 <= waterLevel) - InvariantResult [Line: 455]: Loop Invariant Derived loop invariant: ((((tmp == systemActive && methAndRunningLastTime == 0) && tmp == 1) && waterLevel == 1) && \result == systemActive) && pumpRunning == 0 - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 981]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: ((\result == 1 && tmp == 1) && (splverifierCounter == 0 && pumpRunning == 0) && 1 <= waterLevel) || ((\result == 1 && tmp == 1) && ((splverifierCounter == 0 && !(0 == systemActive)) && methAndRunningLastTime == 0) && 2 <= waterLevel) - InvariantResult [Line: 981]: Loop Invariant Derived loop invariant: ((((methAndRunningLastTime == 0 && 2 <= waterLevel) && (splverifierCounter == 0 && !(0 == systemActive)) && pumpRunning == 0) && \result == 1) && tmp == 1) || ((\result == 1 && (1 == \result && (splverifierCounter == 0 && !(0 == systemActive)) && pumpRunning == 0) && 1 <= waterLevel) && tmp == 1) - InvariantResult [Line: 67]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 981]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 67]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 981]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 981]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 67]: Loop Invariant Derived loop invariant: ((((\result == 1 && systemActive == 0) && tmp == 1) && 2 <= waterLevel && splverifierCounter == 0 && pumpRunning == 0) || ((\result == 1 && tmp == 1) && (methAndRunningLastTime == 0 && 1 <= waterLevel) && splverifierCounter == 0 && pumpRunning == 0)) || (((\result == 1 && (splverifierCounter == 0 && !(0 == systemActive)) && 1 <= waterLevel) && !(0 == pumpRunning)) && tmp == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 141 locations, 3 error locations. SAFE Result, 14.4s OverallTime, 13 OverallIterations, 2 TraceHistogramMax, 4.0s AutomataDifference, 0.0s DeadEndRemovalTime, 7.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 1440 SDtfs, 1735 SDslu, 2186 SDs, 0 SdLazy, 245 SolverSat, 55 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=413occurred 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, 13 MinimizatonAttempts, 1173 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 57 LocationsWithAnnotation, 57 PreInvPairs, 138 NumberOfFragments, 766 HoareAnnotationTreeSize, 57 FomulaSimplifications, 73265 FormulaSimplificationTreeSizeReduction, 1.3s HoareSimplificationTime, 57 FomulaSimplificationsInter, 133343 FormulaSimplificationTreeSizeReductionInter, 6.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 504 NumberOfCodeBlocks, 504 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 491 ConstructedInterpolants, 0 QuantifiedInterpolants, 36017 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 88/88 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...