./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec3_product34.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/product-lines/minepump_spec3_product34.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 5f0a99b238839eec8a869cf6a8a47d3d1cc483bf ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 00:21:50,526 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:21:50,528 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:21:50,541 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:21:50,542 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:21:50,543 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:21:50,545 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:21:50,547 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:21:50,549 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:21:50,550 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:21:50,551 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:21:50,552 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:21:50,553 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:21:50,554 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:21:50,555 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:21:50,556 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:21:50,557 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:21:50,558 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:21:50,560 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:21:50,562 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:21:50,564 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:21:50,565 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:21:50,566 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:21:50,568 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:21:50,573 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:21:50,574 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:21:50,574 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:21:50,575 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:21:50,575 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:21:50,578 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:21:50,579 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:21:50,580 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:21:50,582 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:21:50,583 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:21:50,584 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:21:50,586 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:21:50,587 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:21:50,588 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:21:50,588 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:21:50,591 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:21:50,593 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:21:50,594 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 00:21:50,615 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:21:50,616 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:21:50,618 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:21:50,618 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:21:50,619 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:21:50,619 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:21:50,619 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:21:50,619 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:21:50,620 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:21:50,620 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:21:50,621 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:21:50,621 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:21:50,622 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:21:50,622 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:21:50,622 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:21:50,623 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:21:50,623 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:21:50,623 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:21:50,623 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:21:50,624 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:21:50,624 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:21:50,624 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:21:50,625 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:21:50,625 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:21:50,625 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:21:50,626 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:21:50,626 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:21:50,626 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:21:50,626 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 5f0a99b238839eec8a869cf6a8a47d3d1cc483bf [2019-11-28 00:21:50,930 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:21:50,945 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:21:50,949 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:21:50,950 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:21:50,951 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:21:50,952 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec3_product34.cil.c [2019-11-28 00:21:51,022 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d909f4256/cab4f93efb1945f886e5c0f4ae9f78db/FLAG0bfcef741 [2019-11-28 00:21:51,548 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:21:51,549 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product34.cil.c [2019-11-28 00:21:51,561 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d909f4256/cab4f93efb1945f886e5c0f4ae9f78db/FLAG0bfcef741 [2019-11-28 00:21:51,874 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d909f4256/cab4f93efb1945f886e5c0f4ae9f78db [2019-11-28 00:21:51,877 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:21:51,879 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:21:51,880 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:21:51,880 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:21:51,884 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:21:51,885 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:21:51" (1/1) ... [2019-11-28 00:21:51,889 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67529377 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:21:51, skipping insertion in model container [2019-11-28 00:21:51,889 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:21:51" (1/1) ... [2019-11-28 00:21:51,896 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:21:51,958 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:21:52,322 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:21:52,335 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:21:52,433 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:21:52,467 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:21:52,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:21:52 WrapperNode [2019-11-28 00:21:52,468 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:21:52,469 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:21:52,469 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:21:52,469 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:21:52,478 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:21:52" (1/1) ... [2019-11-28 00:21:52,504 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:21:52" (1/1) ... [2019-11-28 00:21:52,544 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:21:52,545 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:21:52,545 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:21:52,545 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:21:52,555 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:21:52" (1/1) ... [2019-11-28 00:21:52,555 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:21:52" (1/1) ... [2019-11-28 00:21:52,560 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:21:52" (1/1) ... [2019-11-28 00:21:52,561 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:21:52" (1/1) ... [2019-11-28 00:21:52,571 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:21:52" (1/1) ... [2019-11-28 00:21:52,580 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:21:52" (1/1) ... [2019-11-28 00:21:52,585 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:21:52" (1/1) ... [2019-11-28 00:21:52,590 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:21:52,591 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:21:52,591 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:21:52,591 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:21:52,592 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:21:52" (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-11-28 00:21:52,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 00:21:52,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-28 00:21:52,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:21:52,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:21:53,387 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:21:53,387 INFO L297 CfgBuilder]: Removed 104 assume(true) statements. [2019-11-28 00:21:53,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:21:53 BoogieIcfgContainer [2019-11-28 00:21:53,389 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:21:53,390 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:21:53,390 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:21:53,393 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:21:53,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:21:51" (1/3) ... [2019-11-28 00:21:53,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@741f3dd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:21:53, skipping insertion in model container [2019-11-28 00:21:53,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:21:52" (2/3) ... [2019-11-28 00:21:53,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@741f3dd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:21:53, skipping insertion in model container [2019-11-28 00:21:53,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:21:53" (3/3) ... [2019-11-28 00:21:53,401 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec3_product34.cil.c [2019-11-28 00:21:53,412 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:21:53,420 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-28 00:21:53,432 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-28 00:21:53,456 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:21:53,456 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:21:53,456 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:21:53,457 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:21:53,457 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:21:53,457 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:21:53,457 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:21:53,458 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:21:53,476 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2019-11-28 00:21:53,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 00:21:53,484 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:53,485 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:21:53,485 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:53,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:53,490 INFO L82 PathProgramCache]: Analyzing trace with hash 143052540, now seen corresponding path program 1 times [2019-11-28 00:21:53,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:53,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687245141] [2019-11-28 00:21:53,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:53,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:53,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:21:53,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687245141] [2019-11-28 00:21:53,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:53,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:21:53,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512753676] [2019-11-28 00:21:53,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 00:21:53,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:53,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 00:21:53,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 00:21:53,772 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 2 states. [2019-11-28 00:21:53,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:53,801 INFO L93 Difference]: Finished difference Result 162 states and 245 transitions. [2019-11-28 00:21:53,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 00:21:53,803 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-11-28 00:21:53,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:53,814 INFO L225 Difference]: With dead ends: 162 [2019-11-28 00:21:53,815 INFO L226 Difference]: Without dead ends: 80 [2019-11-28 00:21:53,818 INFO L630 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-11-28 00:21:53,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-28 00:21:53,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-11-28 00:21:53,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-28 00:21:53,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 114 transitions. [2019-11-28 00:21:53,859 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 114 transitions. Word has length 18 [2019-11-28 00:21:53,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:53,860 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 114 transitions. [2019-11-28 00:21:53,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 00:21:53,860 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 114 transitions. [2019-11-28 00:21:53,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 00:21:53,861 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:53,862 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:21:53,862 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:53,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:53,863 INFO L82 PathProgramCache]: Analyzing trace with hash -767978213, now seen corresponding path program 1 times [2019-11-28 00:21:53,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:53,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255024561] [2019-11-28 00:21:53,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:53,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:54,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:21:54,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255024561] [2019-11-28 00:21:54,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:54,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:21:54,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454168534] [2019-11-28 00:21:54,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:21:54,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:54,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:21:54,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:21:54,015 INFO L87 Difference]: Start difference. First operand 80 states and 114 transitions. Second operand 3 states. [2019-11-28 00:21:54,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:54,033 INFO L93 Difference]: Finished difference Result 80 states and 114 transitions. [2019-11-28 00:21:54,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:21:54,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-28 00:21:54,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:54,035 INFO L225 Difference]: With dead ends: 80 [2019-11-28 00:21:54,036 INFO L226 Difference]: Without dead ends: 36 [2019-11-28 00:21:54,037 INFO L630 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-11-28 00:21:54,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-28 00:21:54,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-11-28 00:21:54,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-28 00:21:54,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 51 transitions. [2019-11-28 00:21:54,044 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 51 transitions. Word has length 19 [2019-11-28 00:21:54,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:54,044 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 51 transitions. [2019-11-28 00:21:54,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:21:54,045 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 51 transitions. [2019-11-28 00:21:54,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 00:21:54,046 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:54,046 INFO L410 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-11-28 00:21:54,047 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:54,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:54,047 INFO L82 PathProgramCache]: Analyzing trace with hash 459341460, now seen corresponding path program 1 times [2019-11-28 00:21:54,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:54,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597235231] [2019-11-28 00:21:54,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:54,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:54,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:21:54,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597235231] [2019-11-28 00:21:54,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:54,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:21:54,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541188030] [2019-11-28 00:21:54,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:21:54,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:54,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:21:54,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:21:54,158 INFO L87 Difference]: Start difference. First operand 36 states and 51 transitions. Second operand 3 states. [2019-11-28 00:21:54,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:54,197 INFO L93 Difference]: Finished difference Result 66 states and 96 transitions. [2019-11-28 00:21:54,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:21:54,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-28 00:21:54,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:54,200 INFO L225 Difference]: With dead ends: 66 [2019-11-28 00:21:54,200 INFO L226 Difference]: Without dead ends: 36 [2019-11-28 00:21:54,201 INFO L630 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-11-28 00:21:54,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-28 00:21:54,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-11-28 00:21:54,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-28 00:21:54,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2019-11-28 00:21:54,208 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 50 transitions. Word has length 24 [2019-11-28 00:21:54,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:54,209 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 50 transitions. [2019-11-28 00:21:54,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:21:54,210 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 50 transitions. [2019-11-28 00:21:54,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 00:21:54,211 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:54,211 INFO L410 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] [2019-11-28 00:21:54,212 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:54,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:54,212 INFO L82 PathProgramCache]: Analyzing trace with hash -179810352, now seen corresponding path program 1 times [2019-11-28 00:21:54,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:54,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701215894] [2019-11-28 00:21:54,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:54,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:54,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:21:54,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701215894] [2019-11-28 00:21:54,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:54,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:21:54,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292609513] [2019-11-28 00:21:54,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:21:54,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:54,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:21:54,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:21:54,274 INFO L87 Difference]: Start difference. First operand 36 states and 50 transitions. Second operand 3 states. [2019-11-28 00:21:54,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:54,328 INFO L93 Difference]: Finished difference Result 89 states and 127 transitions. [2019-11-28 00:21:54,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:21:54,329 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-28 00:21:54,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:54,330 INFO L225 Difference]: With dead ends: 89 [2019-11-28 00:21:54,330 INFO L226 Difference]: Without dead ends: 59 [2019-11-28 00:21:54,333 INFO L630 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-11-28 00:21:54,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-28 00:21:54,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2019-11-28 00:21:54,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-28 00:21:54,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 80 transitions. [2019-11-28 00:21:54,350 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 80 transitions. Word has length 25 [2019-11-28 00:21:54,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:54,350 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 80 transitions. [2019-11-28 00:21:54,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:21:54,351 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 80 transitions. [2019-11-28 00:21:54,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 00:21:54,355 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:54,355 INFO L410 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] [2019-11-28 00:21:54,356 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:54,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:54,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1667839457, now seen corresponding path program 1 times [2019-11-28 00:21:54,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:54,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984024484] [2019-11-28 00:21:54,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:54,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:54,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:21:54,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984024484] [2019-11-28 00:21:54,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:54,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:21:54,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867733524] [2019-11-28 00:21:54,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:21:54,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:54,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:21:54,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:21:54,470 INFO L87 Difference]: Start difference. First operand 57 states and 80 transitions. Second operand 5 states. [2019-11-28 00:21:54,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:54,555 INFO L93 Difference]: Finished difference Result 149 states and 209 transitions. [2019-11-28 00:21:54,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:21:54,557 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-28 00:21:54,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:54,558 INFO L225 Difference]: With dead ends: 149 [2019-11-28 00:21:54,560 INFO L226 Difference]: Without dead ends: 98 [2019-11-28 00:21:54,561 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:21:54,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-28 00:21:54,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 60. [2019-11-28 00:21:54,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-28 00:21:54,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 83 transitions. [2019-11-28 00:21:54,582 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 83 transitions. Word has length 31 [2019-11-28 00:21:54,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:54,583 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 83 transitions. [2019-11-28 00:21:54,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:21:54,583 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 83 transitions. [2019-11-28 00:21:54,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 00:21:54,585 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:54,586 INFO L410 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] [2019-11-28 00:21:54,586 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:54,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:54,587 INFO L82 PathProgramCache]: Analyzing trace with hash 540443364, now seen corresponding path program 1 times [2019-11-28 00:21:54,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:54,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376628578] [2019-11-28 00:21:54,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:54,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:54,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:21:54,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376628578] [2019-11-28 00:21:54,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:54,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:21:54,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715609120] [2019-11-28 00:21:54,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:21:54,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:54,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:21:54,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:21:54,689 INFO L87 Difference]: Start difference. First operand 60 states and 83 transitions. Second operand 5 states. [2019-11-28 00:21:54,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:54,838 INFO L93 Difference]: Finished difference Result 314 states and 451 transitions. [2019-11-28 00:21:54,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 00:21:54,839 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-28 00:21:54,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:54,842 INFO L225 Difference]: With dead ends: 314 [2019-11-28 00:21:54,842 INFO L226 Difference]: Without dead ends: 260 [2019-11-28 00:21:54,843 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 00:21:54,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-11-28 00:21:54,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 106. [2019-11-28 00:21:54,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-28 00:21:54,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 144 transitions. [2019-11-28 00:21:54,873 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 144 transitions. Word has length 31 [2019-11-28 00:21:54,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:54,874 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 144 transitions. [2019-11-28 00:21:54,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:21:54,874 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 144 transitions. [2019-11-28 00:21:54,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 00:21:54,877 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:54,877 INFO L410 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] [2019-11-28 00:21:54,881 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:54,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:54,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1572316506, now seen corresponding path program 1 times [2019-11-28 00:21:54,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:54,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454714145] [2019-11-28 00:21:54,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:54,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:54,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:21:54,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454714145] [2019-11-28 00:21:54,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:54,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:21:54,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860716919] [2019-11-28 00:21:54,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:21:54,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:54,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:21:54,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:21:54,958 INFO L87 Difference]: Start difference. First operand 106 states and 144 transitions. Second operand 5 states. [2019-11-28 00:21:55,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:55,149 INFO L93 Difference]: Finished difference Result 499 states and 704 transitions. [2019-11-28 00:21:55,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 00:21:55,150 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-11-28 00:21:55,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:55,153 INFO L225 Difference]: With dead ends: 499 [2019-11-28 00:21:55,153 INFO L226 Difference]: Without dead ends: 445 [2019-11-28 00:21:55,154 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-28 00:21:55,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2019-11-28 00:21:55,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 152. [2019-11-28 00:21:55,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-28 00:21:55,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 207 transitions. [2019-11-28 00:21:55,180 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 207 transitions. Word has length 32 [2019-11-28 00:21:55,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:55,181 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 207 transitions. [2019-11-28 00:21:55,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:21:55,181 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 207 transitions. [2019-11-28 00:21:55,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 00:21:55,183 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:55,183 INFO L410 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] [2019-11-28 00:21:55,184 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:55,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:55,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1711533540, now seen corresponding path program 1 times [2019-11-28 00:21:55,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:55,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825266508] [2019-11-28 00:21:55,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:55,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:55,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:21:55,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825266508] [2019-11-28 00:21:55,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:55,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:21:55,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514970416] [2019-11-28 00:21:55,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:21:55,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:55,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:21:55,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 00:21:55,240 INFO L87 Difference]: Start difference. First operand 152 states and 207 transitions. Second operand 4 states. [2019-11-28 00:21:55,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:55,295 INFO L93 Difference]: Finished difference Result 352 states and 487 transitions. [2019-11-28 00:21:55,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:21:55,296 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-11-28 00:21:55,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:55,299 INFO L225 Difference]: With dead ends: 352 [2019-11-28 00:21:55,299 INFO L226 Difference]: Without dead ends: 250 [2019-11-28 00:21:55,300 INFO L630 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-11-28 00:21:55,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-11-28 00:21:55,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 149. [2019-11-28 00:21:55,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-28 00:21:55,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 203 transitions. [2019-11-28 00:21:55,323 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 203 transitions. Word has length 32 [2019-11-28 00:21:55,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:55,323 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 203 transitions. [2019-11-28 00:21:55,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:21:55,324 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 203 transitions. [2019-11-28 00:21:55,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 00:21:55,326 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:55,326 INFO L410 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] [2019-11-28 00:21:55,326 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:55,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:55,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1197872225, now seen corresponding path program 1 times [2019-11-28 00:21:55,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:55,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862833674] [2019-11-28 00:21:55,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:55,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:55,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:21:55,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862833674] [2019-11-28 00:21:55,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:55,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:21:55,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587271023] [2019-11-28 00:21:55,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:21:55,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:55,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:21:55,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:21:55,394 INFO L87 Difference]: Start difference. First operand 149 states and 203 transitions. Second operand 5 states. [2019-11-28 00:21:55,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:55,500 INFO L93 Difference]: Finished difference Result 351 states and 489 transitions. [2019-11-28 00:21:55,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:21:55,501 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-11-28 00:21:55,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:55,502 INFO L225 Difference]: With dead ends: 351 [2019-11-28 00:21:55,502 INFO L226 Difference]: Without dead ends: 90 [2019-11-28 00:21:55,503 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:21:55,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-28 00:21:55,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 60. [2019-11-28 00:21:55,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-28 00:21:55,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 76 transitions. [2019-11-28 00:21:55,514 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 76 transitions. Word has length 32 [2019-11-28 00:21:55,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:55,515 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 76 transitions. [2019-11-28 00:21:55,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:21:55,516 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 76 transitions. [2019-11-28 00:21:55,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 00:21:55,517 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:55,517 INFO L410 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] [2019-11-28 00:21:55,517 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:55,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:55,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1969698978, now seen corresponding path program 1 times [2019-11-28 00:21:55,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:55,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760015265] [2019-11-28 00:21:55,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:55,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:55,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:21:55,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760015265] [2019-11-28 00:21:55,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:55,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:21:55,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116725334] [2019-11-28 00:21:55,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:21:55,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:55,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:21:55,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:21:55,610 INFO L87 Difference]: Start difference. First operand 60 states and 76 transitions. Second operand 5 states. [2019-11-28 00:21:55,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:55,663 INFO L93 Difference]: Finished difference Result 103 states and 131 transitions. [2019-11-28 00:21:55,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:21:55,664 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-11-28 00:21:55,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:55,664 INFO L225 Difference]: With dead ends: 103 [2019-11-28 00:21:55,664 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 00:21:55,665 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:21:55,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 00:21:55,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 00:21:55,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 00:21:55,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 00:21:55,666 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2019-11-28 00:21:55,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:55,667 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 00:21:55,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:21:55,667 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 00:21:55,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 00:21:55,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 00:21:55,791 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 61 [2019-11-28 00:21:56,401 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 15 [2019-11-28 00:21:56,647 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 15 [2019-11-28 00:21:56,875 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 26 [2019-11-28 00:21:56,980 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 19 [2019-11-28 00:21:57,146 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 15 [2019-11-28 00:21:57,328 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 20 [2019-11-28 00:21:57,524 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 15 [2019-11-28 00:21:57,612 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 786) no Hoare annotation was computed. [2019-11-28 00:21:57,612 INFO L246 CegarLoopResult]: For program point L85(lines 85 98) no Hoare annotation was computed. [2019-11-28 00:21:57,612 INFO L242 CegarLoopResult]: At program point L234(lines 234 240) the Hoare annotation is: (let ((.cse0 (= 1 ~systemActive~0)) (.cse1 (= 0 ULTIMATE.start_test_~splverifierCounter~0))) (or (and .cse0 (= 0 ULTIMATE.start_processEnvironment_~tmp~2) (<= ~waterLevel~0 1) (= ~pumpRunning~0 0) .cse1) (and .cse0 (= 0 ULTIMATE.start_isHighWaterLevel_~tmp~3) (= ~pumpRunning~0 1) .cse1))) [2019-11-28 00:21:57,612 INFO L242 CegarLoopResult]: At program point L234-1(lines 234 240) the Hoare annotation is: false [2019-11-28 00:21:57,613 INFO L242 CegarLoopResult]: At program point L234-2(lines 234 240) the Hoare annotation is: false [2019-11-28 00:21:57,613 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 00:21:57,613 INFO L246 CegarLoopResult]: For program point L763(lines 763 776) no Hoare annotation was computed. [2019-11-28 00:21:57,613 INFO L242 CegarLoopResult]: At program point L763-1(lines 1 918) the Hoare annotation is: (let ((.cse0 (= 1 ~systemActive~0)) (.cse1 (= 0 ULTIMATE.start_test_~splverifierCounter~0))) (or (and .cse0 (<= ~waterLevel~0 1) (= ~pumpRunning~0 0) .cse1) (and .cse0 (= 0 ULTIMATE.start_isHighWaterLevel_~tmp~3) (= ~pumpRunning~0 1) .cse1))) [2019-11-28 00:21:57,613 INFO L246 CegarLoopResult]: For program point L763-2(lines 763 776) no Hoare annotation was computed. [2019-11-28 00:21:57,613 INFO L242 CegarLoopResult]: At program point L763-3(lines 1 918) the Hoare annotation is: false [2019-11-28 00:21:57,614 INFO L246 CegarLoopResult]: For program point L763-4(lines 763 776) no Hoare annotation was computed. [2019-11-28 00:21:57,616 INFO L242 CegarLoopResult]: At program point L763-5(lines 1 918) the Hoare annotation is: false [2019-11-28 00:21:57,616 INFO L242 CegarLoopResult]: At program point L879(lines 870 883) the Hoare annotation is: (let ((.cse0 (= 1 ~systemActive~0)) (.cse1 (= ~pumpRunning~0 0)) (.cse2 (= 0 ULTIMATE.start_test_~splverifierCounter~0))) (or (and .cse0 (<= ~waterLevel~0 1) .cse1 .cse2) (and (= |ULTIMATE.start_isHighWaterSensorDry_#res| 0) .cse0 .cse1 .cse2))) [2019-11-28 00:21:57,616 INFO L242 CegarLoopResult]: At program point L367(lines 352 370) the Hoare annotation is: (let ((.cse1 (= 0 ULTIMATE.start_isHighWaterLevel_~tmp~3)) (.cse0 (= 1 ~systemActive~0)) (.cse2 (<= ~waterLevel~0 1)) (.cse3 (= ~pumpRunning~0 0)) (.cse4 (= 0 ULTIMATE.start_test_~splverifierCounter~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (= |ULTIMATE.start_isHighWaterSensorDry_#res| 0) .cse0 .cse1 (= 1 |ULTIMATE.start_isHighWaterLevel_#res|) .cse3 .cse4 (= 1 ULTIMATE.start_isHighWaterLevel_~tmp___0~1)) (and (= 0 |ULTIMATE.start_isHighWaterLevel_#res|) .cse0 (= 0 ULTIMATE.start_isHighWaterLevel_~tmp___0~1) .cse2 .cse3 .cse4))) [2019-11-28 00:21:57,616 INFO L242 CegarLoopResult]: At program point L879-1(lines 870 883) the Hoare annotation is: false [2019-11-28 00:21:57,616 INFO L242 CegarLoopResult]: At program point L367-1(lines 352 370) the Hoare annotation is: false [2019-11-28 00:21:57,617 INFO L242 CegarLoopResult]: At program point L879-2(lines 870 883) the Hoare annotation is: false [2019-11-28 00:21:57,617 INFO L242 CegarLoopResult]: At program point L367-2(lines 352 370) the Hoare annotation is: false [2019-11-28 00:21:57,617 INFO L242 CegarLoopResult]: At program point L103(lines 54 104) the Hoare annotation is: false [2019-11-28 00:21:57,617 INFO L246 CegarLoopResult]: For program point L797(lines 797 801) no Hoare annotation was computed. [2019-11-28 00:21:57,617 INFO L246 CegarLoopResult]: For program point L797-3(lines 797 801) no Hoare annotation was computed. [2019-11-28 00:21:57,617 INFO L246 CegarLoopResult]: For program point L797-6(lines 797 801) no Hoare annotation was computed. [2019-11-28 00:21:57,617 INFO L246 CegarLoopResult]: For program point L56(lines 55 102) no Hoare annotation was computed. [2019-11-28 00:21:57,617 INFO L242 CegarLoopResult]: At program point L915(lines 910 918) the Hoare annotation is: (and (= 1 ~systemActive~0) (= 1 ~waterLevel~0) (= ~pumpRunning~0 0)) [2019-11-28 00:21:57,617 INFO L242 CegarLoopResult]: At program point L172(lines 168 174) the Hoare annotation is: (and (= 1 ~systemActive~0) (= 1 ~waterLevel~0) (= ~pumpRunning~0 0)) [2019-11-28 00:21:57,618 INFO L242 CegarLoopResult]: At program point L866(lines 861 869) the Hoare annotation is: (let ((.cse0 (= 1 ~systemActive~0)) (.cse1 (= 0 ULTIMATE.start_test_~splverifierCounter~0))) (or (and .cse0 (= 0 ULTIMATE.start_processEnvironment_~tmp~2) (<= ~waterLevel~0 1) (not (= |ULTIMATE.start_getWaterLevel_#res| 2)) (= ~pumpRunning~0 0) .cse1) (and .cse0 (= 0 ULTIMATE.start_isHighWaterLevel_~tmp~3) (= ~pumpRunning~0 1) .cse1))) [2019-11-28 00:21:57,618 INFO L242 CegarLoopResult]: At program point L866-1(lines 861 869) the Hoare annotation is: false [2019-11-28 00:21:57,618 INFO L242 CegarLoopResult]: At program point L866-2(lines 861 869) the Hoare annotation is: false [2019-11-28 00:21:57,618 INFO L246 CegarLoopResult]: For program point L767(lines 767 773) no Hoare annotation was computed. [2019-11-28 00:21:57,618 INFO L246 CegarLoopResult]: For program point L767-2(lines 767 773) no Hoare annotation was computed. [2019-11-28 00:21:57,618 INFO L246 CegarLoopResult]: For program point L767-4(lines 767 773) no Hoare annotation was computed. [2019-11-28 00:21:57,618 INFO L246 CegarLoopResult]: For program point L57(lines 57 61) no Hoare annotation was computed. [2019-11-28 00:21:57,618 INFO L242 CegarLoopResult]: At program point L123-2(lines 123 137) the Hoare annotation is: false [2019-11-28 00:21:57,619 INFO L242 CegarLoopResult]: At program point L834(lines 829 837) the Hoare annotation is: (let ((.cse0 (= 1 ~systemActive~0)) (.cse1 (= 0 ULTIMATE.start_test_~splverifierCounter~0))) (or (and .cse0 (= 0 ULTIMATE.start_processEnvironment_~tmp~2) (<= ~waterLevel~0 1) (= ~pumpRunning~0 0) .cse1) (and .cse0 (= 0 ULTIMATE.start_isHighWaterLevel_~tmp~3) (= ~pumpRunning~0 1) .cse1))) [2019-11-28 00:21:57,621 INFO L242 CegarLoopResult]: At program point L834-1(lines 829 837) the Hoare annotation is: false [2019-11-28 00:21:57,621 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 00:21:57,622 INFO L242 CegarLoopResult]: At program point L834-2(lines 829 837) the Hoare annotation is: false [2019-11-28 00:21:57,622 INFO L246 CegarLoopResult]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-28 00:21:57,622 INFO L249 CegarLoopResult]: At program point L207(lines 188 210) the Hoare annotation is: true [2019-11-28 00:21:57,622 INFO L246 CegarLoopResult]: For program point L75(lines 75 81) no Hoare annotation was computed. [2019-11-28 00:21:57,622 INFO L242 CegarLoopResult]: At program point L75-1(lines 75 81) the Hoare annotation is: (let ((.cse0 (= 1 ~systemActive~0)) (.cse1 (= 0 ULTIMATE.start_test_~splverifierCounter~0))) (or (and .cse0 (= ~pumpRunning~0 0) .cse1) (and .cse0 (= 0 ULTIMATE.start_isHighWaterLevel_~tmp~3) (= ~pumpRunning~0 1) .cse1))) [2019-11-28 00:21:57,623 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 786) no Hoare annotation was computed. [2019-11-28 00:21:57,623 INFO L246 CegarLoopResult]: For program point L786(line 786) no Hoare annotation was computed. [2019-11-28 00:21:57,623 INFO L246 CegarLoopResult]: For program point L786-1(line 786) no Hoare annotation was computed. [2019-11-28 00:21:57,623 INFO L246 CegarLoopResult]: For program point L786-2(line 786) no Hoare annotation was computed. [2019-11-28 00:21:57,623 INFO L246 CegarLoopResult]: For program point L93(lines 93 97) no Hoare annotation was computed. [2019-11-28 00:21:57,624 INFO L242 CegarLoopResult]: At program point L93-2(lines 227 233) the Hoare annotation is: (let ((.cse0 (= 1 ~systemActive~0)) (.cse1 (= 0 ULTIMATE.start_test_~splverifierCounter~0))) (or (and .cse0 (= ~pumpRunning~0 0) .cse1) (and .cse0 (= 0 ULTIMATE.start_isHighWaterLevel_~tmp~3) (= ~pumpRunning~0 1) .cse1))) [2019-11-28 00:21:57,624 INFO L246 CegarLoopResult]: For program point L259(lines 259 276) no Hoare annotation was computed. [2019-11-28 00:21:57,624 INFO L246 CegarLoopResult]: For program point L259-1(lines 259 276) no Hoare annotation was computed. [2019-11-28 00:21:57,624 INFO L246 CegarLoopResult]: For program point L259-2(lines 259 276) no Hoare annotation was computed. [2019-11-28 00:21:57,624 INFO L246 CegarLoopResult]: For program point L127(lines 127 131) no Hoare annotation was computed. [2019-11-28 00:21:57,624 INFO L246 CegarLoopResult]: For program point L127-1(lines 227 233) no Hoare annotation was computed. [2019-11-28 00:21:57,624 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 00:21:57,624 INFO L246 CegarLoopResult]: For program point L821(lines 821 825) no Hoare annotation was computed. [2019-11-28 00:21:57,624 INFO L242 CegarLoopResult]: At program point L227(lines 226 245) the Hoare annotation is: (let ((.cse0 (= 1 ~systemActive~0)) (.cse1 (= 0 ULTIMATE.start_test_~splverifierCounter~0))) (or (and .cse0 (= ~pumpRunning~0 0) .cse1) (and .cse0 (= 0 ULTIMATE.start_isHighWaterLevel_~tmp~3) (= ~pumpRunning~0 1) .cse1))) [2019-11-28 00:21:57,624 INFO L246 CegarLoopResult]: For program point L227-1(lines 227 233) no Hoare annotation was computed. [2019-11-28 00:21:57,625 INFO L242 CegarLoopResult]: At program point L227-2(lines 226 245) the Hoare annotation is: false [2019-11-28 00:21:57,625 INFO L242 CegarLoopResult]: At program point L227-3(lines 226 245) the Hoare annotation is: false [2019-11-28 00:21:57,625 INFO L246 CegarLoopResult]: For program point L757(lines 757 777) no Hoare annotation was computed. [2019-11-28 00:21:57,625 INFO L246 CegarLoopResult]: For program point L757-2(lines 757 777) no Hoare annotation was computed. [2019-11-28 00:21:57,625 INFO L246 CegarLoopResult]: For program point L757-4(lines 757 777) no Hoare annotation was computed. [2019-11-28 00:21:57,625 INFO L246 CegarLoopResult]: For program point L361(lines 361 365) no Hoare annotation was computed. [2019-11-28 00:21:57,625 INFO L246 CegarLoopResult]: For program point L361-2(lines 361 365) no Hoare annotation was computed. [2019-11-28 00:21:57,625 INFO L246 CegarLoopResult]: For program point L361-3(lines 361 365) no Hoare annotation was computed. [2019-11-28 00:21:57,625 INFO L246 CegarLoopResult]: For program point L361-5(lines 361 365) no Hoare annotation was computed. [2019-11-28 00:21:57,626 INFO L246 CegarLoopResult]: For program point L361-6(lines 361 365) no Hoare annotation was computed. [2019-11-28 00:21:57,626 INFO L246 CegarLoopResult]: For program point L361-8(lines 361 365) no Hoare annotation was computed. [2019-11-28 00:21:57,626 INFO L242 CegarLoopResult]: At program point L312(lines 307 315) the Hoare annotation is: (and (= 1 ~systemActive~0) (= 0 ULTIMATE.start_isHighWaterLevel_~tmp~3) (= ~pumpRunning~0 1) (= |ULTIMATE.start_isPumpRunning_#res| 1) (= 0 ULTIMATE.start_test_~splverifierCounter~0)) [2019-11-28 00:21:57,626 INFO L242 CegarLoopResult]: At program point L312-1(lines 307 315) the Hoare annotation is: false [2019-11-28 00:21:57,626 INFO L242 CegarLoopResult]: At program point L312-2(lines 307 315) the Hoare annotation is: false [2019-11-28 00:21:57,626 INFO L242 CegarLoopResult]: At program point L907(lines 1 918) the Hoare annotation is: (and (= 1 ~systemActive~0) (= 1 ~waterLevel~0) (= ~pumpRunning~0 0)) [2019-11-28 00:21:57,626 INFO L246 CegarLoopResult]: For program point L874(lines 874 880) no Hoare annotation was computed. [2019-11-28 00:21:57,626 INFO L246 CegarLoopResult]: For program point L874-1(lines 874 880) no Hoare annotation was computed. [2019-11-28 00:21:57,626 INFO L246 CegarLoopResult]: For program point L874-2(lines 874 880) no Hoare annotation was computed. [2019-11-28 00:21:57,627 INFO L246 CegarLoopResult]: For program point L263(lines 263 271) no Hoare annotation was computed. [2019-11-28 00:21:57,627 INFO L246 CegarLoopResult]: For program point L263-1(lines 263 271) no Hoare annotation was computed. [2019-11-28 00:21:57,627 INFO L246 CegarLoopResult]: For program point L263-2(lines 263 271) no Hoare annotation was computed. [2019-11-28 00:21:57,627 INFO L246 CegarLoopResult]: For program point L65(lines 65 71) no Hoare annotation was computed. [2019-11-28 00:21:57,627 INFO L242 CegarLoopResult]: At program point L65-1(lines 65 71) the Hoare annotation is: (let ((.cse0 (= 1 ~systemActive~0)) (.cse1 (= 0 ULTIMATE.start_test_~splverifierCounter~0))) (or (and .cse0 (= ~pumpRunning~0 0) .cse1) (and .cse0 (= 0 ULTIMATE.start_isHighWaterLevel_~tmp~3) (= ~pumpRunning~0 1) .cse1))) [2019-11-28 00:21:57,627 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-28 00:21:57,627 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 786) no Hoare annotation was computed. [2019-11-28 00:21:57,628 INFO L246 CegarLoopResult]: For program point L809(lines 809 813) no Hoare annotation was computed. [2019-11-28 00:21:57,628 INFO L246 CegarLoopResult]: For program point L198(lines 198 205) no Hoare annotation was computed. [2019-11-28 00:21:57,628 INFO L249 CegarLoopResult]: At program point L198-1(lines 198 205) the Hoare annotation is: true [2019-11-28 00:21:57,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:21:57 BoogieIcfgContainer [2019-11-28 00:21:57,654 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:21:57,655 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:21:57,655 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:21:57,655 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:21:57,656 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:21:53" (3/4) ... [2019-11-28 00:21:57,661 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 00:21:57,684 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 38 nodes and edges [2019-11-28 00:21:57,684 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2019-11-28 00:21:57,685 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-11-28 00:21:57,686 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-28 00:21:57,687 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 00:21:57,688 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 00:21:57,688 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 00:21:57,722 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 == systemActive && waterLevel <= 1) && pumpRunning == 0) && 0 == splverifierCounter) || (((\result == 0 && 1 == systemActive) && pumpRunning == 0) && 0 == splverifierCounter) [2019-11-28 00:21:57,723 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 == systemActive && 0 == tmp) && waterLevel <= 1) && !(\result == 2)) && pumpRunning == 0) && 0 == splverifierCounter) || (((1 == systemActive && 0 == tmp) && pumpRunning == 1) && 0 == splverifierCounter) [2019-11-28 00:21:57,723 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 == systemActive && 0 == tmp) && waterLevel <= 1) && pumpRunning == 0) && 0 == splverifierCounter) || ((((((\result == 0 && 1 == systemActive) && 0 == tmp) && 1 == \result) && pumpRunning == 0) && 0 == splverifierCounter) && 1 == tmp___0)) || (((((0 == \result && 1 == systemActive) && 0 == tmp___0) && waterLevel <= 1) && pumpRunning == 0) && 0 == splverifierCounter) [2019-11-28 00:21:57,724 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 == systemActive && 0 == tmp) && pumpRunning == 1) && \result == 1) && 0 == splverifierCounter [2019-11-28 00:21:57,799 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:21:57,799 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:21:57,801 INFO L168 Benchmark]: Toolchain (without parser) took 5922.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 216.5 MB). Free memory was 952.3 MB in the beginning and 894.4 MB in the end (delta: 57.9 MB). Peak memory consumption was 274.4 MB. Max. memory is 11.5 GB. [2019-11-28 00:21:57,801 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:21:57,802 INFO L168 Benchmark]: CACSL2BoogieTranslator took 588.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -169.5 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2019-11-28 00:21:57,802 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.02 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: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. [2019-11-28 00:21:57,802 INFO L168 Benchmark]: Boogie Preprocessor took 45.30 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-11-28 00:21:57,803 INFO L168 Benchmark]: RCFGBuilder took 798.38 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: 64.1 MB). Peak memory consumption was 64.1 MB. Max. memory is 11.5 GB. [2019-11-28 00:21:57,803 INFO L168 Benchmark]: TraceAbstraction took 4264.48 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 78.1 MB). Free memory was 1.0 GB in the beginning and 902.2 MB in the end (delta: 147.2 MB). Peak memory consumption was 245.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:21:57,803 INFO L168 Benchmark]: Witness Printer took 144.78 ms. Allocated memory is still 1.2 GB. Free memory was 902.2 MB in the beginning and 894.4 MB in the end (delta: 7.8 MB). Peak memory consumption was 7.8 MB. Max. memory is 11.5 GB. [2019-11-28 00:21:57,806 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 588.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -169.5 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 76.02 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: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.30 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 798.38 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: 64.1 MB). Peak memory consumption was 64.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4264.48 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 78.1 MB). Free memory was 1.0 GB in the beginning and 902.2 MB in the end (delta: 147.2 MB). Peak memory consumption was 245.7 MB. Max. memory is 11.5 GB. * Witness Printer took 144.78 ms. Allocated memory is still 1.2 GB. Free memory was 902.2 MB in the beginning and 894.4 MB in the end (delta: 7.8 MB). Peak memory consumption was 7.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 786]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 786]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 786]: 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: 870]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 352]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 227]: Loop Invariant Derived loop invariant: ((1 == systemActive && pumpRunning == 0) && 0 == splverifierCounter) || (((1 == systemActive && 0 == tmp) && pumpRunning == 1) && 0 == splverifierCounter) - InvariantResult [Line: 307]: Loop Invariant Derived loop invariant: (((1 == systemActive && 0 == tmp) && pumpRunning == 1) && \result == 1) && 0 == splverifierCounter - InvariantResult [Line: 870]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 352]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 861]: Loop Invariant Derived loop invariant: (((((1 == systemActive && 0 == tmp) && waterLevel <= 1) && !(\result == 2)) && pumpRunning == 0) && 0 == splverifierCounter) || (((1 == systemActive && 0 == tmp) && pumpRunning == 1) && 0 == splverifierCounter) - InvariantResult [Line: 307]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 861]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 307]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 234]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 861]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 234]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: ((1 == systemActive && pumpRunning == 0) && 0 == splverifierCounter) || (((1 == systemActive && 0 == tmp) && pumpRunning == 1) && 0 == splverifierCounter) - InvariantResult [Line: 870]: Loop Invariant Derived loop invariant: (((1 == systemActive && waterLevel <= 1) && pumpRunning == 0) && 0 == splverifierCounter) || (((\result == 0 && 1 == systemActive) && pumpRunning == 0) && 0 == splverifierCounter) - InvariantResult [Line: 352]: Loop Invariant Derived loop invariant: (((((1 == systemActive && 0 == tmp) && waterLevel <= 1) && pumpRunning == 0) && 0 == splverifierCounter) || ((((((\result == 0 && 1 == systemActive) && 0 == tmp) && 1 == \result) && pumpRunning == 0) && 0 == splverifierCounter) && 1 == tmp___0)) || (((((0 == \result && 1 == systemActive) && 0 == tmp___0) && waterLevel <= 1) && pumpRunning == 0) && 0 == splverifierCounter) - InvariantResult [Line: 188]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 829]: Loop Invariant Derived loop invariant: ((((1 == systemActive && 0 == tmp) && waterLevel <= 1) && pumpRunning == 0) && 0 == splverifierCounter) || (((1 == systemActive && 0 == tmp) && pumpRunning == 1) && 0 == splverifierCounter) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 829]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (1 == systemActive && 1 == waterLevel) && pumpRunning == 0 - InvariantResult [Line: 829]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: ((1 == systemActive && pumpRunning == 0) && 0 == splverifierCounter) || (((1 == systemActive && 0 == tmp) && pumpRunning == 1) && 0 == splverifierCounter) - InvariantResult [Line: 234]: Loop Invariant Derived loop invariant: ((((1 == systemActive && 0 == tmp) && waterLevel <= 1) && pumpRunning == 0) && 0 == splverifierCounter) || (((1 == systemActive && 0 == tmp) && pumpRunning == 1) && 0 == splverifierCounter) - InvariantResult [Line: 910]: Loop Invariant Derived loop invariant: (1 == systemActive && 1 == waterLevel) && pumpRunning == 0 - InvariantResult [Line: 226]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 226]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: (1 == systemActive && 1 == waterLevel) && pumpRunning == 0 - InvariantResult [Line: 226]: Loop Invariant Derived loop invariant: ((1 == systemActive && pumpRunning == 0) && 0 == splverifierCounter) || (((1 == systemActive && 0 == tmp) && pumpRunning == 1) && 0 == splverifierCounter) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((1 == systemActive && waterLevel <= 1) && pumpRunning == 0) && 0 == splverifierCounter) || (((1 == systemActive && 0 == tmp) && pumpRunning == 1) && 0 == splverifierCounter) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 84 locations, 3 error locations. Result: SAFE, OverallTime: 2.2s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.9s, HoareTripleCheckerStatistics: 745 SDtfs, 823 SDslu, 1116 SDs, 0 SdLazy, 168 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 618 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 34 LocationsWithAnnotation, 34 PreInvPairs, 101 NumberOfFragments, 368 HoareAnnotationTreeSize, 34 FomulaSimplifications, 27150 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 34 FomulaSimplificationsInter, 4328 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 276 NumberOfCodeBlocks, 276 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 266 ConstructedInterpolants, 0 QuantifiedInterpolants, 11520 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...