./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/safe029_pso.opt_false-unreach-call.i --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/pthread-wmm/safe029_pso.opt_false-unreach-call.i -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 2704334a5f5c65f6107547c60b5bde5e46cdf374 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 [2019-01-01 00:34:00,498 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 00:34:00,501 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 00:34:00,520 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 00:34:00,521 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 00:34:00,523 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 00:34:00,525 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 00:34:00,528 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 00:34:00,530 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 00:34:00,533 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 00:34:00,537 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 00:34:00,539 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 00:34:00,540 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 00:34:00,543 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 00:34:00,546 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 00:34:00,548 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 00:34:00,549 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 00:34:00,554 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 00:34:00,562 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 00:34:00,566 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 00:34:00,572 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 00:34:00,576 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 00:34:00,582 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 00:34:00,583 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 00:34:00,583 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 00:34:00,584 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 00:34:00,585 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 00:34:00,588 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 00:34:00,590 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 00:34:00,592 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 00:34:00,594 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 00:34:00,595 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 00:34:00,595 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 00:34:00,595 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 00:34:00,596 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 00:34:00,599 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 00:34:00,600 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-01 00:34:00,615 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 00:34:00,615 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 00:34:00,616 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 00:34:00,617 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 00:34:00,617 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 00:34:00,617 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 00:34:00,617 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 00:34:00,617 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 00:34:00,618 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 00:34:00,618 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 00:34:00,618 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-01 00:34:00,618 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 00:34:00,618 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-01 00:34:00,618 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 00:34:00,619 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 00:34:00,619 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 00:34:00,619 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-01 00:34:00,619 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 00:34:00,619 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 00:34:00,619 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 00:34:00,620 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 00:34:00,620 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 00:34:00,620 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 00:34:00,620 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 00:34:00,620 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-01 00:34:00,621 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 00:34:00,621 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 00:34:00,621 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-01 00:34:00,621 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 -> 2704334a5f5c65f6107547c60b5bde5e46cdf374 [2019-01-01 00:34:00,657 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 00:34:00,675 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 00:34:00,680 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 00:34:00,684 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 00:34:00,684 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 00:34:00,685 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/safe029_pso.opt_false-unreach-call.i [2019-01-01 00:34:00,747 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84134cfa2/fed0dd1939234e40b484b958f0fba633/FLAGf7e5f353f [2019-01-01 00:34:01,290 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 00:34:01,291 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/safe029_pso.opt_false-unreach-call.i [2019-01-01 00:34:01,311 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84134cfa2/fed0dd1939234e40b484b958f0fba633/FLAGf7e5f353f [2019-01-01 00:34:01,564 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84134cfa2/fed0dd1939234e40b484b958f0fba633 [2019-01-01 00:34:01,568 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 00:34:01,570 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 00:34:01,571 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 00:34:01,571 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 00:34:01,575 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 00:34:01,576 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 12:34:01" (1/1) ... [2019-01-01 00:34:01,579 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78a35997 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:34:01, skipping insertion in model container [2019-01-01 00:34:01,580 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 12:34:01" (1/1) ... [2019-01-01 00:34:01,589 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 00:34:01,671 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 00:34:02,216 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 00:34:02,230 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 00:34:02,376 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 00:34:02,451 INFO L195 MainTranslator]: Completed translation [2019-01-01 00:34:02,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:34:02 WrapperNode [2019-01-01 00:34:02,452 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 00:34:02,453 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 00:34:02,453 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 00:34:02,453 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 00:34:02,464 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:34:02" (1/1) ... [2019-01-01 00:34:02,493 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:34:02" (1/1) ... [2019-01-01 00:34:02,545 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 00:34:02,546 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 00:34:02,546 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 00:34:02,546 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 00:34:02,562 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:34:02" (1/1) ... [2019-01-01 00:34:02,562 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:34:02" (1/1) ... [2019-01-01 00:34:02,575 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:34:02" (1/1) ... [2019-01-01 00:34:02,575 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:34:02" (1/1) ... [2019-01-01 00:34:02,597 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:34:02" (1/1) ... [2019-01-01 00:34:02,609 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:34:02" (1/1) ... [2019-01-01 00:34:02,612 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:34:02" (1/1) ... [2019-01-01 00:34:02,617 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 00:34:02,618 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 00:34:02,618 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 00:34:02,618 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 00:34:02,619 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:34:02" (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-01 00:34:02,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 00:34:02,688 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-01 00:34:02,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 00:34:02,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 00:34:02,688 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-01 00:34:02,688 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-01 00:34:02,689 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-01 00:34:02,690 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-01 00:34:02,690 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-01 00:34:02,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 00:34:02,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 00:34:02,693 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-01-01 00:34:03,908 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 00:34:03,909 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-01 00:34:03,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 12:34:03 BoogieIcfgContainer [2019-01-01 00:34:03,911 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 00:34:03,912 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 00:34:03,912 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 00:34:03,916 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 00:34:03,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 12:34:01" (1/3) ... [2019-01-01 00:34:03,917 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39128176 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 12:34:03, skipping insertion in model container [2019-01-01 00:34:03,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:34:02" (2/3) ... [2019-01-01 00:34:03,917 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39128176 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 12:34:03, skipping insertion in model container [2019-01-01 00:34:03,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 12:34:03" (3/3) ... [2019-01-01 00:34:03,920 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_pso.opt_false-unreach-call.i [2019-01-01 00:34:03,962 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,962 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,963 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,963 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,963 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,963 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,964 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,964 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,964 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,964 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,965 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,965 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,965 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,965 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,965 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,966 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,966 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,966 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,966 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,966 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,967 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,967 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,967 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,967 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,968 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,968 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,968 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,968 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,969 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,969 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,969 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,969 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,969 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,970 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,970 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,970 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,971 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,971 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,971 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,971 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,971 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,972 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,972 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,972 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,972 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,973 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,973 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,973 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,973 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,974 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,974 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,974 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,974 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,974 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,975 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,975 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,975 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,975 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,975 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,978 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,978 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,978 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,979 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,979 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,979 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,979 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,980 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,980 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,980 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,980 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,980 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:03,980 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:34:04,002 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-01 00:34:04,003 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 00:34:04,011 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-01 00:34:04,031 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-01 00:34:04,057 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 00:34:04,058 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 00:34:04,058 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-01 00:34:04,059 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 00:34:04,059 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 00:34:04,059 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 00:34:04,059 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 00:34:04,059 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 00:34:04,059 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 00:34:04,081 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 140places, 178 transitions [2019-01-01 00:34:05,765 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25086 states. [2019-01-01 00:34:05,768 INFO L276 IsEmpty]: Start isEmpty. Operand 25086 states. [2019-01-01 00:34:05,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-01 00:34:05,779 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:34:05,780 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:34:05,783 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:34:05,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:34:05,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1594278667, now seen corresponding path program 1 times [2019-01-01 00:34:05,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:34:05,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:34:05,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:05,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:34:05,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:05,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:34:06,189 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-01 00:34:06,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:34:06,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 00:34:06,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 00:34:06,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 00:34:06,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:34:06,216 INFO L87 Difference]: Start difference. First operand 25086 states. Second operand 4 states. [2019-01-01 00:34:07,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:34:07,345 INFO L93 Difference]: Finished difference Result 45386 states and 177624 transitions. [2019-01-01 00:34:07,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 00:34:07,347 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-01-01 00:34:07,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:34:07,752 INFO L225 Difference]: With dead ends: 45386 [2019-01-01 00:34:07,752 INFO L226 Difference]: Without dead ends: 40626 [2019-01-01 00:34:07,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:34:08,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40626 states. [2019-01-01 00:34:09,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40626 to 23660. [2019-01-01 00:34:09,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23660 states. [2019-01-01 00:34:09,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23660 states to 23660 states and 92541 transitions. [2019-01-01 00:34:09,460 INFO L78 Accepts]: Start accepts. Automaton has 23660 states and 92541 transitions. Word has length 35 [2019-01-01 00:34:09,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:34:09,462 INFO L480 AbstractCegarLoop]: Abstraction has 23660 states and 92541 transitions. [2019-01-01 00:34:09,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 00:34:09,462 INFO L276 IsEmpty]: Start isEmpty. Operand 23660 states and 92541 transitions. [2019-01-01 00:34:09,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-01 00:34:09,473 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:34:09,474 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:34:09,474 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:34:09,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:34:09,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1049069648, now seen corresponding path program 1 times [2019-01-01 00:34:09,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:34:09,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:34:09,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:09,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:34:09,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:09,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:34:09,797 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-01 00:34:09,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:34:09,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 00:34:09,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 00:34:09,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 00:34:09,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:34:09,801 INFO L87 Difference]: Start difference. First operand 23660 states and 92541 transitions. Second operand 5 states. [2019-01-01 00:34:12,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:34:12,994 INFO L93 Difference]: Finished difference Result 64828 states and 241367 transitions. [2019-01-01 00:34:12,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 00:34:12,995 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-01-01 00:34:12,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:34:13,434 INFO L225 Difference]: With dead ends: 64828 [2019-01-01 00:34:13,435 INFO L226 Difference]: Without dead ends: 64668 [2019-01-01 00:34:13,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-01 00:34:13,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64668 states. [2019-01-01 00:34:15,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64668 to 37140. [2019-01-01 00:34:15,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37140 states. [2019-01-01 00:34:15,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37140 states to 37140 states and 138282 transitions. [2019-01-01 00:34:15,252 INFO L78 Accepts]: Start accepts. Automaton has 37140 states and 138282 transitions. Word has length 42 [2019-01-01 00:34:15,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:34:15,254 INFO L480 AbstractCegarLoop]: Abstraction has 37140 states and 138282 transitions. [2019-01-01 00:34:15,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 00:34:15,254 INFO L276 IsEmpty]: Start isEmpty. Operand 37140 states and 138282 transitions. [2019-01-01 00:34:15,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-01 00:34:15,259 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:34:15,260 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:34:15,260 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:34:15,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:34:15,261 INFO L82 PathProgramCache]: Analyzing trace with hash -888651829, now seen corresponding path program 1 times [2019-01-01 00:34:15,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:34:15,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:34:15,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:15,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:34:15,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:15,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:34:15,461 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-01 00:34:15,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:34:15,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 00:34:15,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 00:34:15,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 00:34:15,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:34:15,466 INFO L87 Difference]: Start difference. First operand 37140 states and 138282 transitions. Second operand 4 states. [2019-01-01 00:34:15,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:34:15,748 INFO L93 Difference]: Finished difference Result 12362 states and 41175 transitions. [2019-01-01 00:34:15,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 00:34:15,749 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-01-01 00:34:15,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:34:15,789 INFO L225 Difference]: With dead ends: 12362 [2019-01-01 00:34:15,790 INFO L226 Difference]: Without dead ends: 11841 [2019-01-01 00:34:15,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-01 00:34:15,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11841 states. [2019-01-01 00:34:16,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11841 to 11841. [2019-01-01 00:34:16,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11841 states. [2019-01-01 00:34:16,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11841 states to 11841 states and 39620 transitions. [2019-01-01 00:34:16,079 INFO L78 Accepts]: Start accepts. Automaton has 11841 states and 39620 transitions. Word has length 43 [2019-01-01 00:34:16,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:34:16,079 INFO L480 AbstractCegarLoop]: Abstraction has 11841 states and 39620 transitions. [2019-01-01 00:34:16,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 00:34:16,079 INFO L276 IsEmpty]: Start isEmpty. Operand 11841 states and 39620 transitions. [2019-01-01 00:34:16,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-01 00:34:16,089 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:34:16,089 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:34:16,089 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:34:16,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:34:16,090 INFO L82 PathProgramCache]: Analyzing trace with hash 727038507, now seen corresponding path program 1 times [2019-01-01 00:34:16,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:34:16,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:34:16,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:16,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:34:16,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:16,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:34:16,299 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-01 00:34:16,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:34:16,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 00:34:16,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 00:34:16,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 00:34:16,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:34:16,302 INFO L87 Difference]: Start difference. First operand 11841 states and 39620 transitions. Second operand 4 states. [2019-01-01 00:34:16,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:34:16,801 INFO L93 Difference]: Finished difference Result 17017 states and 55691 transitions. [2019-01-01 00:34:16,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 00:34:16,802 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-01-01 00:34:16,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:34:16,850 INFO L225 Difference]: With dead ends: 17017 [2019-01-01 00:34:16,850 INFO L226 Difference]: Without dead ends: 17017 [2019-01-01 00:34:16,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:34:16,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17017 states. [2019-01-01 00:34:17,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17017 to 12877. [2019-01-01 00:34:17,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12877 states. [2019-01-01 00:34:17,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12877 states to 12877 states and 42718 transitions. [2019-01-01 00:34:17,223 INFO L78 Accepts]: Start accepts. Automaton has 12877 states and 42718 transitions. Word has length 56 [2019-01-01 00:34:17,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:34:17,224 INFO L480 AbstractCegarLoop]: Abstraction has 12877 states and 42718 transitions. [2019-01-01 00:34:17,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 00:34:17,225 INFO L276 IsEmpty]: Start isEmpty. Operand 12877 states and 42718 transitions. [2019-01-01 00:34:17,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-01 00:34:17,233 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:34:17,234 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:34:17,234 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:34:17,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:34:17,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1892125207, now seen corresponding path program 1 times [2019-01-01 00:34:17,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:34:17,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:34:17,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:17,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:34:17,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:17,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:34:17,506 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-01 00:34:17,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:34:17,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:34:17,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:34:17,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:34:17,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:34:17,509 INFO L87 Difference]: Start difference. First operand 12877 states and 42718 transitions. Second operand 6 states. [2019-01-01 00:34:18,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:34:18,467 INFO L93 Difference]: Finished difference Result 18597 states and 60828 transitions. [2019-01-01 00:34:18,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 00:34:18,473 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-01-01 00:34:18,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:34:18,522 INFO L225 Difference]: With dead ends: 18597 [2019-01-01 00:34:18,522 INFO L226 Difference]: Without dead ends: 18565 [2019-01-01 00:34:18,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-01-01 00:34:19,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18565 states. [2019-01-01 00:34:19,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18565 to 14409. [2019-01-01 00:34:19,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14409 states. [2019-01-01 00:34:19,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14409 states to 14409 states and 47547 transitions. [2019-01-01 00:34:19,302 INFO L78 Accepts]: Start accepts. Automaton has 14409 states and 47547 transitions. Word has length 56 [2019-01-01 00:34:19,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:34:19,303 INFO L480 AbstractCegarLoop]: Abstraction has 14409 states and 47547 transitions. [2019-01-01 00:34:19,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:34:19,303 INFO L276 IsEmpty]: Start isEmpty. Operand 14409 states and 47547 transitions. [2019-01-01 00:34:19,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-01 00:34:19,331 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:34:19,331 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 00:34:19,331 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:34:19,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:34:19,332 INFO L82 PathProgramCache]: Analyzing trace with hash 315883094, now seen corresponding path program 1 times [2019-01-01 00:34:19,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:34:19,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:34:19,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:19,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:34:19,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:19,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:34:19,541 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-01 00:34:19,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:34:19,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 00:34:19,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 00:34:19,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 00:34:19,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:34:19,543 INFO L87 Difference]: Start difference. First operand 14409 states and 47547 transitions. Second operand 5 states. [2019-01-01 00:34:20,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:34:20,162 INFO L93 Difference]: Finished difference Result 23941 states and 78280 transitions. [2019-01-01 00:34:20,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 00:34:20,163 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-01-01 00:34:20,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:34:20,211 INFO L225 Difference]: With dead ends: 23941 [2019-01-01 00:34:20,211 INFO L226 Difference]: Without dead ends: 23845 [2019-01-01 00:34:20,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:34:20,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23845 states. [2019-01-01 00:34:20,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23845 to 22789. [2019-01-01 00:34:20,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22789 states. [2019-01-01 00:34:20,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22789 states to 22789 states and 74768 transitions. [2019-01-01 00:34:20,668 INFO L78 Accepts]: Start accepts. Automaton has 22789 states and 74768 transitions. Word has length 70 [2019-01-01 00:34:20,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:34:20,669 INFO L480 AbstractCegarLoop]: Abstraction has 22789 states and 74768 transitions. [2019-01-01 00:34:20,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 00:34:20,669 INFO L276 IsEmpty]: Start isEmpty. Operand 22789 states and 74768 transitions. [2019-01-01 00:34:20,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-01 00:34:20,706 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:34:20,706 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 00:34:20,707 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:34:20,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:34:20,707 INFO L82 PathProgramCache]: Analyzing trace with hash 22480087, now seen corresponding path program 1 times [2019-01-01 00:34:20,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:34:20,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:34:20,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:20,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:34:20,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:20,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:34:20,922 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-01 00:34:20,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:34:20,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 00:34:20,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 00:34:20,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 00:34:20,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:34:20,923 INFO L87 Difference]: Start difference. First operand 22789 states and 74768 transitions. Second operand 4 states. [2019-01-01 00:34:21,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:34:21,801 INFO L93 Difference]: Finished difference Result 32264 states and 104461 transitions. [2019-01-01 00:34:21,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 00:34:21,802 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2019-01-01 00:34:21,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:34:21,880 INFO L225 Difference]: With dead ends: 32264 [2019-01-01 00:34:21,880 INFO L226 Difference]: Without dead ends: 32264 [2019-01-01 00:34:21,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:34:21,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32264 states. [2019-01-01 00:34:22,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32264 to 29029. [2019-01-01 00:34:22,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29029 states. [2019-01-01 00:34:22,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29029 states to 29029 states and 94668 transitions. [2019-01-01 00:34:22,921 INFO L78 Accepts]: Start accepts. Automaton has 29029 states and 94668 transitions. Word has length 70 [2019-01-01 00:34:22,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:34:22,922 INFO L480 AbstractCegarLoop]: Abstraction has 29029 states and 94668 transitions. [2019-01-01 00:34:22,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 00:34:22,922 INFO L276 IsEmpty]: Start isEmpty. Operand 29029 states and 94668 transitions. [2019-01-01 00:34:22,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-01 00:34:22,952 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:34:22,952 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 00:34:22,952 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:34:22,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:34:22,952 INFO L82 PathProgramCache]: Analyzing trace with hash 2133770456, now seen corresponding path program 1 times [2019-01-01 00:34:22,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:34:22,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:34:22,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:22,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:34:22,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:22,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:34:23,147 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-01 00:34:23,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:34:23,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 00:34:23,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 00:34:23,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 00:34:23,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:34:23,149 INFO L87 Difference]: Start difference. First operand 29029 states and 94668 transitions. Second operand 4 states. [2019-01-01 00:34:23,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:34:23,890 INFO L93 Difference]: Finished difference Result 41177 states and 132363 transitions. [2019-01-01 00:34:23,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 00:34:23,890 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2019-01-01 00:34:23,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:34:23,969 INFO L225 Difference]: With dead ends: 41177 [2019-01-01 00:34:23,969 INFO L226 Difference]: Without dead ends: 40929 [2019-01-01 00:34:23,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:34:24,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40929 states. [2019-01-01 00:34:24,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40929 to 35657. [2019-01-01 00:34:24,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35657 states. [2019-01-01 00:34:24,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35657 states to 35657 states and 115827 transitions. [2019-01-01 00:34:24,573 INFO L78 Accepts]: Start accepts. Automaton has 35657 states and 115827 transitions. Word has length 70 [2019-01-01 00:34:24,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:34:24,573 INFO L480 AbstractCegarLoop]: Abstraction has 35657 states and 115827 transitions. [2019-01-01 00:34:24,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 00:34:24,573 INFO L276 IsEmpty]: Start isEmpty. Operand 35657 states and 115827 transitions. [2019-01-01 00:34:24,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-01 00:34:24,615 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:34:24,615 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 00:34:24,616 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:34:24,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:34:24,617 INFO L82 PathProgramCache]: Analyzing trace with hash -514484136, now seen corresponding path program 1 times [2019-01-01 00:34:24,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:34:24,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:34:24,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:24,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:34:24,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:24,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:34:24,948 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-01 00:34:24,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:34:24,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-01 00:34:24,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 00:34:24,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 00:34:24,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-01-01 00:34:24,950 INFO L87 Difference]: Start difference. First operand 35657 states and 115827 transitions. Second operand 8 states. [2019-01-01 00:34:27,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:34:27,179 INFO L93 Difference]: Finished difference Result 51571 states and 162646 transitions. [2019-01-01 00:34:27,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-01 00:34:27,179 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 70 [2019-01-01 00:34:27,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:34:27,304 INFO L225 Difference]: With dead ends: 51571 [2019-01-01 00:34:27,304 INFO L226 Difference]: Without dead ends: 51323 [2019-01-01 00:34:27,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-01-01 00:34:27,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51323 states. [2019-01-01 00:34:28,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51323 to 38086. [2019-01-01 00:34:28,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38086 states. [2019-01-01 00:34:28,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38086 states to 38086 states and 123157 transitions. [2019-01-01 00:34:28,698 INFO L78 Accepts]: Start accepts. Automaton has 38086 states and 123157 transitions. Word has length 70 [2019-01-01 00:34:28,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:34:28,698 INFO L480 AbstractCegarLoop]: Abstraction has 38086 states and 123157 transitions. [2019-01-01 00:34:28,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 00:34:28,698 INFO L276 IsEmpty]: Start isEmpty. Operand 38086 states and 123157 transitions. [2019-01-01 00:34:28,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-01 00:34:28,735 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:34:28,736 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 00:34:28,736 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:34:28,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:34:28,736 INFO L82 PathProgramCache]: Analyzing trace with hash -807887143, now seen corresponding path program 1 times [2019-01-01 00:34:28,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:34:28,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:34:28,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:28,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:34:28,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:28,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:34:28,988 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-01 00:34:28,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:34:28,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 00:34:28,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 00:34:28,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 00:34:28,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:34:28,989 INFO L87 Difference]: Start difference. First operand 38086 states and 123157 transitions. Second operand 5 states. [2019-01-01 00:34:29,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:34:29,068 INFO L93 Difference]: Finished difference Result 5418 states and 14328 transitions. [2019-01-01 00:34:29,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 00:34:29,069 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-01-01 00:34:29,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:34:29,076 INFO L225 Difference]: With dead ends: 5418 [2019-01-01 00:34:29,076 INFO L226 Difference]: Without dead ends: 4696 [2019-01-01 00:34:29,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:34:29,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4696 states. [2019-01-01 00:34:29,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4696 to 4448. [2019-01-01 00:34:29,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4448 states. [2019-01-01 00:34:29,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4448 states to 4448 states and 11840 transitions. [2019-01-01 00:34:29,131 INFO L78 Accepts]: Start accepts. Automaton has 4448 states and 11840 transitions. Word has length 70 [2019-01-01 00:34:29,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:34:29,132 INFO L480 AbstractCegarLoop]: Abstraction has 4448 states and 11840 transitions. [2019-01-01 00:34:29,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 00:34:29,132 INFO L276 IsEmpty]: Start isEmpty. Operand 4448 states and 11840 transitions. [2019-01-01 00:34:29,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-01 00:34:29,138 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:34:29,138 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 00:34:29,138 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:34:29,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:34:29,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1160314703, now seen corresponding path program 1 times [2019-01-01 00:34:29,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:34:29,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:34:29,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:29,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:34:29,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:29,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:34:29,201 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-01 00:34:29,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:34:29,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 00:34:29,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 00:34:29,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 00:34:29,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 00:34:29,203 INFO L87 Difference]: Start difference. First operand 4448 states and 11840 transitions. Second operand 3 states. [2019-01-01 00:34:29,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:34:29,347 INFO L93 Difference]: Finished difference Result 4573 states and 12119 transitions. [2019-01-01 00:34:29,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 00:34:29,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-01-01 00:34:29,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:34:29,355 INFO L225 Difference]: With dead ends: 4573 [2019-01-01 00:34:29,355 INFO L226 Difference]: Without dead ends: 4573 [2019-01-01 00:34:29,356 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-01 00:34:29,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4573 states. [2019-01-01 00:34:29,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4573 to 4506. [2019-01-01 00:34:29,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4506 states. [2019-01-01 00:34:29,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4506 states to 4506 states and 11970 transitions. [2019-01-01 00:34:29,411 INFO L78 Accepts]: Start accepts. Automaton has 4506 states and 11970 transitions. Word has length 89 [2019-01-01 00:34:29,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:34:29,411 INFO L480 AbstractCegarLoop]: Abstraction has 4506 states and 11970 transitions. [2019-01-01 00:34:29,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 00:34:29,411 INFO L276 IsEmpty]: Start isEmpty. Operand 4506 states and 11970 transitions. [2019-01-01 00:34:29,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-01 00:34:29,417 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:34:29,418 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 00:34:29,418 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:34:29,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:34:29,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1012155850, now seen corresponding path program 1 times [2019-01-01 00:34:29,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:34:29,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:34:29,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:29,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:34:29,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:29,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:34:29,854 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-01 00:34:29,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:34:29,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 00:34:29,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 00:34:29,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 00:34:29,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:34:29,856 INFO L87 Difference]: Start difference. First operand 4506 states and 11970 transitions. Second operand 5 states. [2019-01-01 00:34:30,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:34:30,454 INFO L93 Difference]: Finished difference Result 5158 states and 13499 transitions. [2019-01-01 00:34:30,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 00:34:30,455 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-01-01 00:34:30,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:34:30,462 INFO L225 Difference]: With dead ends: 5158 [2019-01-01 00:34:30,462 INFO L226 Difference]: Without dead ends: 5130 [2019-01-01 00:34:30,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-01 00:34:30,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5130 states. [2019-01-01 00:34:30,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5130 to 5038. [2019-01-01 00:34:30,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5038 states. [2019-01-01 00:34:30,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5038 states to 5038 states and 13233 transitions. [2019-01-01 00:34:30,524 INFO L78 Accepts]: Start accepts. Automaton has 5038 states and 13233 transitions. Word has length 89 [2019-01-01 00:34:30,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:34:30,524 INFO L480 AbstractCegarLoop]: Abstraction has 5038 states and 13233 transitions. [2019-01-01 00:34:30,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 00:34:30,524 INFO L276 IsEmpty]: Start isEmpty. Operand 5038 states and 13233 transitions. [2019-01-01 00:34:30,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-01 00:34:30,532 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:34:30,533 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 00:34:30,533 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:34:30,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:34:30,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1509856129, now seen corresponding path program 1 times [2019-01-01 00:34:30,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:34:30,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:34:30,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:30,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:34:30,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:30,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:34:30,724 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-01 00:34:30,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:34:30,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 00:34:30,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 00:34:30,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 00:34:30,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:34:30,725 INFO L87 Difference]: Start difference. First operand 5038 states and 13233 transitions. Second operand 4 states. [2019-01-01 00:34:31,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:34:31,046 INFO L93 Difference]: Finished difference Result 9234 states and 24456 transitions. [2019-01-01 00:34:31,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 00:34:31,047 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-01-01 00:34:31,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:34:31,060 INFO L225 Difference]: With dead ends: 9234 [2019-01-01 00:34:31,060 INFO L226 Difference]: Without dead ends: 9206 [2019-01-01 00:34:31,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:34:31,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9206 states. [2019-01-01 00:34:31,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9206 to 4900. [2019-01-01 00:34:31,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4900 states. [2019-01-01 00:34:31,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4900 states to 4900 states and 12810 transitions. [2019-01-01 00:34:31,155 INFO L78 Accepts]: Start accepts. Automaton has 4900 states and 12810 transitions. Word has length 91 [2019-01-01 00:34:31,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:34:31,156 INFO L480 AbstractCegarLoop]: Abstraction has 4900 states and 12810 transitions. [2019-01-01 00:34:31,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 00:34:31,156 INFO L276 IsEmpty]: Start isEmpty. Operand 4900 states and 12810 transitions. [2019-01-01 00:34:31,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-01 00:34:31,162 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:34:31,162 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 00:34:31,163 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:34:31,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:34:31,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1082731118, now seen corresponding path program 1 times [2019-01-01 00:34:31,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:34:31,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:34:31,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:31,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:34:31,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:31,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:34:31,325 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-01 00:34:31,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:34:31,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:34:31,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:34:31,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:34:31,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:34:31,327 INFO L87 Difference]: Start difference. First operand 4900 states and 12810 transitions. Second operand 6 states. [2019-01-01 00:34:31,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:34:31,589 INFO L93 Difference]: Finished difference Result 5421 states and 14010 transitions. [2019-01-01 00:34:31,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 00:34:31,590 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-01-01 00:34:31,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:34:31,598 INFO L225 Difference]: With dead ends: 5421 [2019-01-01 00:34:31,598 INFO L226 Difference]: Without dead ends: 5421 [2019-01-01 00:34:31,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:34:31,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5421 states. [2019-01-01 00:34:31,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5421 to 4982. [2019-01-01 00:34:31,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4982 states. [2019-01-01 00:34:31,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4982 states to 4982 states and 13010 transitions. [2019-01-01 00:34:31,658 INFO L78 Accepts]: Start accepts. Automaton has 4982 states and 13010 transitions. Word has length 91 [2019-01-01 00:34:31,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:34:31,659 INFO L480 AbstractCegarLoop]: Abstraction has 4982 states and 13010 transitions. [2019-01-01 00:34:31,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:34:31,659 INFO L276 IsEmpty]: Start isEmpty. Operand 4982 states and 13010 transitions. [2019-01-01 00:34:31,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-01 00:34:31,665 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:34:31,665 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 00:34:31,665 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:34:31,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:34:31,666 INFO L82 PathProgramCache]: Analyzing trace with hash 2052312141, now seen corresponding path program 1 times [2019-01-01 00:34:31,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:34:31,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:34:31,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:31,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:34:31,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:31,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:34:31,820 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-01 00:34:31,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:34:31,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:34:31,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:34:31,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:34:31,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:34:31,823 INFO L87 Difference]: Start difference. First operand 4982 states and 13010 transitions. Second operand 6 states. [2019-01-01 00:34:32,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:34:32,187 INFO L93 Difference]: Finished difference Result 6685 states and 17135 transitions. [2019-01-01 00:34:32,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:34:32,189 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-01-01 00:34:32,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:34:32,198 INFO L225 Difference]: With dead ends: 6685 [2019-01-01 00:34:32,198 INFO L226 Difference]: Without dead ends: 6653 [2019-01-01 00:34:32,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:34:32,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6653 states. [2019-01-01 00:34:32,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6653 to 5220. [2019-01-01 00:34:32,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5220 states. [2019-01-01 00:34:32,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5220 states to 5220 states and 13566 transitions. [2019-01-01 00:34:32,274 INFO L78 Accepts]: Start accepts. Automaton has 5220 states and 13566 transitions. Word has length 91 [2019-01-01 00:34:32,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:34:32,274 INFO L480 AbstractCegarLoop]: Abstraction has 5220 states and 13566 transitions. [2019-01-01 00:34:32,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:34:32,275 INFO L276 IsEmpty]: Start isEmpty. Operand 5220 states and 13566 transitions. [2019-01-01 00:34:32,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-01 00:34:32,283 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:34:32,283 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 00:34:32,284 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:34:32,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:34:32,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1769161677, now seen corresponding path program 1 times [2019-01-01 00:34:32,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:34:32,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:34:32,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:32,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:34:32,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:32,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:34:32,580 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-01 00:34:32,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:34:32,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 00:34:32,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 00:34:32,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 00:34:32,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:34:32,581 INFO L87 Difference]: Start difference. First operand 5220 states and 13566 transitions. Second operand 7 states. [2019-01-01 00:34:33,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:34:33,208 INFO L93 Difference]: Finished difference Result 10836 states and 28363 transitions. [2019-01-01 00:34:33,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-01 00:34:33,209 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2019-01-01 00:34:33,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:34:33,224 INFO L225 Difference]: With dead ends: 10836 [2019-01-01 00:34:33,224 INFO L226 Difference]: Without dead ends: 10836 [2019-01-01 00:34:33,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-01-01 00:34:33,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10836 states. [2019-01-01 00:34:33,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10836 to 5696. [2019-01-01 00:34:33,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5696 states. [2019-01-01 00:34:33,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5696 states to 5696 states and 14820 transitions. [2019-01-01 00:34:33,324 INFO L78 Accepts]: Start accepts. Automaton has 5696 states and 14820 transitions. Word has length 91 [2019-01-01 00:34:33,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:34:33,324 INFO L480 AbstractCegarLoop]: Abstraction has 5696 states and 14820 transitions. [2019-01-01 00:34:33,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 00:34:33,324 INFO L276 IsEmpty]: Start isEmpty. Operand 5696 states and 14820 transitions. [2019-01-01 00:34:33,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-01 00:34:33,335 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:34:33,335 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 00:34:33,335 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:34:33,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:34:33,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1281041138, now seen corresponding path program 1 times [2019-01-01 00:34:33,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:34:33,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:34:33,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:33,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:34:33,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:33,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:34:33,793 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-01 00:34:34,124 WARN L181 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 14 [2019-01-01 00:34:34,192 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-01 00:34:34,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:34:34,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 00:34:34,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 00:34:34,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 00:34:34,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:34:34,193 INFO L87 Difference]: Start difference. First operand 5696 states and 14820 transitions. Second operand 7 states. [2019-01-01 00:34:34,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:34:34,561 INFO L93 Difference]: Finished difference Result 5443 states and 14126 transitions. [2019-01-01 00:34:34,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 00:34:34,562 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2019-01-01 00:34:34,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:34:34,571 INFO L225 Difference]: With dead ends: 5443 [2019-01-01 00:34:34,571 INFO L226 Difference]: Without dead ends: 5443 [2019-01-01 00:34:34,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-01-01 00:34:34,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5443 states. [2019-01-01 00:34:34,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5443 to 5297. [2019-01-01 00:34:34,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5297 states. [2019-01-01 00:34:34,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5297 states to 5297 states and 13794 transitions. [2019-01-01 00:34:34,638 INFO L78 Accepts]: Start accepts. Automaton has 5297 states and 13794 transitions. Word has length 91 [2019-01-01 00:34:34,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:34:34,638 INFO L480 AbstractCegarLoop]: Abstraction has 5297 states and 13794 transitions. [2019-01-01 00:34:34,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 00:34:34,639 INFO L276 IsEmpty]: Start isEmpty. Operand 5297 states and 13794 transitions. [2019-01-01 00:34:34,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-01 00:34:34,645 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:34:34,646 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 00:34:34,646 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:34:34,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:34:34,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1059282431, now seen corresponding path program 1 times [2019-01-01 00:34:34,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:34:34,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:34:34,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:34,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:34:34,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:34,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:34:34,812 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-01 00:34:34,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:34:34,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 00:34:34,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 00:34:34,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 00:34:34,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:34:34,813 INFO L87 Difference]: Start difference. First operand 5297 states and 13794 transitions. Second operand 7 states. [2019-01-01 00:34:35,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:34:35,279 INFO L93 Difference]: Finished difference Result 5672 states and 14670 transitions. [2019-01-01 00:34:35,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:34:35,280 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2019-01-01 00:34:35,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:34:35,289 INFO L225 Difference]: With dead ends: 5672 [2019-01-01 00:34:35,289 INFO L226 Difference]: Without dead ends: 5672 [2019-01-01 00:34:35,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:34:35,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5672 states. [2019-01-01 00:34:35,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5672 to 5351. [2019-01-01 00:34:35,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5351 states. [2019-01-01 00:34:35,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5351 states to 5351 states and 13883 transitions. [2019-01-01 00:34:35,361 INFO L78 Accepts]: Start accepts. Automaton has 5351 states and 13883 transitions. Word has length 91 [2019-01-01 00:34:35,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:34:35,361 INFO L480 AbstractCegarLoop]: Abstraction has 5351 states and 13883 transitions. [2019-01-01 00:34:35,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 00:34:35,361 INFO L276 IsEmpty]: Start isEmpty. Operand 5351 states and 13883 transitions. [2019-01-01 00:34:35,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-01 00:34:35,368 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:34:35,368 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 00:34:35,369 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:34:35,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:34:35,369 INFO L82 PathProgramCache]: Analyzing trace with hash -124064866, now seen corresponding path program 1 times [2019-01-01 00:34:35,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:34:35,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:34:35,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:35,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:34:35,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:35,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:34:35,787 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 14 [2019-01-01 00:34:36,050 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2019-01-01 00:34:36,073 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-01 00:34:36,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:34:36,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 00:34:36,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 00:34:36,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 00:34:36,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:34:36,074 INFO L87 Difference]: Start difference. First operand 5351 states and 13883 transitions. Second operand 5 states. [2019-01-01 00:34:36,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:34:36,979 INFO L93 Difference]: Finished difference Result 5056 states and 13128 transitions. [2019-01-01 00:34:36,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 00:34:36,981 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-01-01 00:34:36,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:34:36,991 INFO L225 Difference]: With dead ends: 5056 [2019-01-01 00:34:36,992 INFO L226 Difference]: Without dead ends: 5056 [2019-01-01 00:34:36,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:34:37,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5056 states. [2019-01-01 00:34:37,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5056 to 4930. [2019-01-01 00:34:37,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4930 states. [2019-01-01 00:34:37,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4930 states to 4930 states and 12875 transitions. [2019-01-01 00:34:37,077 INFO L78 Accepts]: Start accepts. Automaton has 4930 states and 12875 transitions. Word has length 91 [2019-01-01 00:34:37,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:34:37,077 INFO L480 AbstractCegarLoop]: Abstraction has 4930 states and 12875 transitions. [2019-01-01 00:34:37,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 00:34:37,077 INFO L276 IsEmpty]: Start isEmpty. Operand 4930 states and 12875 transitions. [2019-01-01 00:34:37,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-01 00:34:37,087 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:34:37,087 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 00:34:37,087 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:34:37,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:34:37,088 INFO L82 PathProgramCache]: Analyzing trace with hash 897735391, now seen corresponding path program 1 times [2019-01-01 00:34:37,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:34:37,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:34:37,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:37,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:34:37,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:37,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:34:37,482 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2019-01-01 00:34:37,532 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-01 00:34:37,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:34:37,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:34:37,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:34:37,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:34:37,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:34:37,534 INFO L87 Difference]: Start difference. First operand 4930 states and 12875 transitions. Second operand 6 states. [2019-01-01 00:34:37,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:34:37,708 INFO L93 Difference]: Finished difference Result 3602 states and 9011 transitions. [2019-01-01 00:34:37,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 00:34:37,710 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-01-01 00:34:37,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:34:37,716 INFO L225 Difference]: With dead ends: 3602 [2019-01-01 00:34:37,717 INFO L226 Difference]: Without dead ends: 3602 [2019-01-01 00:34:37,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:34:37,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3602 states. [2019-01-01 00:34:37,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3602 to 2668. [2019-01-01 00:34:37,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2668 states. [2019-01-01 00:34:37,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2668 states to 2668 states and 6811 transitions. [2019-01-01 00:34:37,753 INFO L78 Accepts]: Start accepts. Automaton has 2668 states and 6811 transitions. Word has length 91 [2019-01-01 00:34:37,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:34:37,753 INFO L480 AbstractCegarLoop]: Abstraction has 2668 states and 6811 transitions. [2019-01-01 00:34:37,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:34:37,753 INFO L276 IsEmpty]: Start isEmpty. Operand 2668 states and 6811 transitions. [2019-01-01 00:34:37,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-01 00:34:37,756 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:34:37,757 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 00:34:37,757 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:34:37,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:34:37,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1422839622, now seen corresponding path program 1 times [2019-01-01 00:34:37,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:34:37,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:34:37,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:37,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:34:37,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:37,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:34:37,942 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-01 00:34:37,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:34:37,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 00:34:37,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 00:34:37,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 00:34:37,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:34:37,944 INFO L87 Difference]: Start difference. First operand 2668 states and 6811 transitions. Second operand 7 states. [2019-01-01 00:34:38,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:34:38,509 INFO L93 Difference]: Finished difference Result 4255 states and 10595 transitions. [2019-01-01 00:34:38,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-01 00:34:38,513 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-01-01 00:34:38,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:34:38,519 INFO L225 Difference]: With dead ends: 4255 [2019-01-01 00:34:38,519 INFO L226 Difference]: Without dead ends: 4255 [2019-01-01 00:34:38,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-01-01 00:34:38,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4255 states. [2019-01-01 00:34:38,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4255 to 3018. [2019-01-01 00:34:38,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3018 states. [2019-01-01 00:34:38,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 3018 states and 7669 transitions. [2019-01-01 00:34:38,563 INFO L78 Accepts]: Start accepts. Automaton has 3018 states and 7669 transitions. Word has length 93 [2019-01-01 00:34:38,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:34:38,563 INFO L480 AbstractCegarLoop]: Abstraction has 3018 states and 7669 transitions. [2019-01-01 00:34:38,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 00:34:38,563 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 7669 transitions. [2019-01-01 00:34:38,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-01 00:34:38,568 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:34:38,568 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 00:34:38,568 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:34:38,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:34:38,568 INFO L82 PathProgramCache]: Analyzing trace with hash -178075141, now seen corresponding path program 1 times [2019-01-01 00:34:38,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:34:38,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:34:38,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:38,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:34:38,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:38,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:34:38,784 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-01 00:34:38,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:34:38,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 00:34:38,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 00:34:38,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 00:34:38,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:34:38,785 INFO L87 Difference]: Start difference. First operand 3018 states and 7669 transitions. Second operand 7 states. [2019-01-01 00:34:39,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:34:39,117 INFO L93 Difference]: Finished difference Result 3035 states and 7701 transitions. [2019-01-01 00:34:39,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 00:34:39,118 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-01-01 00:34:39,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:34:39,123 INFO L225 Difference]: With dead ends: 3035 [2019-01-01 00:34:39,123 INFO L226 Difference]: Without dead ends: 3035 [2019-01-01 00:34:39,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-01 00:34:39,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3035 states. [2019-01-01 00:34:39,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3035 to 3018. [2019-01-01 00:34:39,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3018 states. [2019-01-01 00:34:39,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 3018 states and 7666 transitions. [2019-01-01 00:34:39,159 INFO L78 Accepts]: Start accepts. Automaton has 3018 states and 7666 transitions. Word has length 93 [2019-01-01 00:34:39,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:34:39,159 INFO L480 AbstractCegarLoop]: Abstraction has 3018 states and 7666 transitions. [2019-01-01 00:34:39,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 00:34:39,159 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 7666 transitions. [2019-01-01 00:34:39,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-01 00:34:39,163 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:34:39,164 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 00:34:39,164 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:34:39,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:34:39,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1963213381, now seen corresponding path program 2 times [2019-01-01 00:34:39,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:34:39,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:34:39,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:39,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:34:39,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:39,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:34:39,463 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-01 00:34:39,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:34:39,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:34:39,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:34:39,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:34:39,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:34:39,464 INFO L87 Difference]: Start difference. First operand 3018 states and 7666 transitions. Second operand 6 states. [2019-01-01 00:34:39,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:34:39,611 INFO L93 Difference]: Finished difference Result 3143 states and 7873 transitions. [2019-01-01 00:34:39,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 00:34:39,612 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-01-01 00:34:39,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:34:39,617 INFO L225 Difference]: With dead ends: 3143 [2019-01-01 00:34:39,617 INFO L226 Difference]: Without dead ends: 3143 [2019-01-01 00:34:39,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-01-01 00:34:39,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3143 states. [2019-01-01 00:34:39,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3143 to 3033. [2019-01-01 00:34:39,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3033 states. [2019-01-01 00:34:39,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3033 states to 3033 states and 7659 transitions. [2019-01-01 00:34:39,651 INFO L78 Accepts]: Start accepts. Automaton has 3033 states and 7659 transitions. Word has length 93 [2019-01-01 00:34:39,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:34:39,652 INFO L480 AbstractCegarLoop]: Abstraction has 3033 states and 7659 transitions. [2019-01-01 00:34:39,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:34:39,652 INFO L276 IsEmpty]: Start isEmpty. Operand 3033 states and 7659 transitions. [2019-01-01 00:34:39,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-01 00:34:39,655 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:34:39,656 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 00:34:39,656 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:34:39,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:34:39,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1409070332, now seen corresponding path program 1 times [2019-01-01 00:34:39,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:34:39,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:34:39,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:39,658 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 00:34:39,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:39,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:34:39,905 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-01 00:34:39,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:34:39,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 00:34:39,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 00:34:39,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 00:34:39,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:34:39,907 INFO L87 Difference]: Start difference. First operand 3033 states and 7659 transitions. Second operand 7 states. [2019-01-01 00:34:40,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:34:40,397 INFO L93 Difference]: Finished difference Result 4247 states and 10942 transitions. [2019-01-01 00:34:40,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 00:34:40,399 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-01-01 00:34:40,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:34:40,405 INFO L225 Difference]: With dead ends: 4247 [2019-01-01 00:34:40,406 INFO L226 Difference]: Without dead ends: 4247 [2019-01-01 00:34:40,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-01-01 00:34:40,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4247 states. [2019-01-01 00:34:40,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4247 to 2690. [2019-01-01 00:34:40,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2690 states. [2019-01-01 00:34:40,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2690 states to 2690 states and 6779 transitions. [2019-01-01 00:34:40,444 INFO L78 Accepts]: Start accepts. Automaton has 2690 states and 6779 transitions. Word has length 93 [2019-01-01 00:34:40,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:34:40,444 INFO L480 AbstractCegarLoop]: Abstraction has 2690 states and 6779 transitions. [2019-01-01 00:34:40,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 00:34:40,445 INFO L276 IsEmpty]: Start isEmpty. Operand 2690 states and 6779 transitions. [2019-01-01 00:34:40,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-01 00:34:40,448 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:34:40,448 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 00:34:40,449 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:34:40,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:34:40,449 INFO L82 PathProgramCache]: Analyzing trace with hash 494071612, now seen corresponding path program 1 times [2019-01-01 00:34:40,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:34:40,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:34:40,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:40,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:34:40,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:40,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:34:40,777 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-01 00:34:40,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:34:40,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 00:34:40,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 00:34:40,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 00:34:40,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:34:40,779 INFO L87 Difference]: Start difference. First operand 2690 states and 6779 transitions. Second operand 5 states. [2019-01-01 00:34:40,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:34:40,994 INFO L93 Difference]: Finished difference Result 3042 states and 7643 transitions. [2019-01-01 00:34:40,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:34:40,996 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-01-01 00:34:40,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:34:41,001 INFO L225 Difference]: With dead ends: 3042 [2019-01-01 00:34:41,002 INFO L226 Difference]: Without dead ends: 3010 [2019-01-01 00:34:41,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:34:41,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3010 states. [2019-01-01 00:34:41,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3010 to 2506. [2019-01-01 00:34:41,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2506 states. [2019-01-01 00:34:41,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2506 states and 6320 transitions. [2019-01-01 00:34:41,035 INFO L78 Accepts]: Start accepts. Automaton has 2506 states and 6320 transitions. Word has length 93 [2019-01-01 00:34:41,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:34:41,035 INFO L480 AbstractCegarLoop]: Abstraction has 2506 states and 6320 transitions. [2019-01-01 00:34:41,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 00:34:41,035 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 6320 transitions. [2019-01-01 00:34:41,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-01 00:34:41,039 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:34:41,039 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 00:34:41,039 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:34:41,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:34:41,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1738836093, now seen corresponding path program 1 times [2019-01-01 00:34:41,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:34:41,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:34:41,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:41,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:34:41,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:41,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:34:41,220 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-01 00:34:41,266 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-01 00:34:41,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:34:41,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 00:34:41,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 00:34:41,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 00:34:41,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:34:41,268 INFO L87 Difference]: Start difference. First operand 2506 states and 6320 transitions. Second operand 7 states. [2019-01-01 00:34:41,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:34:41,627 INFO L93 Difference]: Finished difference Result 4157 states and 10703 transitions. [2019-01-01 00:34:41,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 00:34:41,628 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-01-01 00:34:41,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:34:41,632 INFO L225 Difference]: With dead ends: 4157 [2019-01-01 00:34:41,632 INFO L226 Difference]: Without dead ends: 1726 [2019-01-01 00:34:41,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-01-01 00:34:41,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1726 states. [2019-01-01 00:34:41,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1726 to 1726. [2019-01-01 00:34:41,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1726 states. [2019-01-01 00:34:41,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 4513 transitions. [2019-01-01 00:34:41,652 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 4513 transitions. Word has length 93 [2019-01-01 00:34:41,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:34:41,653 INFO L480 AbstractCegarLoop]: Abstraction has 1726 states and 4513 transitions. [2019-01-01 00:34:41,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 00:34:41,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 4513 transitions. [2019-01-01 00:34:41,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-01 00:34:41,655 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:34:41,656 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 00:34:41,656 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:34:41,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:34:41,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1752144950, now seen corresponding path program 1 times [2019-01-01 00:34:41,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:34:41,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:34:41,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:41,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:34:41,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:41,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:34:42,072 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2019-01-01 00:34:42,590 WARN L181 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 16 [2019-01-01 00:34:42,615 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-01 00:34:42,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:34:42,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:34:42,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:34:42,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:34:42,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:34:42,620 INFO L87 Difference]: Start difference. First operand 1726 states and 4513 transitions. Second operand 6 states. [2019-01-01 00:34:42,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:34:42,934 INFO L93 Difference]: Finished difference Result 1812 states and 4666 transitions. [2019-01-01 00:34:42,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:34:42,935 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-01-01 00:34:42,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:34:42,938 INFO L225 Difference]: With dead ends: 1812 [2019-01-01 00:34:42,938 INFO L226 Difference]: Without dead ends: 1792 [2019-01-01 00:34:42,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:34:42,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1792 states. [2019-01-01 00:34:42,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1792 to 1718. [2019-01-01 00:34:42,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1718 states. [2019-01-01 00:34:42,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1718 states and 4487 transitions. [2019-01-01 00:34:42,959 INFO L78 Accepts]: Start accepts. Automaton has 1718 states and 4487 transitions. Word has length 93 [2019-01-01 00:34:42,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:34:42,959 INFO L480 AbstractCegarLoop]: Abstraction has 1718 states and 4487 transitions. [2019-01-01 00:34:42,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:34:42,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 4487 transitions. [2019-01-01 00:34:42,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-01 00:34:42,962 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:34:42,962 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 00:34:42,963 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:34:42,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:34:42,963 INFO L82 PathProgramCache]: Analyzing trace with hash 2094125707, now seen corresponding path program 2 times [2019-01-01 00:34:42,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:34:42,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:34:42,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:42,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:34:42,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:42,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:34:43,132 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-01 00:34:43,213 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-01 00:34:43,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:34:43,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-01 00:34:43,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 00:34:43,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 00:34:43,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-01 00:34:43,214 INFO L87 Difference]: Start difference. First operand 1718 states and 4487 transitions. Second operand 12 states. [2019-01-01 00:34:43,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:34:43,886 INFO L93 Difference]: Finished difference Result 3315 states and 8720 transitions. [2019-01-01 00:34:43,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-01 00:34:43,887 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 93 [2019-01-01 00:34:43,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:34:43,891 INFO L225 Difference]: With dead ends: 3315 [2019-01-01 00:34:43,891 INFO L226 Difference]: Without dead ends: 2339 [2019-01-01 00:34:43,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2019-01-01 00:34:43,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2339 states. [2019-01-01 00:34:43,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2339 to 2187. [2019-01-01 00:34:43,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2187 states. [2019-01-01 00:34:43,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2187 states to 2187 states and 5546 transitions. [2019-01-01 00:34:43,917 INFO L78 Accepts]: Start accepts. Automaton has 2187 states and 5546 transitions. Word has length 93 [2019-01-01 00:34:43,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:34:43,917 INFO L480 AbstractCegarLoop]: Abstraction has 2187 states and 5546 transitions. [2019-01-01 00:34:43,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 00:34:43,917 INFO L276 IsEmpty]: Start isEmpty. Operand 2187 states and 5546 transitions. [2019-01-01 00:34:43,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-01 00:34:43,920 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:34:43,920 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 00:34:43,921 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:34:43,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:34:43,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1369725745, now seen corresponding path program 3 times [2019-01-01 00:34:43,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:34:43,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:34:43,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:43,923 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 00:34:43,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:34:43,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 00:34:43,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 00:34:44,024 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-01 00:34:44,221 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-01 00:34:44,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 12:34:44 BasicIcfg [2019-01-01 00:34:44,225 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 00:34:44,226 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 00:34:44,226 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 00:34:44,226 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 00:34:44,227 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 12:34:03" (3/4) ... [2019-01-01 00:34:44,230 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-01 00:34:44,395 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 00:34:44,395 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 00:34:44,396 INFO L168 Benchmark]: Toolchain (without parser) took 42826.99 ms. Allocated memory was 1.0 GB in the beginning and 3.1 GB in the end (delta: 2.1 GB). Free memory was 946.0 MB in the beginning and 1.7 GB in the end (delta: -790.5 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-01-01 00:34:44,398 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 00:34:44,399 INFO L168 Benchmark]: CACSL2BoogieTranslator took 880.88 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -148.6 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2019-01-01 00:34:44,399 INFO L168 Benchmark]: Boogie Procedure Inliner took 93.23 ms. Allocated memory is still 1.1 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. [2019-01-01 00:34:44,402 INFO L168 Benchmark]: Boogie Preprocessor took 71.58 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 00:34:44,402 INFO L168 Benchmark]: RCFGBuilder took 1293.33 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.3 MB). Peak memory consumption was 45.3 MB. Max. memory is 11.5 GB. [2019-01-01 00:34:44,402 INFO L168 Benchmark]: TraceAbstraction took 40313.35 ms. Allocated memory was 1.1 GB in the beginning and 3.1 GB in the end (delta: 2.0 GB). Free memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: -740.5 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-01-01 00:34:44,405 INFO L168 Benchmark]: Witness Printer took 169.15 ms. Allocated memory is still 3.1 GB. Free memory was 1.8 GB in the beginning and 1.7 GB in the end (delta: 41.1 MB). Peak memory consumption was 41.1 MB. Max. memory is 11.5 GB. [2019-01-01 00:34:44,409 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 880.88 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -148.6 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 93.23 ms. Allocated memory is still 1.1 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 71.58 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1293.33 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.3 MB). Peak memory consumption was 45.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 40313.35 ms. Allocated memory was 1.1 GB in the beginning and 3.1 GB in the end (delta: 2.0 GB). Free memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: -740.5 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 169.15 ms. Allocated memory is still 3.1 GB. Free memory was 1.8 GB in the beginning and 1.7 GB in the end (delta: 41.1 MB). Peak memory consumption was 41.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L672] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L673] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L675] -1 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L676] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L677] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L678] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L679] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L680] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L681] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L682] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L683] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L684] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L685] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L686] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L687] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L688] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L689] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L691] -1 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L692] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L693] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L753] -1 pthread_t t2481; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L754] FCALL, FORK -1 pthread_create(&t2481, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L755] -1 pthread_t t2482; VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L756] FCALL, FORK -1 pthread_create(&t2482, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L717] 0 x$w_buff1 = x$w_buff0 [L718] 0 x$w_buff0 = 2 [L719] 0 x$w_buff1_used = x$w_buff0_used [L720] 0 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L722] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L723] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L724] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L725] 0 x$r_buff0_thd2 = (_Bool)1 [L728] 0 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L731] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L697] 1 y = 2 [L700] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L703] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L703] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=2] [L703] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=2] [L703] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L704] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L704] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L705] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L705] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L731] 0 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L706] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L706] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L732] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L733] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L733] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L734] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L734] 0 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L735] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L735] 0 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L738] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L707] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L707] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L710] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L758] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] -1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L763] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L763] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L764] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L764] -1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L765] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L765] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L766] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L766] -1 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L769] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L770] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L771] -1 x$flush_delayed = weak$$choice2 [L772] -1 x$mem_tmp = x VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L773] EXPR -1 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L773] -1 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L774] EXPR -1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L774] -1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L775] EXPR -1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] -1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L776] EXPR -1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L776] -1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L777] EXPR -1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L777] -1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L778] EXPR -1 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L778] -1 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L779] EXPR -1 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L779] -1 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L780] -1 main$tmp_guard1 = !(x == 2 && y == 2) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L781] EXPR -1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L781] -1 x = x$flush_delayed ? x$mem_tmp : x [L782] -1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 178 locations, 3 error locations. UNSAFE Result, 40.1s OverallTime, 29 OverallIterations, 1 TraceHistogramMax, 19.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6642 SDtfs, 6168 SDslu, 15213 SDs, 0 SdLazy, 6874 SolverSat, 355 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 284 GetRequests, 84 SyntacticMatches, 13 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 8.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38086occurred 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: 9.4s AutomataMinimizationTime, 28 MinimizatonAttempts, 92493 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.9s InterpolantComputationTime, 2325 NumberOfCodeBlocks, 2325 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2204 ConstructedInterpolants, 0 QuantifiedInterpolants, 452017 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...