./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec1_product53_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/product-lines/minepump_spec1_product53_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 c24c1e7ee4ec00cdeabebf427b1fca35e12bb483 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-2e94e6a [2018-12-31 09:41:47,457 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 09:41:47,459 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 09:41:47,472 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 09:41:47,472 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 09:41:47,473 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 09:41:47,475 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 09:41:47,477 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 09:41:47,478 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 09:41:47,479 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 09:41:47,480 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 09:41:47,481 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 09:41:47,481 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 09:41:47,482 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 09:41:47,483 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 09:41:47,484 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 09:41:47,485 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 09:41:47,487 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 09:41:47,489 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 09:41:47,491 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 09:41:47,492 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 09:41:47,493 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 09:41:47,496 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 09:41:47,496 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 09:41:47,497 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 09:41:47,498 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 09:41:47,499 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 09:41:47,500 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 09:41:47,500 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 09:41:47,502 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 09:41:47,502 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 09:41:47,503 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 09:41:47,503 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 09:41:47,503 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 09:41:47,504 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 09:41:47,505 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 09:41:47,505 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 09:41:47,533 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 09:41:47,533 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 09:41:47,535 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 09:41:47,536 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 09:41:47,536 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 09:41:47,536 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 09:41:47,536 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 09:41:47,536 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 09:41:47,536 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 09:41:47,537 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 09:41:47,537 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 09:41:47,538 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 09:41:47,538 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 09:41:47,538 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 09:41:47,538 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 09:41:47,538 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 09:41:47,538 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 09:41:47,540 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 09:41:47,540 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 09:41:47,540 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 09:41:47,540 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 09:41:47,540 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 09:41:47,540 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 09:41:47,541 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 09:41:47,541 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 09:41:47,541 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 09:41:47,541 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 09:41:47,541 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 09:41:47,542 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 -> c24c1e7ee4ec00cdeabebf427b1fca35e12bb483 [2018-12-31 09:41:47,599 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 09:41:47,617 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 09:41:47,624 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 09:41:47,627 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 09:41:47,628 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 09:41:47,628 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec1_product53_false-unreach-call_false-termination.cil.c [2018-12-31 09:41:47,691 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d0d1c980/00bcdb6b499043b6b044af787193b115/FLAG2f68270cf [2018-12-31 09:41:48,161 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 09:41:48,162 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec1_product53_false-unreach-call_false-termination.cil.c [2018-12-31 09:41:48,180 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d0d1c980/00bcdb6b499043b6b044af787193b115/FLAG2f68270cf [2018-12-31 09:41:48,471 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d0d1c980/00bcdb6b499043b6b044af787193b115 [2018-12-31 09:41:48,476 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 09:41:48,478 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 09:41:48,480 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 09:41:48,480 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 09:41:48,486 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 09:41:48,487 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:41:48" (1/1) ... [2018-12-31 09:41:48,490 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52869081 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:48, skipping insertion in model container [2018-12-31 09:41:48,490 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:41:48" (1/1) ... [2018-12-31 09:41:48,499 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 09:41:48,561 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 09:41:49,028 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:41:49,053 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 09:41:49,201 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:41:49,353 INFO L195 MainTranslator]: Completed translation [2018-12-31 09:41:49,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:49 WrapperNode [2018-12-31 09:41:49,353 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 09:41:49,355 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 09:41:49,355 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 09:41:49,355 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 09:41:49,365 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:49" (1/1) ... [2018-12-31 09:41:49,392 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:49" (1/1) ... [2018-12-31 09:41:49,455 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 09:41:49,457 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 09:41:49,457 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 09:41:49,457 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 09:41:49,473 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:49" (1/1) ... [2018-12-31 09:41:49,473 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:49" (1/1) ... [2018-12-31 09:41:49,482 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:49" (1/1) ... [2018-12-31 09:41:49,482 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:49" (1/1) ... [2018-12-31 09:41:49,502 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:49" (1/1) ... [2018-12-31 09:41:49,516 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:49" (1/1) ... [2018-12-31 09:41:49,523 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:49" (1/1) ... [2018-12-31 09:41:49,532 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 09:41:49,532 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 09:41:49,532 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 09:41:49,533 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 09:41:49,533 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 09:41:49,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 09:41:49,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-31 09:41:49,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 09:41:49,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 09:41:51,400 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 09:41:51,400 INFO L280 CfgBuilder]: Removed 276 assue(true) statements. [2018-12-31 09:41:51,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:41:51 BoogieIcfgContainer [2018-12-31 09:41:51,401 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 09:41:51,403 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 09:41:51,403 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 09:41:51,406 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 09:41:51,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 09:41:48" (1/3) ... [2018-12-31 09:41:51,407 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@172107c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:41:51, skipping insertion in model container [2018-12-31 09:41:51,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:41:49" (2/3) ... [2018-12-31 09:41:51,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@172107c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:41:51, skipping insertion in model container [2018-12-31 09:41:51,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:41:51" (3/3) ... [2018-12-31 09:41:51,410 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product53_false-unreach-call_false-termination.cil.c [2018-12-31 09:41:51,421 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 09:41:51,432 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 09:41:51,450 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 09:41:51,495 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 09:41:51,496 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 09:41:51,496 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 09:41:51,496 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 09:41:51,497 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 09:41:51,497 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 09:41:51,497 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 09:41:51,497 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 09:41:51,497 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 09:41:51,519 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states. [2018-12-31 09:41:51,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-31 09:41:51,527 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:51,528 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:41:51,531 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:51,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:51,537 INFO L82 PathProgramCache]: Analyzing trace with hash 2002794138, now seen corresponding path program 1 times [2018-12-31 09:41:51,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:51,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:51,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:51,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:51,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:51,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:51,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:41:51,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:51,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:41:51,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 09:41:51,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 09:41:51,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 09:41:51,841 INFO L87 Difference]: Start difference. First operand 189 states. Second operand 2 states. [2018-12-31 09:41:51,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:51,888 INFO L93 Difference]: Finished difference Result 372 states and 569 transitions. [2018-12-31 09:41:51,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 09:41:51,890 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-12-31 09:41:51,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:51,905 INFO L225 Difference]: With dead ends: 372 [2018-12-31 09:41:51,905 INFO L226 Difference]: Without dead ends: 185 [2018-12-31 09:41:51,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 09:41:51,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-12-31 09:41:51,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-12-31 09:41:51,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-12-31 09:41:51,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 276 transitions. [2018-12-31 09:41:51,969 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 276 transitions. Word has length 16 [2018-12-31 09:41:51,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:51,970 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 276 transitions. [2018-12-31 09:41:51,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 09:41:51,970 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 276 transitions. [2018-12-31 09:41:51,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-31 09:41:51,971 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:51,972 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:41:51,972 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:51,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:51,973 INFO L82 PathProgramCache]: Analyzing trace with hash 956037241, now seen corresponding path program 1 times [2018-12-31 09:41:51,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:51,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:51,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:51,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:51,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:52,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:52,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:41:52,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:52,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 09:41:52,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:41:52,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:41:52,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:41:52,136 INFO L87 Difference]: Start difference. First operand 185 states and 276 transitions. Second operand 3 states. [2018-12-31 09:41:52,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:52,167 INFO L93 Difference]: Finished difference Result 185 states and 276 transitions. [2018-12-31 09:41:52,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:41:52,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-31 09:41:52,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:52,169 INFO L225 Difference]: With dead ends: 185 [2018-12-31 09:41:52,170 INFO L226 Difference]: Without dead ends: 71 [2018-12-31 09:41:52,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:41:52,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-31 09:41:52,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-12-31 09:41:52,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-31 09:41:52,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 105 transitions. [2018-12-31 09:41:52,180 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 105 transitions. Word has length 17 [2018-12-31 09:41:52,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:52,180 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 105 transitions. [2018-12-31 09:41:52,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:41:52,181 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 105 transitions. [2018-12-31 09:41:52,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-31 09:41:52,182 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:52,183 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:41:52,183 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:52,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:52,183 INFO L82 PathProgramCache]: Analyzing trace with hash 748559286, now seen corresponding path program 1 times [2018-12-31 09:41:52,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:52,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:52,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:52,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:52,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:52,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:52,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:41:52,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:52,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:41:52,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 09:41:52,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 09:41:52,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 09:41:52,424 INFO L87 Difference]: Start difference. First operand 71 states and 105 transitions. Second operand 6 states. [2018-12-31 09:41:52,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:52,712 INFO L93 Difference]: Finished difference Result 136 states and 204 transitions. [2018-12-31 09:41:52,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 09:41:52,713 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-12-31 09:41:52,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:52,715 INFO L225 Difference]: With dead ends: 136 [2018-12-31 09:41:52,715 INFO L226 Difference]: Without dead ends: 71 [2018-12-31 09:41:52,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-31 09:41:52,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-31 09:41:52,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-12-31 09:41:52,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-31 09:41:52,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 104 transitions. [2018-12-31 09:41:52,725 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 104 transitions. Word has length 22 [2018-12-31 09:41:52,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:52,726 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 104 transitions. [2018-12-31 09:41:52,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 09:41:52,726 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 104 transitions. [2018-12-31 09:41:52,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-31 09:41:52,729 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:52,729 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:41:52,729 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:52,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:52,730 INFO L82 PathProgramCache]: Analyzing trace with hash -682519882, now seen corresponding path program 1 times [2018-12-31 09:41:52,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:52,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:52,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:52,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:52,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:52,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:52,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:41:52,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:52,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:41:52,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:41:52,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:41:52,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:41:52,853 INFO L87 Difference]: Start difference. First operand 71 states and 104 transitions. Second operand 3 states. [2018-12-31 09:41:53,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:53,140 INFO L93 Difference]: Finished difference Result 145 states and 214 transitions. [2018-12-31 09:41:53,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:41:53,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-31 09:41:53,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:53,143 INFO L225 Difference]: With dead ends: 145 [2018-12-31 09:41:53,143 INFO L226 Difference]: Without dead ends: 80 [2018-12-31 09:41:53,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:41:53,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-31 09:41:53,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2018-12-31 09:41:53,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-31 09:41:53,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 110 transitions. [2018-12-31 09:41:53,156 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 110 transitions. Word has length 25 [2018-12-31 09:41:53,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:53,157 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 110 transitions. [2018-12-31 09:41:53,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:41:53,157 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 110 transitions. [2018-12-31 09:41:53,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-31 09:41:53,158 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:53,160 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:41:53,160 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:53,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:53,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1459548505, now seen corresponding path program 1 times [2018-12-31 09:41:53,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:53,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:53,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:53,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:53,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:53,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:53,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:41:53,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:53,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:41:53,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:41:53,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:41:53,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:41:53,449 INFO L87 Difference]: Start difference. First operand 78 states and 110 transitions. Second operand 5 states. [2018-12-31 09:41:53,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:53,797 INFO L93 Difference]: Finished difference Result 204 states and 285 transitions. [2018-12-31 09:41:53,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 09:41:53,798 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-12-31 09:41:53,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:53,800 INFO L225 Difference]: With dead ends: 204 [2018-12-31 09:41:53,800 INFO L226 Difference]: Without dead ends: 132 [2018-12-31 09:41:53,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-31 09:41:53,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-12-31 09:41:53,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 87. [2018-12-31 09:41:53,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-31 09:41:53,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 119 transitions. [2018-12-31 09:41:53,812 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 119 transitions. Word has length 31 [2018-12-31 09:41:53,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:53,813 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 119 transitions. [2018-12-31 09:41:53,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:41:53,813 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 119 transitions. [2018-12-31 09:41:53,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-31 09:41:53,816 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:53,816 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:41:53,816 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:53,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:53,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1202962538, now seen corresponding path program 1 times [2018-12-31 09:41:53,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:53,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:53,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:53,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:53,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:53,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:54,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:41:54,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:54,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:41:54,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:41:54,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:41:54,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:41:54,018 INFO L87 Difference]: Start difference. First operand 87 states and 119 transitions. Second operand 5 states. [2018-12-31 09:41:54,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:54,482 INFO L93 Difference]: Finished difference Result 431 states and 600 transitions. [2018-12-31 09:41:54,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 09:41:54,483 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-12-31 09:41:54,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:54,486 INFO L225 Difference]: With dead ends: 431 [2018-12-31 09:41:54,486 INFO L226 Difference]: Without dead ends: 350 [2018-12-31 09:41:54,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 09:41:54,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-12-31 09:41:54,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 162. [2018-12-31 09:41:54,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-12-31 09:41:54,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 221 transitions. [2018-12-31 09:41:54,512 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 221 transitions. Word has length 31 [2018-12-31 09:41:54,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:54,512 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 221 transitions. [2018-12-31 09:41:54,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:41:54,513 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 221 transitions. [2018-12-31 09:41:54,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-31 09:41:54,515 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:54,515 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] [2018-12-31 09:41:54,516 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:54,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:54,516 INFO L82 PathProgramCache]: Analyzing trace with hash 552949620, now seen corresponding path program 1 times [2018-12-31 09:41:54,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:54,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:54,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:54,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:54,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:54,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:54,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:41:54,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:54,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:41:54,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:41:54,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:41:54,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:41:54,774 INFO L87 Difference]: Start difference. First operand 162 states and 221 transitions. Second operand 5 states. [2018-12-31 09:41:55,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:55,563 INFO L93 Difference]: Finished difference Result 470 states and 642 transitions. [2018-12-31 09:41:55,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 09:41:55,564 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-12-31 09:41:55,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:55,567 INFO L225 Difference]: With dead ends: 470 [2018-12-31 09:41:55,567 INFO L226 Difference]: Without dead ends: 468 [2018-12-31 09:41:55,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 09:41:55,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2018-12-31 09:41:55,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 162. [2018-12-31 09:41:55,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-12-31 09:41:55,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 220 transitions. [2018-12-31 09:41:55,593 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 220 transitions. Word has length 32 [2018-12-31 09:41:55,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:55,593 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 220 transitions. [2018-12-31 09:41:55,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:41:55,594 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 220 transitions. [2018-12-31 09:41:55,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-31 09:41:55,596 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:55,596 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] [2018-12-31 09:41:55,596 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:55,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:55,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1792378863, now seen corresponding path program 1 times [2018-12-31 09:41:55,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:55,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:55,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:55,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:55,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:55,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:55,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:41:55,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:55,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 09:41:55,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 09:41:55,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 09:41:55,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 09:41:55,891 INFO L87 Difference]: Start difference. First operand 162 states and 220 transitions. Second operand 6 states. [2018-12-31 09:41:56,144 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-12-31 09:41:56,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:56,344 INFO L93 Difference]: Finished difference Result 428 states and 574 transitions. [2018-12-31 09:41:56,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 09:41:56,345 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-12-31 09:41:56,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:56,347 INFO L225 Difference]: With dead ends: 428 [2018-12-31 09:41:56,347 INFO L226 Difference]: Without dead ends: 272 [2018-12-31 09:41:56,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-12-31 09:41:56,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-12-31 09:41:56,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 174. [2018-12-31 09:41:56,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-12-31 09:41:56,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 232 transitions. [2018-12-31 09:41:56,374 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 232 transitions. Word has length 32 [2018-12-31 09:41:56,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:56,375 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 232 transitions. [2018-12-31 09:41:56,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 09:41:56,375 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 232 transitions. [2018-12-31 09:41:56,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-31 09:41:56,378 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:56,379 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] [2018-12-31 09:41:56,379 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:56,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:56,379 INFO L82 PathProgramCache]: Analyzing trace with hash 2050544301, now seen corresponding path program 1 times [2018-12-31 09:41:56,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:56,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:56,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:56,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:56,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:56,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:41:56,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:41:56,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:41:56,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:41:56,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:41:56,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:41:56,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:41:56,459 INFO L87 Difference]: Start difference. First operand 174 states and 232 transitions. Second operand 3 states. [2018-12-31 09:41:56,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:41:56,686 INFO L93 Difference]: Finished difference Result 394 states and 524 transitions. [2018-12-31 09:41:56,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:41:56,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-31 09:41:56,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:41:56,689 INFO L225 Difference]: With dead ends: 394 [2018-12-31 09:41:56,689 INFO L226 Difference]: Without dead ends: 226 [2018-12-31 09:41:56,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:41:56,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-12-31 09:41:56,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2018-12-31 09:41:56,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-12-31 09:41:56,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 294 transitions. [2018-12-31 09:41:56,758 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 294 transitions. Word has length 32 [2018-12-31 09:41:56,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:41:56,758 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 294 transitions. [2018-12-31 09:41:56,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:41:56,759 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 294 transitions. [2018-12-31 09:41:56,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-31 09:41:56,761 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:41:56,761 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] [2018-12-31 09:41:56,761 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:41:56,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:41:56,762 INFO L82 PathProgramCache]: Analyzing trace with hash 979497771, now seen corresponding path program 1 times [2018-12-31 09:41:56,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:41:56,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:41:56,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:56,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:41:56,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:41:57,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 09:41:57,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 09:41:57,607 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 09:41:57,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 09:41:57 BoogieIcfgContainer [2018-12-31 09:41:57,747 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 09:41:57,747 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 09:41:57,747 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 09:41:57,749 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 09:41:57,749 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:41:51" (3/4) ... [2018-12-31 09:41:57,752 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 09:41:57,896 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 09:41:57,898 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 09:41:57,898 INFO L168 Benchmark]: Toolchain (without parser) took 9421.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 211.8 MB). Free memory was 951.3 MB in the beginning and 967.5 MB in the end (delta: -16.2 MB). Peak memory consumption was 195.6 MB. Max. memory is 11.5 GB. [2018-12-31 09:41:57,900 INFO L168 Benchmark]: CDTParser took 1.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. [2018-12-31 09:41:57,900 INFO L168 Benchmark]: CACSL2BoogieTranslator took 874.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -174.7 MB). Peak memory consumption was 43.6 MB. Max. memory is 11.5 GB. [2018-12-31 09:41:57,901 INFO L168 Benchmark]: Boogie Procedure Inliner took 102.00 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-31 09:41:57,902 INFO L168 Benchmark]: Boogie Preprocessor took 74.66 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-31 09:41:57,902 INFO L168 Benchmark]: RCFGBuilder took 1869.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 80.4 MB). Peak memory consumption was 80.4 MB. Max. memory is 11.5 GB. [2018-12-31 09:41:57,903 INFO L168 Benchmark]: TraceAbstraction took 6344.48 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 79.2 MB). Free memory was 1.0 GB in the beginning and 983.5 MB in the end (delta: 48.4 MB). Peak memory consumption was 127.6 MB. Max. memory is 11.5 GB. [2018-12-31 09:41:57,905 INFO L168 Benchmark]: Witness Printer took 150.27 ms. Allocated memory is still 1.2 GB. Free memory was 983.5 MB in the beginning and 967.5 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. [2018-12-31 09:41:57,909 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.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 874.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -174.7 MB). Peak memory consumption was 43.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 102.00 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 74.66 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1869.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 80.4 MB). Peak memory consumption was 80.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6344.48 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 79.2 MB). Free memory was 1.0 GB in the beginning and 983.5 MB in the end (delta: 48.4 MB). Peak memory consumption was 127.6 MB. Max. memory is 11.5 GB. * Witness Printer took 150.27 ms. Allocated memory is still 1.2 GB. Free memory was 983.5 MB in the beginning and 967.5 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 73]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L247] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L444] int cleanupTimeShifts = 4; [L554] int pumpRunning = 0; [L555] int systemActive = 1; [L878] int waterLevel = 1; [L879] int methaneLevelCritical = 0; [L525] int retValue_acc ; [L526] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L868] int retValue_acc ; [L871] retValue_acc = 1 [L872] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L532] tmp = valid_product() [L534] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L778] int splverifierCounter ; [L779] int tmp ; [L780] int tmp___0 ; [L781] int tmp___1 ; [L782] int tmp___2 ; [L785] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L787] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L789] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L795] tmp = __VERIFIER_nondet_int() [L797] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L896] COND TRUE waterLevel < 2 [L897] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L805] tmp___0 = __VERIFIER_nondet_int() [L807] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L908] COND FALSE !(\read(methaneLevelCritical)) [L911] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L815] tmp___2 = __VERIFIER_nondet_int() [L817] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L561] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L568] COND TRUE \read(systemActive) [L642] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L645] COND FALSE !(\read(pumpRunning)) [L616] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L619] COND FALSE !(\read(pumpRunning)) [L590] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L593] COND TRUE ! pumpRunning [L739] int retValue_acc ; [L740] int tmp ; [L741] int tmp___0 ; [L958] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L961] COND FALSE !(waterLevel < 2) [L965] retValue_acc = 0 [L966] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L745] tmp = isHighWaterSensorDry() [L747] COND FALSE !(\read(tmp)) [L750] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L752] retValue_acc = tmp___0 [L753] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L595] tmp = isHighWaterLevel() [L597] COND TRUE \read(tmp) [L670] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L44] int tmp ; [L45] int tmp___0 ; [L917] int retValue_acc ; [L920] retValue_acc = methaneLevelCritical [L921] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L49] tmp = isMethaneLevelCritical() [L51] COND TRUE \read(tmp) [L694] int retValue_acc ; [L697] retValue_acc = pumpRunning [L698] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L53] tmp___0 = isPumpRunning() [L55] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L73] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 189 locations, 3 error locations. UNSAFE Result, 6.2s OverallTime, 10 OverallIterations, 1 TraceHistogramMax, 3.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1135 SDtfs, 1663 SDslu, 1257 SDs, 0 SdLazy, 203 SolverSat, 50 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=226occurred 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, 9 MinimizatonAttempts, 639 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 271 NumberOfCodeBlocks, 271 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 229 ConstructedInterpolants, 0 QuantifiedInterpolants, 13180 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...