./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec3_product34_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/product-lines/minepump_spec3_product34_true-unreach-call_false-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5f0a99b238839eec8a869cf6a8a47d3d1cc483bf ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 14:52:34,129 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 14:52:34,130 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 14:52:34,142 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 14:52:34,143 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 14:52:34,144 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 14:52:34,145 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 14:52:34,147 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 14:52:34,149 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 14:52:34,150 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 14:52:34,151 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 14:52:34,151 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 14:52:34,152 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 14:52:34,153 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 14:52:34,155 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 14:52:34,155 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 14:52:34,156 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 14:52:34,158 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 14:52:34,161 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 14:52:34,162 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 14:52:34,163 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 14:52:34,165 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 14:52:34,167 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 14:52:34,167 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 14:52:34,168 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 14:52:34,168 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 14:52:34,171 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 14:52:34,172 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 14:52:34,173 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 14:52:34,177 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 14:52:34,178 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 14:52:34,178 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 14:52:34,180 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 14:52:34,180 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 14:52:34,181 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 14:52:34,183 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 14:52:34,185 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 14:52:34,213 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 14:52:34,214 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 14:52:34,216 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 14:52:34,216 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 14:52:34,216 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 14:52:34,216 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 14:52:34,216 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 14:52:34,217 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 14:52:34,218 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 14:52:34,219 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 14:52:34,219 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 14:52:34,219 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 14:52:34,219 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 14:52:34,219 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 14:52:34,219 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 14:52:34,220 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 14:52:34,220 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 14:52:34,221 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 14:52:34,221 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 14:52:34,221 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 14:52:34,221 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 14:52:34,221 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:52:34,222 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 14:52:34,224 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 14:52:34,224 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 14:52:34,224 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 14:52:34,224 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 14:52:34,224 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 14:52:34,225 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5f0a99b238839eec8a869cf6a8a47d3d1cc483bf [2019-01-12 14:52:34,283 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 14:52:34,301 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 14:52:34,308 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 14:52:34,309 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 14:52:34,310 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 14:52:34,311 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec3_product34_true-unreach-call_false-termination.cil.c [2019-01-12 14:52:34,375 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/138aac62b/2ebd1ead253f44409f91e7ab73f1cb92/FLAGc06c4c987 [2019-01-12 14:52:34,840 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 14:52:34,841 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec3_product34_true-unreach-call_false-termination.cil.c [2019-01-12 14:52:34,855 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/138aac62b/2ebd1ead253f44409f91e7ab73f1cb92/FLAGc06c4c987 [2019-01-12 14:52:35,175 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/138aac62b/2ebd1ead253f44409f91e7ab73f1cb92 [2019-01-12 14:52:35,178 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 14:52:35,180 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 14:52:35,181 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 14:52:35,181 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 14:52:35,184 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 14:52:35,185 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:52:35" (1/1) ... [2019-01-12 14:52:35,188 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@199daf6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:52:35, skipping insertion in model container [2019-01-12 14:52:35,189 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:52:35" (1/1) ... [2019-01-12 14:52:35,197 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 14:52:35,251 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 14:52:35,620 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:52:35,641 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 14:52:35,823 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:52:35,862 INFO L195 MainTranslator]: Completed translation [2019-01-12 14:52:35,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:52:35 WrapperNode [2019-01-12 14:52:35,862 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 14:52:35,863 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 14:52:35,864 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 14:52:35,864 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 14:52:35,873 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:52:35" (1/1) ... [2019-01-12 14:52:35,897 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:52:35" (1/1) ... [2019-01-12 14:52:35,943 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 14:52:35,943 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 14:52:35,944 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 14:52:35,944 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 14:52:35,953 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:52:35" (1/1) ... [2019-01-12 14:52:35,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:52:35" (1/1) ... [2019-01-12 14:52:35,957 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:52:35" (1/1) ... [2019-01-12 14:52:35,958 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:52:35" (1/1) ... [2019-01-12 14:52:35,970 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:52:35" (1/1) ... [2019-01-12 14:52:35,989 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:52:35" (1/1) ... [2019-01-12 14:52:35,994 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:52:35" (1/1) ... [2019-01-12 14:52:36,003 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 14:52:36,004 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 14:52:36,004 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 14:52:36,004 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 14:52:36,005 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:52:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:52:36,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 14:52:36,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-12 14:52:36,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 14:52:36,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 14:52:37,295 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 14:52:37,296 INFO L286 CfgBuilder]: Removed 104 assue(true) statements. [2019-01-12 14:52:37,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:52:37 BoogieIcfgContainer [2019-01-12 14:52:37,298 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 14:52:37,299 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 14:52:37,299 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 14:52:37,301 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 14:52:37,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 02:52:35" (1/3) ... [2019-01-12 14:52:37,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ac7c032 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:52:37, skipping insertion in model container [2019-01-12 14:52:37,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:52:35" (2/3) ... [2019-01-12 14:52:37,303 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ac7c032 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:52:37, skipping insertion in model container [2019-01-12 14:52:37,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:52:37" (3/3) ... [2019-01-12 14:52:37,305 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec3_product34_true-unreach-call_false-termination.cil.c [2019-01-12 14:52:37,315 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 14:52:37,323 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-12 14:52:37,340 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-12 14:52:37,374 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 14:52:37,375 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 14:52:37,375 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 14:52:37,376 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 14:52:37,376 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 14:52:37,376 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 14:52:37,377 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 14:52:37,377 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 14:52:37,377 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 14:52:37,399 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2019-01-12 14:52:37,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-12 14:52:37,408 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:52:37,409 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:52:37,411 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:52:37,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:52:37,418 INFO L82 PathProgramCache]: Analyzing trace with hash 143052540, now seen corresponding path program 1 times [2019-01-12 14:52:37,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:52:37,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:52:37,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:37,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:52:37,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:37,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:52:37,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:52:37,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:52:37,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:52:37,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 14:52:37,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 14:52:37,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 14:52:37,706 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 2 states. [2019-01-12 14:52:37,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:52:37,738 INFO L93 Difference]: Finished difference Result 162 states and 245 transitions. [2019-01-12 14:52:37,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 14:52:37,740 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-01-12 14:52:37,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:52:37,754 INFO L225 Difference]: With dead ends: 162 [2019-01-12 14:52:37,754 INFO L226 Difference]: Without dead ends: 80 [2019-01-12 14:52:37,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 14:52:37,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-12 14:52:37,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-01-12 14:52:37,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-12 14:52:37,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 114 transitions. [2019-01-12 14:52:37,809 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 114 transitions. Word has length 18 [2019-01-12 14:52:37,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:52:37,809 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 114 transitions. [2019-01-12 14:52:37,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 14:52:37,810 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 114 transitions. [2019-01-12 14:52:37,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-12 14:52:37,811 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:52:37,811 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:52:37,812 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:52:37,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:52:37,812 INFO L82 PathProgramCache]: Analyzing trace with hash -767978213, now seen corresponding path program 1 times [2019-01-12 14:52:37,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:52:37,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:52:37,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:37,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:52:37,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:37,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:52:37,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:52:37,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:52:37,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:52:37,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:52:37,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:52:37,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:52:37,982 INFO L87 Difference]: Start difference. First operand 80 states and 114 transitions. Second operand 3 states. [2019-01-12 14:52:38,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:52:38,007 INFO L93 Difference]: Finished difference Result 80 states and 114 transitions. [2019-01-12 14:52:38,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:52:38,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-01-12 14:52:38,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:52:38,009 INFO L225 Difference]: With dead ends: 80 [2019-01-12 14:52:38,009 INFO L226 Difference]: Without dead ends: 36 [2019-01-12 14:52:38,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:52:38,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-12 14:52:38,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-01-12 14:52:38,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-12 14:52:38,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 51 transitions. [2019-01-12 14:52:38,016 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 51 transitions. Word has length 19 [2019-01-12 14:52:38,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:52:38,017 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 51 transitions. [2019-01-12 14:52:38,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:52:38,017 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 51 transitions. [2019-01-12 14:52:38,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-12 14:52:38,018 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:52:38,018 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:52:38,019 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:52:38,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:52:38,019 INFO L82 PathProgramCache]: Analyzing trace with hash 459341460, now seen corresponding path program 1 times [2019-01-12 14:52:38,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:52:38,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:52:38,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:38,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:52:38,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:38,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:52:38,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:52:38,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:52:38,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:52:38,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:52:38,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:52:38,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:52:38,204 INFO L87 Difference]: Start difference. First operand 36 states and 51 transitions. Second operand 3 states. [2019-01-12 14:52:38,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:52:38,262 INFO L93 Difference]: Finished difference Result 66 states and 96 transitions. [2019-01-12 14:52:38,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:52:38,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-01-12 14:52:38,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:52:38,264 INFO L225 Difference]: With dead ends: 66 [2019-01-12 14:52:38,264 INFO L226 Difference]: Without dead ends: 36 [2019-01-12 14:52:38,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:52:38,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-12 14:52:38,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-01-12 14:52:38,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-12 14:52:38,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2019-01-12 14:52:38,271 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 50 transitions. Word has length 24 [2019-01-12 14:52:38,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:52:38,272 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 50 transitions. [2019-01-12 14:52:38,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:52:38,272 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 50 transitions. [2019-01-12 14:52:38,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-12 14:52:38,273 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:52:38,273 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:52:38,273 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:52:38,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:52:38,274 INFO L82 PathProgramCache]: Analyzing trace with hash -179810352, now seen corresponding path program 1 times [2019-01-12 14:52:38,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:52:38,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:52:38,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:38,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:52:38,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:38,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:52:38,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:52:38,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:52:38,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:52:38,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:52:38,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:52:38,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:52:38,379 INFO L87 Difference]: Start difference. First operand 36 states and 50 transitions. Second operand 3 states. [2019-01-12 14:52:38,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:52:38,519 INFO L93 Difference]: Finished difference Result 89 states and 127 transitions. [2019-01-12 14:52:38,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:52:38,520 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-01-12 14:52:38,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:52:38,521 INFO L225 Difference]: With dead ends: 89 [2019-01-12 14:52:38,522 INFO L226 Difference]: Without dead ends: 59 [2019-01-12 14:52:38,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:52:38,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-12 14:52:38,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2019-01-12 14:52:38,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-12 14:52:38,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 80 transitions. [2019-01-12 14:52:38,533 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 80 transitions. Word has length 25 [2019-01-12 14:52:38,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:52:38,533 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 80 transitions. [2019-01-12 14:52:38,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:52:38,534 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 80 transitions. [2019-01-12 14:52:38,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-12 14:52:38,535 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:52:38,536 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:52:38,536 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:52:38,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:52:38,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1667839457, now seen corresponding path program 1 times [2019-01-12 14:52:38,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:52:38,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:52:38,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:38,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:52:38,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:38,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:52:38,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:52:38,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:52:38,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:52:38,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:52:38,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:52:38,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:52:38,652 INFO L87 Difference]: Start difference. First operand 57 states and 80 transitions. Second operand 5 states. [2019-01-12 14:52:38,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:52:38,777 INFO L93 Difference]: Finished difference Result 149 states and 209 transitions. [2019-01-12 14:52:38,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:52:38,778 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-01-12 14:52:38,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:52:38,779 INFO L225 Difference]: With dead ends: 149 [2019-01-12 14:52:38,780 INFO L226 Difference]: Without dead ends: 98 [2019-01-12 14:52:38,780 INFO L631 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-01-12 14:52:38,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-01-12 14:52:38,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 60. [2019-01-12 14:52:38,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-12 14:52:38,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 83 transitions. [2019-01-12 14:52:38,802 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 83 transitions. Word has length 31 [2019-01-12 14:52:38,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:52:38,802 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 83 transitions. [2019-01-12 14:52:38,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:52:38,803 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 83 transitions. [2019-01-12 14:52:38,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-12 14:52:38,808 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:52:38,808 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:52:38,808 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:52:38,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:52:38,809 INFO L82 PathProgramCache]: Analyzing trace with hash 540443364, now seen corresponding path program 1 times [2019-01-12 14:52:38,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:52:38,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:52:38,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:38,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:52:38,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:38,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:52:39,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:52:39,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:52:39,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:52:39,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:52:39,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:52:39,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:52:39,038 INFO L87 Difference]: Start difference. First operand 60 states and 83 transitions. Second operand 5 states. [2019-01-12 14:52:39,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:52:39,511 INFO L93 Difference]: Finished difference Result 314 states and 451 transitions. [2019-01-12 14:52:39,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 14:52:39,512 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-01-12 14:52:39,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:52:39,515 INFO L225 Difference]: With dead ends: 314 [2019-01-12 14:52:39,518 INFO L226 Difference]: Without dead ends: 260 [2019-01-12 14:52:39,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:52:39,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-01-12 14:52:39,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 106. [2019-01-12 14:52:39,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-12 14:52:39,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 144 transitions. [2019-01-12 14:52:39,543 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 144 transitions. Word has length 31 [2019-01-12 14:52:39,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:52:39,545 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 144 transitions. [2019-01-12 14:52:39,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:52:39,545 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 144 transitions. [2019-01-12 14:52:39,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-12 14:52:39,547 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:52:39,548 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:52:39,548 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:52:39,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:52:39,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1572316506, now seen corresponding path program 1 times [2019-01-12 14:52:39,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:52:39,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:52:39,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:39,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:52:39,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:39,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:52:39,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:52:39,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:52:39,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:52:39,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:52:39,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:52:39,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:52:39,795 INFO L87 Difference]: Start difference. First operand 106 states and 144 transitions. Second operand 5 states. [2019-01-12 14:52:40,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:52:40,968 INFO L93 Difference]: Finished difference Result 499 states and 704 transitions. [2019-01-12 14:52:40,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 14:52:40,969 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-01-12 14:52:40,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:52:40,973 INFO L225 Difference]: With dead ends: 499 [2019-01-12 14:52:40,973 INFO L226 Difference]: Without dead ends: 445 [2019-01-12 14:52:40,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:52:40,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2019-01-12 14:52:41,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 152. [2019-01-12 14:52:41,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-01-12 14:52:41,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 207 transitions. [2019-01-12 14:52:41,011 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 207 transitions. Word has length 32 [2019-01-12 14:52:41,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:52:41,013 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 207 transitions. [2019-01-12 14:52:41,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:52:41,013 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 207 transitions. [2019-01-12 14:52:41,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-12 14:52:41,016 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:52:41,016 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:52:41,016 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:52:41,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:52:41,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1711533540, now seen corresponding path program 1 times [2019-01-12 14:52:41,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:52:41,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:52:41,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:41,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:52:41,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:41,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:52:41,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:52:41,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:52:41,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:52:41,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 14:52:41,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 14:52:41,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 14:52:41,187 INFO L87 Difference]: Start difference. First operand 152 states and 207 transitions. Second operand 4 states. [2019-01-12 14:52:41,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:52:41,498 INFO L93 Difference]: Finished difference Result 352 states and 487 transitions. [2019-01-12 14:52:41,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 14:52:41,499 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-01-12 14:52:41,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:52:41,501 INFO L225 Difference]: With dead ends: 352 [2019-01-12 14:52:41,502 INFO L226 Difference]: Without dead ends: 250 [2019-01-12 14:52:41,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:52:41,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-01-12 14:52:41,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 149. [2019-01-12 14:52:41,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-01-12 14:52:41,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 203 transitions. [2019-01-12 14:52:41,541 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 203 transitions. Word has length 32 [2019-01-12 14:52:41,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:52:41,542 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 203 transitions. [2019-01-12 14:52:41,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 14:52:41,542 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 203 transitions. [2019-01-12 14:52:41,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-12 14:52:41,546 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:52:41,546 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:52:41,546 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:52:41,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:52:41,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1197872225, now seen corresponding path program 1 times [2019-01-12 14:52:41,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:52:41,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:52:41,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:41,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:52:41,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:41,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:52:41,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:52:41,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:52:41,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:52:41,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:52:41,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:52:41,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:52:41,818 INFO L87 Difference]: Start difference. First operand 149 states and 203 transitions. Second operand 5 states. [2019-01-12 14:52:42,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:52:42,219 INFO L93 Difference]: Finished difference Result 351 states and 489 transitions. [2019-01-12 14:52:42,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 14:52:42,221 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-01-12 14:52:42,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:52:42,222 INFO L225 Difference]: With dead ends: 351 [2019-01-12 14:52:42,222 INFO L226 Difference]: Without dead ends: 90 [2019-01-12 14:52:42,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 14:52:42,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-01-12 14:52:42,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 60. [2019-01-12 14:52:42,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-12 14:52:42,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 76 transitions. [2019-01-12 14:52:42,240 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 76 transitions. Word has length 32 [2019-01-12 14:52:42,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:52:42,240 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 76 transitions. [2019-01-12 14:52:42,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:52:42,240 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 76 transitions. [2019-01-12 14:52:42,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-12 14:52:42,243 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:52:42,243 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:52:42,244 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:52:42,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:52:42,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1969698978, now seen corresponding path program 1 times [2019-01-12 14:52:42,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:52:42,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:52:42,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:42,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:52:42,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:42,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:52:42,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:52:42,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:52:42,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:52:42,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:52:42,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:52:42,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:52:42,509 INFO L87 Difference]: Start difference. First operand 60 states and 76 transitions. Second operand 5 states. [2019-01-12 14:52:42,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:52:42,629 INFO L93 Difference]: Finished difference Result 103 states and 131 transitions. [2019-01-12 14:52:42,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 14:52:42,632 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-01-12 14:52:42,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:52:42,633 INFO L225 Difference]: With dead ends: 103 [2019-01-12 14:52:42,633 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 14:52:42,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 14:52:42,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 14:52:42,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 14:52:42,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 14:52:42,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 14:52:42,636 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2019-01-12 14:52:42,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:52:42,643 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 14:52:42,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:52:42,643 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 14:52:42,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 14:52:42,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 14:52:42,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:42,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:42,814 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 71 [2019-01-12 14:52:42,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:42,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:42,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:42,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:42,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:42,955 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 71 [2019-01-12 14:52:42,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:42,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:42,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:42,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:43,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:43,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:43,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:43,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:43,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:43,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:43,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:43,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:43,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:43,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:43,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:43,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:43,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:43,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:43,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:43,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:43,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:43,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:45,214 WARN L181 SmtUtils]: Spent 1.78 s on a formula simplification. DAG size of input: 69 DAG size of output: 15 [2019-01-12 14:52:45,712 WARN L181 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 15 [2019-01-12 14:52:46,073 WARN L181 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 24 [2019-01-12 14:52:46,234 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 19 [2019-01-12 14:52:46,535 WARN L181 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 15 [2019-01-12 14:52:46,686 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 20 [2019-01-12 14:52:47,001 WARN L181 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 15 [2019-01-12 14:52:47,156 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 18 [2019-01-12 14:52:47,160 INFO L448 ceAbstractionStarter]: For program point L85(lines 85 98) no Hoare annotation was computed. [2019-01-12 14:52:47,160 INFO L444 ceAbstractionStarter]: At program point L234(lines 234 240) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (= ~systemActive~0 1))) (or (and (= ULTIMATE.start_isHighWaterLevel_~tmp~3 0) (= 1 ~pumpRunning~0) (and .cse0 .cse1)) (and (and (= ULTIMATE.start_processEnvironment_~tmp~2 0) .cse0 (= ~pumpRunning~0 0) .cse1) (<= ~waterLevel~0 1)))) [2019-01-12 14:52:47,161 INFO L444 ceAbstractionStarter]: At program point L234-1(lines 234 240) the Hoare annotation is: false [2019-01-12 14:52:47,161 INFO L444 ceAbstractionStarter]: At program point L234-2(lines 234 240) the Hoare annotation is: false [2019-01-12 14:52:47,161 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 14:52:47,161 INFO L448 ceAbstractionStarter]: For program point L763(lines 763 776) no Hoare annotation was computed. [2019-01-12 14:52:47,161 INFO L444 ceAbstractionStarter]: At program point L763-1(lines 1 918) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (= ~systemActive~0 1))) (or (and (and (= ULTIMATE.start_isHighWaterLevel_~tmp~3 0) (and .cse0 .cse1)) (= 1 ~pumpRunning~0)) (and .cse0 (<= ~waterLevel~0 1) (= ~pumpRunning~0 0) .cse1))) [2019-01-12 14:52:47,161 INFO L448 ceAbstractionStarter]: For program point L763-2(lines 763 776) no Hoare annotation was computed. [2019-01-12 14:52:47,161 INFO L444 ceAbstractionStarter]: At program point L763-3(lines 1 918) the Hoare annotation is: false [2019-01-12 14:52:47,162 INFO L448 ceAbstractionStarter]: For program point L763-4(lines 763 776) no Hoare annotation was computed. [2019-01-12 14:52:47,162 INFO L444 ceAbstractionStarter]: At program point L763-5(lines 1 918) the Hoare annotation is: false [2019-01-12 14:52:47,162 INFO L444 ceAbstractionStarter]: At program point L879(lines 870 883) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (= ~pumpRunning~0 0)) (.cse2 (= ~systemActive~0 1))) (or (and .cse0 (= 0 |ULTIMATE.start_isHighWaterSensorDry_#res|) .cse1 .cse2) (and .cse0 (<= ~waterLevel~0 1) .cse1 .cse2))) [2019-01-12 14:52:47,162 INFO L444 ceAbstractionStarter]: At program point L367(lines 352 370) the Hoare annotation is: (let ((.cse2 (<= ~waterLevel~0 1)) (.cse0 (= ULTIMATE.start_isHighWaterLevel_~tmp~3 0)) (.cse1 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse3 (= ~pumpRunning~0 0)) (.cse4 (= ~systemActive~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (= 0 |ULTIMATE.start_isHighWaterLevel_#res|) (= 0 ULTIMATE.start_isHighWaterLevel_~tmp___0~1) .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 (= 0 |ULTIMATE.start_isHighWaterSensorDry_#res|) (= 1 |ULTIMATE.start_isHighWaterLevel_#res|) .cse3 .cse4 (= 1 ULTIMATE.start_isHighWaterLevel_~tmp___0~1)))) [2019-01-12 14:52:47,162 INFO L444 ceAbstractionStarter]: At program point L879-1(lines 870 883) the Hoare annotation is: false [2019-01-12 14:52:47,162 INFO L444 ceAbstractionStarter]: At program point L367-1(lines 352 370) the Hoare annotation is: false [2019-01-12 14:52:47,163 INFO L444 ceAbstractionStarter]: At program point L879-2(lines 870 883) the Hoare annotation is: false [2019-01-12 14:52:47,163 INFO L444 ceAbstractionStarter]: At program point L367-2(lines 352 370) the Hoare annotation is: false [2019-01-12 14:52:47,163 INFO L444 ceAbstractionStarter]: At program point L103(lines 54 104) the Hoare annotation is: false [2019-01-12 14:52:47,163 INFO L448 ceAbstractionStarter]: For program point L797(lines 797 801) no Hoare annotation was computed. [2019-01-12 14:52:47,163 INFO L448 ceAbstractionStarter]: For program point L797-3(lines 797 801) no Hoare annotation was computed. [2019-01-12 14:52:47,163 INFO L448 ceAbstractionStarter]: For program point L797-6(lines 797 801) no Hoare annotation was computed. [2019-01-12 14:52:47,163 INFO L448 ceAbstractionStarter]: For program point L56(lines 55 102) no Hoare annotation was computed. [2019-01-12 14:52:47,164 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 786) no Hoare annotation was computed. [2019-01-12 14:52:47,164 INFO L444 ceAbstractionStarter]: At program point L915(lines 910 918) the Hoare annotation is: (and (= 1 ~waterLevel~0) (= ~pumpRunning~0 0) (= ~systemActive~0 1)) [2019-01-12 14:52:47,164 INFO L444 ceAbstractionStarter]: At program point L172(lines 168 174) the Hoare annotation is: (and (= 1 ~waterLevel~0) (= ~pumpRunning~0 0) (= ~systemActive~0 1)) [2019-01-12 14:52:47,164 INFO L444 ceAbstractionStarter]: At program point L866(lines 861 869) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (= ~systemActive~0 1))) (or (and (= ULTIMATE.start_isHighWaterLevel_~tmp~3 0) .cse0 (= 1 ~pumpRunning~0) .cse1) (and (= ULTIMATE.start_processEnvironment_~tmp~2 0) .cse0 (<= ~waterLevel~0 1) (not (= |ULTIMATE.start_getWaterLevel_#res| 2)) (= ~pumpRunning~0 0) .cse1))) [2019-01-12 14:52:47,164 INFO L444 ceAbstractionStarter]: At program point L866-1(lines 861 869) the Hoare annotation is: false [2019-01-12 14:52:47,164 INFO L444 ceAbstractionStarter]: At program point L866-2(lines 861 869) the Hoare annotation is: false [2019-01-12 14:52:47,165 INFO L448 ceAbstractionStarter]: For program point L767(lines 767 773) no Hoare annotation was computed. [2019-01-12 14:52:47,165 INFO L448 ceAbstractionStarter]: For program point L767-2(lines 767 773) no Hoare annotation was computed. [2019-01-12 14:52:47,165 INFO L448 ceAbstractionStarter]: For program point L767-4(lines 767 773) no Hoare annotation was computed. [2019-01-12 14:52:47,165 INFO L448 ceAbstractionStarter]: For program point L57(lines 57 61) no Hoare annotation was computed. [2019-01-12 14:52:47,165 INFO L444 ceAbstractionStarter]: At program point L123-2(lines 123 137) the Hoare annotation is: false [2019-01-12 14:52:47,165 INFO L444 ceAbstractionStarter]: At program point L834(lines 829 837) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (= ~systemActive~0 1))) (or (and (= ULTIMATE.start_processEnvironment_~tmp~2 0) .cse0 (<= ~waterLevel~0 1) (= ~pumpRunning~0 0) .cse1) (and (= 1 ~pumpRunning~0) (and (= ULTIMATE.start_isHighWaterLevel_~tmp~3 0) .cse0 .cse1)))) [2019-01-12 14:52:47,168 INFO L444 ceAbstractionStarter]: At program point L834-1(lines 829 837) the Hoare annotation is: false [2019-01-12 14:52:47,168 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 14:52:47,169 INFO L444 ceAbstractionStarter]: At program point L834-2(lines 829 837) the Hoare annotation is: false [2019-01-12 14:52:47,169 INFO L448 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-01-12 14:52:47,169 INFO L451 ceAbstractionStarter]: At program point L207(lines 188 210) the Hoare annotation is: true [2019-01-12 14:52:47,169 INFO L448 ceAbstractionStarter]: For program point L75(lines 75 81) no Hoare annotation was computed. [2019-01-12 14:52:47,169 INFO L444 ceAbstractionStarter]: At program point L75-1(lines 75 81) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (= ~systemActive~0 1))) (or (and .cse0 (= ~pumpRunning~0 0) .cse1) (and (= ULTIMATE.start_isHighWaterLevel_~tmp~3 0) (= 1 ~pumpRunning~0) (and .cse0 .cse1)))) [2019-01-12 14:52:47,169 INFO L448 ceAbstractionStarter]: For program point L786(line 786) no Hoare annotation was computed. [2019-01-12 14:52:47,169 INFO L448 ceAbstractionStarter]: For program point L786-1(line 786) no Hoare annotation was computed. [2019-01-12 14:52:47,169 INFO L448 ceAbstractionStarter]: For program point L786-2(line 786) no Hoare annotation was computed. [2019-01-12 14:52:47,170 INFO L448 ceAbstractionStarter]: For program point L93(lines 93 97) no Hoare annotation was computed. [2019-01-12 14:52:47,170 INFO L444 ceAbstractionStarter]: At program point L93-2(lines 227 233) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (= ~systemActive~0 1))) (or (and .cse0 (= ~pumpRunning~0 0) .cse1) (and (= ULTIMATE.start_isHighWaterLevel_~tmp~3 0) (= 1 ~pumpRunning~0) (and .cse0 .cse1)))) [2019-01-12 14:52:47,170 INFO L448 ceAbstractionStarter]: For program point L259(lines 259 276) no Hoare annotation was computed. [2019-01-12 14:52:47,170 INFO L448 ceAbstractionStarter]: For program point L259-1(lines 259 276) no Hoare annotation was computed. [2019-01-12 14:52:47,170 INFO L448 ceAbstractionStarter]: For program point L259-2(lines 259 276) no Hoare annotation was computed. [2019-01-12 14:52:47,170 INFO L448 ceAbstractionStarter]: For program point L127(lines 127 131) no Hoare annotation was computed. [2019-01-12 14:52:47,170 INFO L448 ceAbstractionStarter]: For program point L127-1(lines 227 233) no Hoare annotation was computed. [2019-01-12 14:52:47,171 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 14:52:47,176 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 786) no Hoare annotation was computed. [2019-01-12 14:52:47,176 INFO L448 ceAbstractionStarter]: For program point L821(lines 821 825) no Hoare annotation was computed. [2019-01-12 14:52:47,176 INFO L444 ceAbstractionStarter]: At program point L227(lines 226 245) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (= ~systemActive~0 1))) (or (and .cse0 (= ~pumpRunning~0 0) .cse1) (and (= ULTIMATE.start_isHighWaterLevel_~tmp~3 0) (= 1 ~pumpRunning~0) (and .cse0 .cse1)))) [2019-01-12 14:52:47,176 INFO L448 ceAbstractionStarter]: For program point L227-1(lines 227 233) no Hoare annotation was computed. [2019-01-12 14:52:47,176 INFO L444 ceAbstractionStarter]: At program point L227-2(lines 226 245) the Hoare annotation is: false [2019-01-12 14:52:47,177 INFO L444 ceAbstractionStarter]: At program point L227-3(lines 226 245) the Hoare annotation is: false [2019-01-12 14:52:47,177 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 786) no Hoare annotation was computed. [2019-01-12 14:52:47,177 INFO L448 ceAbstractionStarter]: For program point L757(lines 757 777) no Hoare annotation was computed. [2019-01-12 14:52:47,177 INFO L448 ceAbstractionStarter]: For program point L757-2(lines 757 777) no Hoare annotation was computed. [2019-01-12 14:52:47,177 INFO L448 ceAbstractionStarter]: For program point L757-4(lines 757 777) no Hoare annotation was computed. [2019-01-12 14:52:47,177 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 365) no Hoare annotation was computed. [2019-01-12 14:52:47,177 INFO L448 ceAbstractionStarter]: For program point L361-2(lines 361 365) no Hoare annotation was computed. [2019-01-12 14:52:47,177 INFO L448 ceAbstractionStarter]: For program point L361-3(lines 361 365) no Hoare annotation was computed. [2019-01-12 14:52:47,177 INFO L448 ceAbstractionStarter]: For program point L361-5(lines 361 365) no Hoare annotation was computed. [2019-01-12 14:52:47,178 INFO L448 ceAbstractionStarter]: For program point L361-6(lines 361 365) no Hoare annotation was computed. [2019-01-12 14:52:47,178 INFO L448 ceAbstractionStarter]: For program point L361-8(lines 361 365) no Hoare annotation was computed. [2019-01-12 14:52:47,178 INFO L444 ceAbstractionStarter]: At program point L312(lines 307 315) the Hoare annotation is: (and (= ULTIMATE.start_isHighWaterLevel_~tmp~3 0) (= ULTIMATE.start_test_~splverifierCounter~0 0) (= 1 ~pumpRunning~0) (= 1 |ULTIMATE.start_isPumpRunning_#res|) (= ~systemActive~0 1)) [2019-01-12 14:52:47,178 INFO L444 ceAbstractionStarter]: At program point L312-1(lines 307 315) the Hoare annotation is: false [2019-01-12 14:52:47,178 INFO L444 ceAbstractionStarter]: At program point L312-2(lines 307 315) the Hoare annotation is: false [2019-01-12 14:52:47,178 INFO L444 ceAbstractionStarter]: At program point L907(lines 1 918) the Hoare annotation is: (and (= 1 ~waterLevel~0) (= ~pumpRunning~0 0) (= ~systemActive~0 1)) [2019-01-12 14:52:47,178 INFO L448 ceAbstractionStarter]: For program point L874(lines 874 880) no Hoare annotation was computed. [2019-01-12 14:52:47,178 INFO L448 ceAbstractionStarter]: For program point L874-1(lines 874 880) no Hoare annotation was computed. [2019-01-12 14:52:47,179 INFO L448 ceAbstractionStarter]: For program point L874-2(lines 874 880) no Hoare annotation was computed. [2019-01-12 14:52:47,182 INFO L448 ceAbstractionStarter]: For program point L263(lines 263 271) no Hoare annotation was computed. [2019-01-12 14:52:47,182 INFO L448 ceAbstractionStarter]: For program point L263-1(lines 263 271) no Hoare annotation was computed. [2019-01-12 14:52:47,182 INFO L448 ceAbstractionStarter]: For program point L263-2(lines 263 271) no Hoare annotation was computed. [2019-01-12 14:52:47,182 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 71) no Hoare annotation was computed. [2019-01-12 14:52:47,182 INFO L444 ceAbstractionStarter]: At program point L65-1(lines 65 71) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (= ~systemActive~0 1))) (or (and .cse0 (= ~pumpRunning~0 0) .cse1) (and (= ULTIMATE.start_isHighWaterLevel_~tmp~3 0) (= 1 ~pumpRunning~0) (and .cse0 .cse1)))) [2019-01-12 14:52:47,183 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 14:52:47,183 INFO L448 ceAbstractionStarter]: For program point L809(lines 809 813) no Hoare annotation was computed. [2019-01-12 14:52:47,183 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 205) no Hoare annotation was computed. [2019-01-12 14:52:47,183 INFO L451 ceAbstractionStarter]: At program point L198-1(lines 198 205) the Hoare annotation is: true [2019-01-12 14:52:47,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 02:52:47 BoogieIcfgContainer [2019-01-12 14:52:47,208 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 14:52:47,208 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 14:52:47,208 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 14:52:47,208 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 14:52:47,210 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:52:37" (3/4) ... [2019-01-12 14:52:47,214 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 14:52:47,239 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 38 nodes and edges [2019-01-12 14:52:47,240 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2019-01-12 14:52:47,243 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-01-12 14:52:47,244 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-12 14:52:47,245 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 14:52:47,245 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-12 14:52:47,274 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((splverifierCounter == 0 && 0 == \result) && pumpRunning == 0) && systemActive == 1) || (((splverifierCounter == 0 && waterLevel <= 1) && pumpRunning == 0) && systemActive == 1) [2019-01-12 14:52:47,274 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((tmp == 0 && splverifierCounter == 0) && 1 == pumpRunning) && systemActive == 1) || (((((tmp == 0 && splverifierCounter == 0) && waterLevel <= 1) && !(\result == 2)) && pumpRunning == 0) && systemActive == 1) [2019-01-12 14:52:47,275 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((tmp == 0 && splverifierCounter == 0) && waterLevel <= 1) && pumpRunning == 0) && systemActive == 1) || (((((0 == \result && 0 == tmp___0) && splverifierCounter == 0) && waterLevel <= 1) && pumpRunning == 0) && systemActive == 1)) || ((((((tmp == 0 && splverifierCounter == 0) && 0 == \result) && 1 == \result) && pumpRunning == 0) && systemActive == 1) && 1 == tmp___0) [2019-01-12 14:52:47,275 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((tmp == 0 && splverifierCounter == 0) && 1 == pumpRunning) && 1 == \result) && systemActive == 1 [2019-01-12 14:52:47,361 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 14:52:47,361 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 14:52:47,362 INFO L168 Benchmark]: Toolchain (without parser) took 12183.56 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 221.8 MB). Free memory was 946.0 MB in the beginning and 842.2 MB in the end (delta: 103.8 MB). Peak memory consumption was 325.6 MB. Max. memory is 11.5 GB. [2019-01-12 14:52:47,364 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:52:47,364 INFO L168 Benchmark]: CACSL2BoogieTranslator took 682.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -182.5 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. [2019-01-12 14:52:47,364 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:52:47,365 INFO L168 Benchmark]: Boogie Preprocessor took 59.93 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:52:47,365 INFO L168 Benchmark]: RCFGBuilder took 1294.08 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: 59.2 MB). Peak memory consumption was 59.2 MB. Max. memory is 11.5 GB. [2019-01-12 14:52:47,365 INFO L168 Benchmark]: TraceAbstraction took 9909.01 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 79.2 MB). Free memory was 1.1 GB in the beginning and 858.5 MB in the end (delta: 204.0 MB). Peak memory consumption was 283.1 MB. Max. memory is 11.5 GB. [2019-01-12 14:52:47,366 INFO L168 Benchmark]: Witness Printer took 153.50 ms. Allocated memory is still 1.3 GB. Free memory was 858.5 MB in the beginning and 842.2 MB in the end (delta: 16.3 MB). Peak memory consumption was 16.3 MB. Max. memory is 11.5 GB. [2019-01-12 14:52:47,370 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 682.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -182.5 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 79.78 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. * Boogie Preprocessor took 59.93 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 1294.08 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: 59.2 MB). Peak memory consumption was 59.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9909.01 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 79.2 MB). Free memory was 1.1 GB in the beginning and 858.5 MB in the end (delta: 204.0 MB). Peak memory consumption was 283.1 MB. Max. memory is 11.5 GB. * Witness Printer took 153.50 ms. Allocated memory is still 1.3 GB. Free memory was 858.5 MB in the beginning and 842.2 MB in the end (delta: 16.3 MB). Peak memory consumption was 16.3 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: ((splverifierCounter == 0 && pumpRunning == 0) && systemActive == 1) || ((tmp == 0 && 1 == pumpRunning) && splverifierCounter == 0 && systemActive == 1) - InvariantResult [Line: 307]: Loop Invariant Derived loop invariant: (((tmp == 0 && splverifierCounter == 0) && 1 == pumpRunning) && 1 == \result) && systemActive == 1 - 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: (((tmp == 0 && splverifierCounter == 0) && 1 == pumpRunning) && systemActive == 1) || (((((tmp == 0 && splverifierCounter == 0) && waterLevel <= 1) && !(\result == 2)) && pumpRunning == 0) && systemActive == 1) - 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: ((splverifierCounter == 0 && pumpRunning == 0) && systemActive == 1) || ((tmp == 0 && 1 == pumpRunning) && splverifierCounter == 0 && systemActive == 1) - InvariantResult [Line: 870]: Loop Invariant Derived loop invariant: (((splverifierCounter == 0 && 0 == \result) && pumpRunning == 0) && systemActive == 1) || (((splverifierCounter == 0 && waterLevel <= 1) && pumpRunning == 0) && systemActive == 1) - InvariantResult [Line: 352]: Loop Invariant Derived loop invariant: (((((tmp == 0 && splverifierCounter == 0) && waterLevel <= 1) && pumpRunning == 0) && systemActive == 1) || (((((0 == \result && 0 == tmp___0) && splverifierCounter == 0) && waterLevel <= 1) && pumpRunning == 0) && systemActive == 1)) || ((((((tmp == 0 && splverifierCounter == 0) && 0 == \result) && 1 == \result) && pumpRunning == 0) && systemActive == 1) && 1 == tmp___0) - 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: ((((tmp == 0 && splverifierCounter == 0) && waterLevel <= 1) && pumpRunning == 0) && systemActive == 1) || (1 == pumpRunning && (tmp == 0 && splverifierCounter == 0) && systemActive == 1) - 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 == waterLevel && pumpRunning == 0) && systemActive == 1 - InvariantResult [Line: 829]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: ((splverifierCounter == 0 && pumpRunning == 0) && systemActive == 1) || ((tmp == 0 && 1 == pumpRunning) && splverifierCounter == 0 && systemActive == 1) - InvariantResult [Line: 234]: Loop Invariant Derived loop invariant: ((tmp == 0 && 1 == pumpRunning) && splverifierCounter == 0 && systemActive == 1) || ((((tmp == 0 && splverifierCounter == 0) && pumpRunning == 0) && systemActive == 1) && waterLevel <= 1) - InvariantResult [Line: 910]: Loop Invariant Derived loop invariant: (1 == waterLevel && pumpRunning == 0) && systemActive == 1 - 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 == waterLevel && pumpRunning == 0) && systemActive == 1 - InvariantResult [Line: 226]: Loop Invariant Derived loop invariant: ((splverifierCounter == 0 && pumpRunning == 0) && systemActive == 1) || ((tmp == 0 && 1 == pumpRunning) && splverifierCounter == 0 && systemActive == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((tmp == 0 && splverifierCounter == 0 && systemActive == 1) && 1 == pumpRunning) || (((splverifierCounter == 0 && waterLevel <= 1) && pumpRunning == 0) && systemActive == 1) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 84 locations, 3 error locations. SAFE Result, 9.8s OverallTime, 10 OverallIterations, 1 TraceHistogramMax, 2.9s AutomataDifference, 0.0s DeadEndRemovalTime, 4.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 745 SDtfs, 823 SDslu, 1116 SDs, 0 SdLazy, 168 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 618 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 34 LocationsWithAnnotation, 34 PreInvPairs, 101 NumberOfFragments, 377 HoareAnnotationTreeSize, 34 FomulaSimplifications, 22252 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 34 FomulaSimplificationsInter, 7623 FormulaSimplificationTreeSizeReductionInter, 3.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.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, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...