./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec1_product42_false-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_spec1_product42_false-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 0f3978068d3e88eb2e8d08ee6f85f2ba09bbc729 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 14:46:16,126 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 14:46:16,128 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 14:46:16,145 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 14:46:16,146 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 14:46:16,148 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 14:46:16,149 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 14:46:16,152 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 14:46:16,154 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 14:46:16,157 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 14:46:16,160 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 14:46:16,161 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 14:46:16,162 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 14:46:16,163 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 14:46:16,164 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 14:46:16,168 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 14:46:16,169 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 14:46:16,176 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 14:46:16,181 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 14:46:16,183 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 14:46:16,184 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 14:46:16,186 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 14:46:16,189 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 14:46:16,191 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 14:46:16,192 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 14:46:16,193 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 14:46:16,194 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 14:46:16,195 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 14:46:16,195 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 14:46:16,196 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 14:46:16,196 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 14:46:16,197 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 14:46:16,197 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 14:46:16,197 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 14:46:16,198 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 14:46:16,199 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 14:46:16,199 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:46:16,216 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 14:46:16,216 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 14:46:16,221 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 14:46:16,222 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 14:46:16,222 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 14:46:16,222 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 14:46:16,223 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 14:46:16,224 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 14:46:16,224 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 14:46:16,224 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 14:46:16,224 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 14:46:16,224 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 14:46:16,225 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 14:46:16,225 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 14:46:16,225 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 14:46:16,226 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 14:46:16,226 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 14:46:16,226 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 14:46:16,226 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 14:46:16,226 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 14:46:16,227 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 14:46:16,227 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:46:16,227 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 14:46:16,227 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 14:46:16,227 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 14:46:16,227 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 14:46:16,228 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 14:46:16,231 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 14:46:16,231 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 -> 0f3978068d3e88eb2e8d08ee6f85f2ba09bbc729 [2019-01-12 14:46:16,282 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 14:46:16,294 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 14:46:16,300 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 14:46:16,302 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 14:46:16,302 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 14:46:16,303 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec1_product42_false-unreach-call_false-termination.cil.c [2019-01-12 14:46:16,368 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f46adce1/4fab474882a745a3827283f0be19ade7/FLAGa3524db0e [2019-01-12 14:46:16,910 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 14:46:16,914 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec1_product42_false-unreach-call_false-termination.cil.c [2019-01-12 14:46:16,942 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f46adce1/4fab474882a745a3827283f0be19ade7/FLAGa3524db0e [2019-01-12 14:46:17,185 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f46adce1/4fab474882a745a3827283f0be19ade7 [2019-01-12 14:46:17,190 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 14:46:17,192 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 14:46:17,193 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 14:46:17,193 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 14:46:17,197 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 14:46:17,198 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:46:17" (1/1) ... [2019-01-12 14:46:17,201 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d680728 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:17, skipping insertion in model container [2019-01-12 14:46:17,201 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:46:17" (1/1) ... [2019-01-12 14:46:17,212 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 14:46:17,291 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 14:46:17,710 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:46:17,725 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 14:46:17,930 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:46:17,972 INFO L195 MainTranslator]: Completed translation [2019-01-12 14:46:17,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:17 WrapperNode [2019-01-12 14:46:17,972 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 14:46:17,973 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 14:46:17,973 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 14:46:17,973 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 14:46:17,982 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:46:17" (1/1) ... [2019-01-12 14:46:18,002 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:17" (1/1) ... [2019-01-12 14:46:18,046 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 14:46:18,046 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 14:46:18,046 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 14:46:18,047 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 14:46:18,059 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:17" (1/1) ... [2019-01-12 14:46:18,060 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:17" (1/1) ... [2019-01-12 14:46:18,071 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:17" (1/1) ... [2019-01-12 14:46:18,071 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:17" (1/1) ... [2019-01-12 14:46:18,086 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:17" (1/1) ... [2019-01-12 14:46:18,094 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:17" (1/1) ... [2019-01-12 14:46:18,097 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:17" (1/1) ... [2019-01-12 14:46:18,101 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 14:46:18,101 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 14:46:18,102 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 14:46:18,102 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 14:46:18,102 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:17" (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:46:18,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 14:46:18,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-12 14:46:18,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 14:46:18,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 14:46:19,459 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 14:46:19,459 INFO L286 CfgBuilder]: Removed 116 assue(true) statements. [2019-01-12 14:46:19,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:46:19 BoogieIcfgContainer [2019-01-12 14:46:19,461 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 14:46:19,462 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 14:46:19,462 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 14:46:19,465 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 14:46:19,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 02:46:17" (1/3) ... [2019-01-12 14:46:19,466 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@604b22f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:46:19, skipping insertion in model container [2019-01-12 14:46:19,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:46:17" (2/3) ... [2019-01-12 14:46:19,466 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@604b22f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:46:19, skipping insertion in model container [2019-01-12 14:46:19,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:46:19" (3/3) ... [2019-01-12 14:46:19,469 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product42_false-unreach-call_false-termination.cil.c [2019-01-12 14:46:19,478 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 14:46:19,488 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-12 14:46:19,505 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-12 14:46:19,537 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 14:46:19,538 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 14:46:19,538 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 14:46:19,538 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 14:46:19,539 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 14:46:19,539 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 14:46:19,539 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 14:46:19,539 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 14:46:19,539 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 14:46:19,566 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2019-01-12 14:46:19,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-12 14:46:19,573 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:19,574 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:46:19,576 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:19,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:19,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1594902839, now seen corresponding path program 1 times [2019-01-12 14:46:19,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:19,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:19,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:19,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:19,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:19,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:19,833 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:46:19,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:19,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:46:19,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 14:46:19,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 14:46:19,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 14:46:19,851 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 2 states. [2019-01-12 14:46:19,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:19,883 INFO L93 Difference]: Finished difference Result 168 states and 251 transitions. [2019-01-12 14:46:19,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 14:46:19,885 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-01-12 14:46:19,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:19,897 INFO L225 Difference]: With dead ends: 168 [2019-01-12 14:46:19,898 INFO L226 Difference]: Without dead ends: 83 [2019-01-12 14:46:19,901 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:46:19,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-12 14:46:19,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-01-12 14:46:19,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-12 14:46:19,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 117 transitions. [2019-01-12 14:46:19,948 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 117 transitions. Word has length 16 [2019-01-12 14:46:19,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:19,948 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 117 transitions. [2019-01-12 14:46:19,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 14:46:19,948 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 117 transitions. [2019-01-12 14:46:19,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-12 14:46:19,950 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:19,950 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:46:19,950 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:19,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:19,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1653307560, now seen corresponding path program 1 times [2019-01-12 14:46:19,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:19,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:19,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:19,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:19,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:19,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:20,094 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:46:20,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:20,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:46:20,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:46:20,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:46:20,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:46:20,101 INFO L87 Difference]: Start difference. First operand 83 states and 117 transitions. Second operand 3 states. [2019-01-12 14:46:20,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:20,131 INFO L93 Difference]: Finished difference Result 83 states and 117 transitions. [2019-01-12 14:46:20,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:46:20,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-01-12 14:46:20,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:20,133 INFO L225 Difference]: With dead ends: 83 [2019-01-12 14:46:20,133 INFO L226 Difference]: Without dead ends: 37 [2019-01-12 14:46:20,134 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:46:20,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-12 14:46:20,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-01-12 14:46:20,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-12 14:46:20,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 52 transitions. [2019-01-12 14:46:20,146 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 52 transitions. Word has length 17 [2019-01-12 14:46:20,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:20,147 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 52 transitions. [2019-01-12 14:46:20,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:46:20,147 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 52 transitions. [2019-01-12 14:46:20,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-12 14:46:20,148 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:20,148 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] [2019-01-12 14:46:20,149 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:20,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:20,150 INFO L82 PathProgramCache]: Analyzing trace with hash 533078269, now seen corresponding path program 1 times [2019-01-12 14:46:20,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:20,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:20,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:20,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:20,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:20,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:20,332 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:46:20,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:20,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:46:20,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:46:20,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:46:20,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:46:20,334 INFO L87 Difference]: Start difference. First operand 37 states and 52 transitions. Second operand 5 states. [2019-01-12 14:46:20,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:20,421 INFO L93 Difference]: Finished difference Result 68 states and 98 transitions. [2019-01-12 14:46:20,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 14:46:20,423 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-01-12 14:46:20,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:20,424 INFO L225 Difference]: With dead ends: 68 [2019-01-12 14:46:20,424 INFO L226 Difference]: Without dead ends: 37 [2019-01-12 14:46:20,425 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:46:20,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-12 14:46:20,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-01-12 14:46:20,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-12 14:46:20,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2019-01-12 14:46:20,432 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 22 [2019-01-12 14:46:20,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:20,432 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2019-01-12 14:46:20,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:46:20,433 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2019-01-12 14:46:20,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-12 14:46:20,433 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:20,434 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] [2019-01-12 14:46:20,434 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:20,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:20,435 INFO L82 PathProgramCache]: Analyzing trace with hash 545820985, now seen corresponding path program 1 times [2019-01-12 14:46:20,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:20,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:20,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:20,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:20,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:20,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:20,539 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:46:20,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:20,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:46:20,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:46:20,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:46:20,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:46:20,542 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 3 states. [2019-01-12 14:46:20,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:20,673 INFO L93 Difference]: Finished difference Result 89 states and 126 transitions. [2019-01-12 14:46:20,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:46:20,674 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-01-12 14:46:20,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:20,675 INFO L225 Difference]: With dead ends: 89 [2019-01-12 14:46:20,675 INFO L226 Difference]: Without dead ends: 58 [2019-01-12 14:46:20,676 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:46:20,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-12 14:46:20,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2019-01-12 14:46:20,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-12 14:46:20,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 78 transitions. [2019-01-12 14:46:20,686 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 78 transitions. Word has length 23 [2019-01-12 14:46:20,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:20,687 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 78 transitions. [2019-01-12 14:46:20,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:46:20,687 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 78 transitions. [2019-01-12 14:46:20,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-12 14:46:20,688 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:20,688 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] [2019-01-12 14:46:20,689 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:20,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:20,689 INFO L82 PathProgramCache]: Analyzing trace with hash 2110814541, now seen corresponding path program 1 times [2019-01-12 14:46:20,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:20,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:20,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:20,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:20,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:20,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:20,831 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:46:20,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:20,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:46:20,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:46:20,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:46:20,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:46:20,832 INFO L87 Difference]: Start difference. First operand 56 states and 78 transitions. Second operand 5 states. [2019-01-12 14:46:21,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:21,115 INFO L93 Difference]: Finished difference Result 266 states and 385 transitions. [2019-01-12 14:46:21,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 14:46:21,117 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-01-12 14:46:21,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:21,120 INFO L225 Difference]: With dead ends: 266 [2019-01-12 14:46:21,121 INFO L226 Difference]: Without dead ends: 216 [2019-01-12 14:46:21,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:46:21,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-01-12 14:46:21,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 100. [2019-01-12 14:46:21,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-12 14:46:21,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 139 transitions. [2019-01-12 14:46:21,149 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 139 transitions. Word has length 29 [2019-01-12 14:46:21,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:21,152 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 139 transitions. [2019-01-12 14:46:21,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:46:21,152 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 139 transitions. [2019-01-12 14:46:21,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-12 14:46:21,153 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:21,153 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] [2019-01-12 14:46:21,157 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:21,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:21,157 INFO L82 PathProgramCache]: Analyzing trace with hash 331369175, now seen corresponding path program 1 times [2019-01-12 14:46:21,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:21,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:21,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:21,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:21,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:21,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:21,390 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:46:21,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:21,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:46:21,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:46:21,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:46:21,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:46:21,392 INFO L87 Difference]: Start difference. First operand 100 states and 139 transitions. Second operand 5 states. [2019-01-12 14:46:22,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:22,142 INFO L93 Difference]: Finished difference Result 280 states and 394 transitions. [2019-01-12 14:46:22,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 14:46:22,143 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-01-12 14:46:22,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:22,149 INFO L225 Difference]: With dead ends: 280 [2019-01-12 14:46:22,150 INFO L226 Difference]: Without dead ends: 278 [2019-01-12 14:46:22,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:46:22,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-01-12 14:46:22,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 100. [2019-01-12 14:46:22,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-12 14:46:22,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 138 transitions. [2019-01-12 14:46:22,200 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 138 transitions. Word has length 30 [2019-01-12 14:46:22,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:22,202 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 138 transitions. [2019-01-12 14:46:22,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:46:22,202 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 138 transitions. [2019-01-12 14:46:22,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-12 14:46:22,205 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:22,205 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:46:22,206 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:22,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:22,207 INFO L82 PathProgramCache]: Analyzing trace with hash 261712181, now seen corresponding path program 1 times [2019-01-12 14:46:22,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:22,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:22,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:22,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:22,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:22,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:22,489 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:46:22,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:22,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:46:22,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:46:22,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:46:22,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:46:22,492 INFO L87 Difference]: Start difference. First operand 100 states and 138 transitions. Second operand 5 states. [2019-01-12 14:46:22,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:22,864 INFO L93 Difference]: Finished difference Result 270 states and 372 transitions. [2019-01-12 14:46:22,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:46:22,865 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-01-12 14:46:22,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:22,867 INFO L225 Difference]: With dead ends: 270 [2019-01-12 14:46:22,867 INFO L226 Difference]: Without dead ends: 176 [2019-01-12 14:46:22,869 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:46:22,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-01-12 14:46:22,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 106. [2019-01-12 14:46:22,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-12 14:46:22,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 144 transitions. [2019-01-12 14:46:22,898 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 144 transitions. Word has length 33 [2019-01-12 14:46:22,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:22,899 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 144 transitions. [2019-01-12 14:46:22,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:46:22,899 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 144 transitions. [2019-01-12 14:46:22,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-12 14:46:22,904 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:22,904 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:46:22,905 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:22,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:22,905 INFO L82 PathProgramCache]: Analyzing trace with hash -325093833, now seen corresponding path program 1 times [2019-01-12 14:46:22,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:22,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:22,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:22,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:22,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:22,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:23,071 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:46:23,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:23,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:46:23,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 14:46:23,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 14:46:23,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 14:46:23,075 INFO L87 Difference]: Start difference. First operand 106 states and 144 transitions. Second operand 4 states. [2019-01-12 14:46:23,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:23,321 INFO L93 Difference]: Finished difference Result 252 states and 342 transitions. [2019-01-12 14:46:23,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 14:46:23,322 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-01-12 14:46:23,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:23,324 INFO L225 Difference]: With dead ends: 252 [2019-01-12 14:46:23,324 INFO L226 Difference]: Without dead ends: 152 [2019-01-12 14:46:23,325 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:46:23,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-01-12 14:46:23,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 110. [2019-01-12 14:46:23,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-12 14:46:23,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 148 transitions. [2019-01-12 14:46:23,348 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 148 transitions. Word has length 33 [2019-01-12 14:46:23,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:23,349 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 148 transitions. [2019-01-12 14:46:23,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 14:46:23,350 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 148 transitions. [2019-01-12 14:46:23,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-12 14:46:23,352 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:23,352 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:46:23,353 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:23,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:23,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1604957511, now seen corresponding path program 1 times [2019-01-12 14:46:23,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:23,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:23,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:23,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:23,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:23,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:23,450 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:46:23,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:23,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:46:23,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:46:23,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:46:23,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:46:23,451 INFO L87 Difference]: Start difference. First operand 110 states and 148 transitions. Second operand 3 states. [2019-01-12 14:46:23,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:23,598 INFO L93 Difference]: Finished difference Result 262 states and 352 transitions. [2019-01-12 14:46:23,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:46:23,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-01-12 14:46:23,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:23,600 INFO L225 Difference]: With dead ends: 262 [2019-01-12 14:46:23,600 INFO L226 Difference]: Without dead ends: 158 [2019-01-12 14:46:23,602 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:46:23,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-01-12 14:46:23,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2019-01-12 14:46:23,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-01-12 14:46:23,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 206 transitions. [2019-01-12 14:46:23,631 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 206 transitions. Word has length 33 [2019-01-12 14:46:23,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:23,634 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 206 transitions. [2019-01-12 14:46:23,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:46:23,634 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 206 transitions. [2019-01-12 14:46:23,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-12 14:46:23,635 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:23,635 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:46:23,636 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:23,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:23,636 INFO L82 PathProgramCache]: Analyzing trace with hash -447661573, now seen corresponding path program 1 times [2019-01-12 14:46:23,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:23,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:23,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:23,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:23,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:23,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:46:23,924 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:46:23,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:46:23,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 14:46:23,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 14:46:23,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 14:46:23,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 14:46:23,927 INFO L87 Difference]: Start difference. First operand 158 states and 206 transitions. Second operand 6 states. [2019-01-12 14:46:24,626 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-12 14:46:25,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:46:25,116 INFO L93 Difference]: Finished difference Result 482 states and 630 transitions. [2019-01-12 14:46:25,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 14:46:25,116 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-01-12 14:46:25,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:46:25,118 INFO L225 Difference]: With dead ends: 482 [2019-01-12 14:46:25,118 INFO L226 Difference]: Without dead ends: 330 [2019-01-12 14:46:25,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-01-12 14:46:25,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-01-12 14:46:25,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 158. [2019-01-12 14:46:25,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-01-12 14:46:25,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 202 transitions. [2019-01-12 14:46:25,150 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 202 transitions. Word has length 34 [2019-01-12 14:46:25,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:46:25,150 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 202 transitions. [2019-01-12 14:46:25,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 14:46:25,151 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 202 transitions. [2019-01-12 14:46:25,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-12 14:46:25,152 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:46:25,152 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:46:25,154 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:46:25,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:46:25,155 INFO L82 PathProgramCache]: Analyzing trace with hash -2059222374, now seen corresponding path program 1 times [2019-01-12 14:46:25,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:46:25,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:46:25,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:25,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:46:25,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:46:25,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 14:46:26,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 14:46:26,104 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 14:46:26,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 02:46:26 BoogieIcfgContainer [2019-01-12 14:46:26,248 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 14:46:26,249 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 14:46:26,249 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 14:46:26,249 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 14:46:26,250 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:46:19" (3/4) ... [2019-01-12 14:46:26,253 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 14:46:26,375 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 14:46:26,375 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 14:46:26,376 INFO L168 Benchmark]: Toolchain (without parser) took 9185.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 207.6 MB). Free memory was 951.4 MB in the beginning and 1.0 GB in the end (delta: -67.3 MB). Peak memory consumption was 140.3 MB. Max. memory is 11.5 GB. [2019-01-12 14:46:26,377 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:46:26,377 INFO L168 Benchmark]: CACSL2BoogieTranslator took 779.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -173.5 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. [2019-01-12 14:46:26,381 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-12 14:46:26,382 INFO L168 Benchmark]: Boogie Preprocessor took 54.81 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:46:26,382 INFO L168 Benchmark]: RCFGBuilder took 1359.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.9 MB). Peak memory consumption was 58.9 MB. Max. memory is 11.5 GB. [2019-01-12 14:46:26,382 INFO L168 Benchmark]: TraceAbstraction took 6786.69 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 17.2 MB). Peak memory consumption was 87.5 MB. Max. memory is 11.5 GB. [2019-01-12 14:46:26,383 INFO L168 Benchmark]: Witness Printer took 126.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 23.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-01-12 14:46:26,391 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 779.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -173.5 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 72.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 54.81 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 1359.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.9 MB). Peak memory consumption was 58.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6786.69 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 17.2 MB). Peak memory consumption was 87.5 MB. Max. memory is 11.5 GB. * Witness Printer took 126.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 23.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 764]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L209] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L413] int waterLevel = 1; [L414] int methaneLevelCritical = 0; [L581] int pumpRunning = 0; [L582] int systemActive = 1; [L833] int cleanupTimeShifts = 4; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L906] int retValue_acc ; [L907] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L824] int retValue_acc ; [L827] retValue_acc = 1 [L828] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L913] tmp = valid_product() [L915] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L511] int splverifierCounter ; [L512] int tmp ; [L513] int tmp___0 ; [L514] int tmp___1 ; [L515] int tmp___2 ; [L518] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L520] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L522] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L528] tmp = __VERIFIER_nondet_int() [L530] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L431] COND TRUE waterLevel < 2 [L432] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L538] tmp___0 = __VERIFIER_nondet_int() [L540] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L548] tmp___2 = __VERIFIER_nondet_int() [L550] COND TRUE \read(tmp___2) [L755] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L589] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L596] COND TRUE \read(systemActive) [L618] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L621] COND TRUE ! pumpRunning [L733] int retValue_acc ; [L734] int tmp ; [L735] int tmp___0 ; [L493] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L496] COND FALSE !(waterLevel < 2) [L500] retValue_acc = 0 [L501] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L739] tmp = isHighWaterSensorDry() [L741] COND FALSE !(\read(tmp)) [L744] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L746] retValue_acc = tmp___0 [L747] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L623] tmp = isHighWaterLevel() [L625] COND TRUE \read(tmp) [L652] int tmp ; [L677] int retValue_acc ; [L452] int retValue_acc ; [L455] retValue_acc = methaneLevelCritical [L456] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L681] retValue_acc = isMethaneLevelCritical() [L683] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L656] tmp = isMethaneAlarm() [L658] COND FALSE !(\read(tmp)) [L646] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L770] int tmp ; [L771] int tmp___0 ; [L452] int retValue_acc ; [L455] retValue_acc = methaneLevelCritical [L456] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L775] tmp = isMethaneLevelCritical() [L777] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L520] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L522] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L528] tmp = __VERIFIER_nondet_int() [L530] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L538] tmp___0 = __VERIFIER_nondet_int() [L540] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L443] COND FALSE !(\read(methaneLevelCritical)) [L446] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L548] tmp___2 = __VERIFIER_nondet_int() [L550] COND TRUE \read(tmp___2) [L755] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L589] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L419] COND TRUE waterLevel > 0 [L420] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L596] COND TRUE \read(systemActive) [L618] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L621] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L770] int tmp ; [L771] int tmp___0 ; [L452] int retValue_acc ; [L455] retValue_acc = methaneLevelCritical [L456] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L775] tmp = isMethaneLevelCritical() [L777] COND TRUE \read(tmp) [L688] int retValue_acc ; [L691] retValue_acc = pumpRunning [L692] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L779] tmp___0 = isPumpRunning() [L781] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L764] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 87 locations, 3 error locations. UNSAFE Result, 6.7s OverallTime, 11 OverallIterations, 2 TraceHistogramMax, 3.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 748 SDtfs, 1018 SDslu, 1178 SDs, 0 SdLazy, 167 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158occurred in iteration=9, 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.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 580 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 319 NumberOfCodeBlocks, 319 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 260 ConstructedInterpolants, 0 QuantifiedInterpolants, 13590 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 incorrect! Received shutdown request...