./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/rfi001_power.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/rfi001_power.oepc_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 e569b430217d4d95b0f56c5eff2b67b3953ad262 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-13 03:40:36,595 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 03:40:36,597 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 03:40:36,609 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 03:40:36,609 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 03:40:36,612 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 03:40:36,615 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 03:40:36,618 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 03:40:36,620 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 03:40:36,623 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 03:40:36,625 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 03:40:36,625 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 03:40:36,626 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 03:40:36,627 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 03:40:36,628 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 03:40:36,629 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 03:40:36,630 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 03:40:36,632 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 03:40:36,634 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 03:40:36,636 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 03:40:36,637 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 03:40:36,638 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 03:40:36,641 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 03:40:36,644 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 03:40:36,644 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 03:40:36,645 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 03:40:36,646 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 03:40:36,649 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 03:40:36,652 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 03:40:36,654 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 03:40:36,654 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 03:40:36,655 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 03:40:36,655 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 03:40:36,655 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 03:40:36,656 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 03:40:36,659 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 03:40:36,660 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-13 03:40:36,691 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 03:40:36,692 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 03:40:36,693 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 03:40:36,693 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 03:40:36,693 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 03:40:36,693 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 03:40:36,693 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 03:40:36,694 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 03:40:36,695 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 03:40:36,695 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 03:40:36,695 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-13 03:40:36,695 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 03:40:36,695 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-13 03:40:36,695 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 03:40:36,696 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-13 03:40:36,696 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 03:40:36,696 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-13 03:40:36,696 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 03:40:36,696 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 03:40:36,697 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 03:40:36,698 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 03:40:36,698 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 03:40:36,698 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 03:40:36,699 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 03:40:36,699 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-13 03:40:36,699 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 03:40:36,699 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 03:40:36,699 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-13 03:40:36,699 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 -> e569b430217d4d95b0f56c5eff2b67b3953ad262 [2019-01-13 03:40:36,736 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 03:40:36,748 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 03:40:36,752 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 03:40:36,754 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 03:40:36,754 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 03:40:36,755 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/rfi001_power.oepc_false-unreach-call.i [2019-01-13 03:40:36,806 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8a2f3ac1/458a1489e96a4cee9234722a726e4a0e/FLAGb1b95e5cc [2019-01-13 03:40:37,278 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 03:40:37,278 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/rfi001_power.oepc_false-unreach-call.i [2019-01-13 03:40:37,303 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8a2f3ac1/458a1489e96a4cee9234722a726e4a0e/FLAGb1b95e5cc [2019-01-13 03:40:37,643 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8a2f3ac1/458a1489e96a4cee9234722a726e4a0e [2019-01-13 03:40:37,647 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 03:40:37,648 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-13 03:40:37,650 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 03:40:37,650 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 03:40:37,654 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 03:40:37,655 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 03:40:37" (1/1) ... [2019-01-13 03:40:37,659 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e23d9bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:40:37, skipping insertion in model container [2019-01-13 03:40:37,659 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 03:40:37" (1/1) ... [2019-01-13 03:40:37,668 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 03:40:37,734 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 03:40:38,240 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 03:40:38,268 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 03:40:38,421 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 03:40:38,502 INFO L195 MainTranslator]: Completed translation [2019-01-13 03:40:38,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:40:38 WrapperNode [2019-01-13 03:40:38,503 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 03:40:38,504 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-13 03:40:38,504 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-13 03:40:38,504 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-13 03:40:38,514 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:40:38" (1/1) ... [2019-01-13 03:40:38,548 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:40:38" (1/1) ... [2019-01-13 03:40:38,578 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-13 03:40:38,579 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 03:40:38,579 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 03:40:38,579 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 03:40:38,588 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:40:38" (1/1) ... [2019-01-13 03:40:38,588 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:40:38" (1/1) ... [2019-01-13 03:40:38,594 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:40:38" (1/1) ... [2019-01-13 03:40:38,595 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:40:38" (1/1) ... [2019-01-13 03:40:38,618 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:40:38" (1/1) ... [2019-01-13 03:40:38,627 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:40:38" (1/1) ... [2019-01-13 03:40:38,630 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:40:38" (1/1) ... [2019-01-13 03:40:38,641 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 03:40:38,642 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 03:40:38,646 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 03:40:38,646 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 03:40:38,647 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:40:38" (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-13 03:40:38,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 03:40:38,696 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-13 03:40:38,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 03:40:38,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 03:40:38,696 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-13 03:40:38,697 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-13 03:40:38,697 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-13 03:40:38,697 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-13 03:40:38,697 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-13 03:40:38,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 03:40:38,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 03:40:38,699 WARN L204 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-01-13 03:40:39,857 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 03:40:39,858 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-13 03:40:39,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 03:40:39 BoogieIcfgContainer [2019-01-13 03:40:39,859 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 03:40:39,861 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 03:40:39,861 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 03:40:39,864 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 03:40:39,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 03:40:37" (1/3) ... [2019-01-13 03:40:39,866 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70eb55f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 03:40:39, skipping insertion in model container [2019-01-13 03:40:39,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:40:38" (2/3) ... [2019-01-13 03:40:39,866 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70eb55f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 03:40:39, skipping insertion in model container [2019-01-13 03:40:39,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 03:40:39" (3/3) ... [2019-01-13 03:40:39,869 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi001_power.oepc_false-unreach-call.i [2019-01-13 03:40:39,912 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,912 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,912 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,913 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,913 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,913 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,913 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,914 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,914 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,915 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,915 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,915 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,915 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,915 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,916 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,916 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,916 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,917 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,918 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,918 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,918 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,919 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,920 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,920 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,920 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,920 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,921 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,921 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,922 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,922 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,922 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,922 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,923 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,923 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,923 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,923 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,923 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,924 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,927 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,927 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,927 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,927 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,927 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,927 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,928 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,929 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,929 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,929 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,929 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,929 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,931 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,931 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,931 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,931 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,932 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,932 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,932 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,932 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,934 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,934 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,934 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,934 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,935 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,935 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,935 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,935 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,936 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,937 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,937 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,937 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,938 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,938 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,938 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,938 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,939 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,940 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,940 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,940 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,941 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,941 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,941 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,941 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,941 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,942 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,943 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,943 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,944 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,944 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,944 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,944 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,944 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,945 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,946 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,946 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,947 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,947 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,947 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,947 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,947 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,948 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,949 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,949 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,949 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,950 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,950 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,952 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,952 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,952 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,952 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,953 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,954 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,955 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,955 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,955 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,955 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,955 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,957 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,957 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,957 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,958 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,958 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,958 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,958 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,958 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,959 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,960 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,960 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,960 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,961 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,961 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,962 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,962 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,962 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,962 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,962 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,963 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,963 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,963 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,963 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,963 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,964 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,966 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,966 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,966 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,966 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,967 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,968 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,968 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,968 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,968 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,968 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,970 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,970 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,970 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,970 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,970 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,971 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,972 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:39,972 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:40,003 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-13 03:40:40,003 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 03:40:40,012 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-13 03:40:40,029 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-13 03:40:40,059 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 03:40:40,060 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 03:40:40,060 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-13 03:40:40,061 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 03:40:40,061 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 03:40:40,061 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 03:40:40,061 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 03:40:40,061 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 03:40:40,061 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 03:40:40,081 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143places, 181 transitions [2019-01-13 03:40:42,360 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34807 states. [2019-01-13 03:40:42,362 INFO L276 IsEmpty]: Start isEmpty. Operand 34807 states. [2019-01-13 03:40:42,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-13 03:40:42,369 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:40:42,371 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:40:42,373 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:40:42,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:40:42,379 INFO L82 PathProgramCache]: Analyzing trace with hash 314479455, now seen corresponding path program 1 times [2019-01-13 03:40:42,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:40:42,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:40:42,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:42,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:40:42,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:42,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:40:42,723 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-13 03:40:42,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:40:42,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:40:42,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:40:42,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:40:42,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:40:42,748 INFO L87 Difference]: Start difference. First operand 34807 states. Second operand 4 states. [2019-01-13 03:40:44,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:40:44,196 INFO L93 Difference]: Finished difference Result 60791 states and 234494 transitions. [2019-01-13 03:40:44,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 03:40:44,199 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-01-13 03:40:44,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:40:44,564 INFO L225 Difference]: With dead ends: 60791 [2019-01-13 03:40:44,565 INFO L226 Difference]: Without dead ends: 44271 [2019-01-13 03:40:44,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:40:44,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44271 states. [2019-01-13 03:40:46,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44271 to 27339. [2019-01-13 03:40:46,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27339 states. [2019-01-13 03:40:46,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27339 states to 27339 states and 105500 transitions. [2019-01-13 03:40:46,332 INFO L78 Accepts]: Start accepts. Automaton has 27339 states and 105500 transitions. Word has length 34 [2019-01-13 03:40:46,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:40:46,333 INFO L480 AbstractCegarLoop]: Abstraction has 27339 states and 105500 transitions. [2019-01-13 03:40:46,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:40:46,333 INFO L276 IsEmpty]: Start isEmpty. Operand 27339 states and 105500 transitions. [2019-01-13 03:40:46,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-13 03:40:46,345 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:40:46,345 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] [2019-01-13 03:40:46,345 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:40:46,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:40:46,346 INFO L82 PathProgramCache]: Analyzing trace with hash -494436635, now seen corresponding path program 1 times [2019-01-13 03:40:46,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:40:46,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:40:46,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:46,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:40:46,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:46,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:40:46,497 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-13 03:40:46,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:40:46,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:40:46,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:40:46,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:40:46,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:40:46,500 INFO L87 Difference]: Start difference. First operand 27339 states and 105500 transitions. Second operand 5 states. [2019-01-13 03:40:48,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:40:48,837 INFO L93 Difference]: Finished difference Result 64005 states and 235335 transitions. [2019-01-13 03:40:48,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 03:40:48,837 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-01-13 03:40:48,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:40:49,053 INFO L225 Difference]: With dead ends: 64005 [2019-01-13 03:40:49,053 INFO L226 Difference]: Without dead ends: 63453 [2019-01-13 03:40:49,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:40:49,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63453 states. [2019-01-13 03:40:50,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63453 to 41421. [2019-01-13 03:40:50,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41421 states. [2019-01-13 03:40:50,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41421 states to 41421 states and 152330 transitions. [2019-01-13 03:40:50,453 INFO L78 Accepts]: Start accepts. Automaton has 41421 states and 152330 transitions. Word has length 46 [2019-01-13 03:40:50,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:40:50,455 INFO L480 AbstractCegarLoop]: Abstraction has 41421 states and 152330 transitions. [2019-01-13 03:40:50,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:40:50,455 INFO L276 IsEmpty]: Start isEmpty. Operand 41421 states and 152330 transitions. [2019-01-13 03:40:50,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-13 03:40:50,461 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:40:50,461 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] [2019-01-13 03:40:50,461 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:40:50,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:40:50,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1026875031, now seen corresponding path program 1 times [2019-01-13 03:40:50,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:40:50,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:40:50,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:50,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:40:50,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:50,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:40:50,641 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-13 03:40:50,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:40:50,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:40:50,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:40:50,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:40:50,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:40:50,644 INFO L87 Difference]: Start difference. First operand 41421 states and 152330 transitions. Second operand 5 states. [2019-01-13 03:40:51,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:40:51,921 INFO L93 Difference]: Finished difference Result 81367 states and 298048 transitions. [2019-01-13 03:40:51,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 03:40:51,921 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-01-13 03:40:51,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:40:52,152 INFO L225 Difference]: With dead ends: 81367 [2019-01-13 03:40:52,152 INFO L226 Difference]: Without dead ends: 80855 [2019-01-13 03:40:52,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:40:52,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80855 states. [2019-01-13 03:40:54,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80855 to 45375. [2019-01-13 03:40:54,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45375 states. [2019-01-13 03:40:54,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45375 states to 45375 states and 166018 transitions. [2019-01-13 03:40:54,432 INFO L78 Accepts]: Start accepts. Automaton has 45375 states and 166018 transitions. Word has length 47 [2019-01-13 03:40:54,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:40:54,432 INFO L480 AbstractCegarLoop]: Abstraction has 45375 states and 166018 transitions. [2019-01-13 03:40:54,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:40:54,433 INFO L276 IsEmpty]: Start isEmpty. Operand 45375 states and 166018 transitions. [2019-01-13 03:40:54,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-13 03:40:54,443 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:40:54,443 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] [2019-01-13 03:40:54,443 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:40:54,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:40:54,443 INFO L82 PathProgramCache]: Analyzing trace with hash -43389411, now seen corresponding path program 1 times [2019-01-13 03:40:54,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:40:54,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:40:54,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:54,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:40:54,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:54,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:40:54,549 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-13 03:40:54,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:40:54,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 03:40:54,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 03:40:54,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 03:40:54,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 03:40:54,550 INFO L87 Difference]: Start difference. First operand 45375 states and 166018 transitions. Second operand 3 states. [2019-01-13 03:40:54,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:40:54,838 INFO L93 Difference]: Finished difference Result 65251 states and 235814 transitions. [2019-01-13 03:40:54,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 03:40:54,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-01-13 03:40:54,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:40:54,976 INFO L225 Difference]: With dead ends: 65251 [2019-01-13 03:40:54,977 INFO L226 Difference]: Without dead ends: 65251 [2019-01-13 03:40:54,977 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-13 03:40:55,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65251 states. [2019-01-13 03:40:56,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65251 to 50945. [2019-01-13 03:40:56,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50945 states. [2019-01-13 03:41:00,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50945 states to 50945 states and 184325 transitions. [2019-01-13 03:41:00,255 INFO L78 Accepts]: Start accepts. Automaton has 50945 states and 184325 transitions. Word has length 49 [2019-01-13 03:41:00,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:41:00,256 INFO L480 AbstractCegarLoop]: Abstraction has 50945 states and 184325 transitions. [2019-01-13 03:41:00,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 03:41:00,256 INFO L276 IsEmpty]: Start isEmpty. Operand 50945 states and 184325 transitions. [2019-01-13 03:41:00,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-13 03:41:00,271 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:41:00,272 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] [2019-01-13 03:41:00,272 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:41:00,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:41:00,272 INFO L82 PathProgramCache]: Analyzing trace with hash -860096332, now seen corresponding path program 1 times [2019-01-13 03:41:00,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:41:00,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:41:00,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:00,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:41:00,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:00,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:41:00,548 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-13 03:41:00,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:41:00,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:41:00,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:41:00,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:41:00,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:41:00,550 INFO L87 Difference]: Start difference. First operand 50945 states and 184325 transitions. Second operand 6 states. [2019-01-13 03:41:01,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:41:01,837 INFO L93 Difference]: Finished difference Result 67511 states and 242185 transitions. [2019-01-13 03:41:01,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 03:41:01,838 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-01-13 03:41:01,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:41:01,980 INFO L225 Difference]: With dead ends: 67511 [2019-01-13 03:41:01,980 INFO L226 Difference]: Without dead ends: 67511 [2019-01-13 03:41:01,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:41:02,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67511 states. [2019-01-13 03:41:03,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67511 to 63436. [2019-01-13 03:41:03,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63436 states. [2019-01-13 03:41:03,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63436 states to 63436 states and 227584 transitions. [2019-01-13 03:41:03,882 INFO L78 Accepts]: Start accepts. Automaton has 63436 states and 227584 transitions. Word has length 53 [2019-01-13 03:41:03,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:41:03,882 INFO L480 AbstractCegarLoop]: Abstraction has 63436 states and 227584 transitions. [2019-01-13 03:41:03,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:41:03,883 INFO L276 IsEmpty]: Start isEmpty. Operand 63436 states and 227584 transitions. [2019-01-13 03:41:03,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-13 03:41:03,895 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:41:03,896 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] [2019-01-13 03:41:03,896 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:41:03,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:41:03,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1637919605, now seen corresponding path program 1 times [2019-01-13 03:41:03,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:41:03,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:41:03,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:03,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:41:03,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:03,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:41:04,067 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-13 03:41:04,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:41:04,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:41:04,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:41:04,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:41:04,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:41:04,068 INFO L87 Difference]: Start difference. First operand 63436 states and 227584 transitions. Second operand 7 states. [2019-01-13 03:41:05,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:41:05,666 INFO L93 Difference]: Finished difference Result 88528 states and 306201 transitions. [2019-01-13 03:41:05,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-13 03:41:05,667 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-01-13 03:41:05,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:41:05,853 INFO L225 Difference]: With dead ends: 88528 [2019-01-13 03:41:05,854 INFO L226 Difference]: Without dead ends: 88528 [2019-01-13 03:41:05,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-01-13 03:41:06,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88528 states. [2019-01-13 03:41:07,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88528 to 74881. [2019-01-13 03:41:07,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74881 states. [2019-01-13 03:41:07,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74881 states to 74881 states and 262987 transitions. [2019-01-13 03:41:07,341 INFO L78 Accepts]: Start accepts. Automaton has 74881 states and 262987 transitions. Word has length 53 [2019-01-13 03:41:07,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:41:07,341 INFO L480 AbstractCegarLoop]: Abstraction has 74881 states and 262987 transitions. [2019-01-13 03:41:07,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:41:07,341 INFO L276 IsEmpty]: Start isEmpty. Operand 74881 states and 262987 transitions. [2019-01-13 03:41:07,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-13 03:41:07,354 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:41:07,355 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] [2019-01-13 03:41:07,355 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:41:07,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:41:07,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1769544010, now seen corresponding path program 1 times [2019-01-13 03:41:07,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:41:07,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:41:07,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:07,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:41:07,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:07,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:41:07,519 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-13 03:41:07,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:41:07,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:41:07,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:41:07,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:41:07,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:41:07,521 INFO L87 Difference]: Start difference. First operand 74881 states and 262987 transitions. Second operand 4 states. [2019-01-13 03:41:07,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:41:07,676 INFO L93 Difference]: Finished difference Result 15375 states and 48826 transitions. [2019-01-13 03:41:07,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 03:41:07,677 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-01-13 03:41:07,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:41:07,698 INFO L225 Difference]: With dead ends: 15375 [2019-01-13 03:41:07,698 INFO L226 Difference]: Without dead ends: 13789 [2019-01-13 03:41:07,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-13 03:41:07,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13789 states. [2019-01-13 03:41:07,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13789 to 13740. [2019-01-13 03:41:07,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13740 states. [2019-01-13 03:41:07,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13740 states to 13740 states and 43352 transitions. [2019-01-13 03:41:07,882 INFO L78 Accepts]: Start accepts. Automaton has 13740 states and 43352 transitions. Word has length 53 [2019-01-13 03:41:07,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:41:07,882 INFO L480 AbstractCegarLoop]: Abstraction has 13740 states and 43352 transitions. [2019-01-13 03:41:07,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:41:07,882 INFO L276 IsEmpty]: Start isEmpty. Operand 13740 states and 43352 transitions. [2019-01-13 03:41:07,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-13 03:41:07,884 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:41:07,884 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] [2019-01-13 03:41:07,885 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:41:07,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:41:07,885 INFO L82 PathProgramCache]: Analyzing trace with hash -431668952, now seen corresponding path program 1 times [2019-01-13 03:41:07,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:41:07,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:41:07,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:07,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:41:07,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:07,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:41:08,009 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-13 03:41:08,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:41:08,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:41:08,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:41:08,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:41:08,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:41:08,010 INFO L87 Difference]: Start difference. First operand 13740 states and 43352 transitions. Second operand 6 states. [2019-01-13 03:41:08,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:41:08,718 INFO L93 Difference]: Finished difference Result 19970 states and 62589 transitions. [2019-01-13 03:41:08,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 03:41:08,719 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-01-13 03:41:08,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:41:08,747 INFO L225 Difference]: With dead ends: 19970 [2019-01-13 03:41:08,748 INFO L226 Difference]: Without dead ends: 19898 [2019-01-13 03:41:08,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-01-13 03:41:08,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19898 states. [2019-01-13 03:41:09,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19898 to 14314. [2019-01-13 03:41:09,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14314 states. [2019-01-13 03:41:09,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14314 states to 14314 states and 45049 transitions. [2019-01-13 03:41:09,118 INFO L78 Accepts]: Start accepts. Automaton has 14314 states and 45049 transitions. Word has length 53 [2019-01-13 03:41:09,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:41:09,118 INFO L480 AbstractCegarLoop]: Abstraction has 14314 states and 45049 transitions. [2019-01-13 03:41:09,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:41:09,119 INFO L276 IsEmpty]: Start isEmpty. Operand 14314 states and 45049 transitions. [2019-01-13 03:41:09,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-13 03:41:09,123 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:41:09,123 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] [2019-01-13 03:41:09,123 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:41:09,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:41:09,124 INFO L82 PathProgramCache]: Analyzing trace with hash -488484476, now seen corresponding path program 1 times [2019-01-13 03:41:09,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:41:09,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:41:09,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:09,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:41:09,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:09,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:41:09,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-13 03:41:09,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:41:09,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:41:09,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:41:09,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:41:09,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:41:09,326 INFO L87 Difference]: Start difference. First operand 14314 states and 45049 transitions. Second operand 4 states. [2019-01-13 03:41:09,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:41:09,543 INFO L93 Difference]: Finished difference Result 16617 states and 52377 transitions. [2019-01-13 03:41:09,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 03:41:09,544 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-01-13 03:41:09,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:41:09,568 INFO L225 Difference]: With dead ends: 16617 [2019-01-13 03:41:09,568 INFO L226 Difference]: Without dead ends: 16617 [2019-01-13 03:41:09,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:41:09,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16617 states. [2019-01-13 03:41:09,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16617 to 15134. [2019-01-13 03:41:09,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15134 states. [2019-01-13 03:41:09,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15134 states to 15134 states and 47639 transitions. [2019-01-13 03:41:09,782 INFO L78 Accepts]: Start accepts. Automaton has 15134 states and 47639 transitions. Word has length 61 [2019-01-13 03:41:09,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:41:09,782 INFO L480 AbstractCegarLoop]: Abstraction has 15134 states and 47639 transitions. [2019-01-13 03:41:09,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:41:09,783 INFO L276 IsEmpty]: Start isEmpty. Operand 15134 states and 47639 transitions. [2019-01-13 03:41:09,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-13 03:41:09,788 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:41:09,788 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] [2019-01-13 03:41:09,788 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:41:09,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:41:09,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1254325859, now seen corresponding path program 1 times [2019-01-13 03:41:09,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:41:09,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:41:09,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:09,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:41:09,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:09,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:41:09,940 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-13 03:41:09,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:41:09,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:41:09,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:41:09,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:41:09,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:41:09,941 INFO L87 Difference]: Start difference. First operand 15134 states and 47639 transitions. Second operand 6 states. [2019-01-13 03:41:10,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:41:10,582 INFO L93 Difference]: Finished difference Result 28106 states and 88147 transitions. [2019-01-13 03:41:10,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 03:41:10,582 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-01-13 03:41:10,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:41:10,625 INFO L225 Difference]: With dead ends: 28106 [2019-01-13 03:41:10,625 INFO L226 Difference]: Without dead ends: 28035 [2019-01-13 03:41:10,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-01-13 03:41:10,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28035 states. [2019-01-13 03:41:10,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28035 to 17412. [2019-01-13 03:41:10,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17412 states. [2019-01-13 03:41:10,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17412 states to 17412 states and 54313 transitions. [2019-01-13 03:41:10,924 INFO L78 Accepts]: Start accepts. Automaton has 17412 states and 54313 transitions. Word has length 61 [2019-01-13 03:41:10,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:41:10,925 INFO L480 AbstractCegarLoop]: Abstraction has 17412 states and 54313 transitions. [2019-01-13 03:41:10,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:41:10,925 INFO L276 IsEmpty]: Start isEmpty. Operand 17412 states and 54313 transitions. [2019-01-13 03:41:10,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-13 03:41:10,931 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:41:10,931 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] [2019-01-13 03:41:10,932 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:41:10,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:41:10,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1214039529, now seen corresponding path program 1 times [2019-01-13 03:41:10,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:41:10,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:41:10,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:10,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:41:10,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:10,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:41:11,067 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-13 03:41:11,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:41:11,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 03:41:11,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 03:41:11,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 03:41:11,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 03:41:11,069 INFO L87 Difference]: Start difference. First operand 17412 states and 54313 transitions. Second operand 3 states. [2019-01-13 03:41:11,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:41:11,822 INFO L93 Difference]: Finished difference Result 18092 states and 56145 transitions. [2019-01-13 03:41:11,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 03:41:11,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-01-13 03:41:11,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:41:11,851 INFO L225 Difference]: With dead ends: 18092 [2019-01-13 03:41:11,851 INFO L226 Difference]: Without dead ends: 18092 [2019-01-13 03:41:11,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 03:41:11,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18092 states. [2019-01-13 03:41:12,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18092 to 17752. [2019-01-13 03:41:12,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17752 states. [2019-01-13 03:41:12,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17752 states to 17752 states and 55229 transitions. [2019-01-13 03:41:12,089 INFO L78 Accepts]: Start accepts. Automaton has 17752 states and 55229 transitions. Word has length 65 [2019-01-13 03:41:12,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:41:12,089 INFO L480 AbstractCegarLoop]: Abstraction has 17752 states and 55229 transitions. [2019-01-13 03:41:12,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 03:41:12,090 INFO L276 IsEmpty]: Start isEmpty. Operand 17752 states and 55229 transitions. [2019-01-13 03:41:12,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-13 03:41:12,096 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:41:12,096 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] [2019-01-13 03:41:12,097 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:41:12,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:41:12,097 INFO L82 PathProgramCache]: Analyzing trace with hash 863169814, now seen corresponding path program 1 times [2019-01-13 03:41:12,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:41:12,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:41:12,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:12,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:41:12,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:12,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:41:12,320 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-13 03:41:12,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:41:12,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:41:12,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:41:12,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:41:12,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:41:12,323 INFO L87 Difference]: Start difference. First operand 17752 states and 55229 transitions. Second operand 4 states. [2019-01-13 03:41:13,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:41:13,266 INFO L93 Difference]: Finished difference Result 21696 states and 66718 transitions. [2019-01-13 03:41:13,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 03:41:13,267 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-01-13 03:41:13,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:41:13,299 INFO L225 Difference]: With dead ends: 21696 [2019-01-13 03:41:13,299 INFO L226 Difference]: Without dead ends: 21696 [2019-01-13 03:41:13,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:41:13,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21696 states. [2019-01-13 03:41:13,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21696 to 19646. [2019-01-13 03:41:13,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19646 states. [2019-01-13 03:41:13,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19646 states to 19646 states and 60608 transitions. [2019-01-13 03:41:13,572 INFO L78 Accepts]: Start accepts. Automaton has 19646 states and 60608 transitions. Word has length 65 [2019-01-13 03:41:13,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:41:13,572 INFO L480 AbstractCegarLoop]: Abstraction has 19646 states and 60608 transitions. [2019-01-13 03:41:13,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:41:13,573 INFO L276 IsEmpty]: Start isEmpty. Operand 19646 states and 60608 transitions. [2019-01-13 03:41:13,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-13 03:41:13,584 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:41:13,584 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] [2019-01-13 03:41:13,584 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:41:13,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:41:13,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1085072735, now seen corresponding path program 1 times [2019-01-13 03:41:13,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:41:13,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:41:13,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:13,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:41:13,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:13,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:41:13,745 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-13 03:41:13,850 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-13 03:41:13,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:41:13,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:41:13,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:41:13,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:41:13,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:41:13,851 INFO L87 Difference]: Start difference. First operand 19646 states and 60608 transitions. Second operand 6 states. [2019-01-13 03:41:15,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:41:15,239 INFO L93 Difference]: Finished difference Result 23814 states and 72326 transitions. [2019-01-13 03:41:15,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 03:41:15,240 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-01-13 03:41:15,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:41:15,276 INFO L225 Difference]: With dead ends: 23814 [2019-01-13 03:41:15,276 INFO L226 Difference]: Without dead ends: 23814 [2019-01-13 03:41:15,276 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-13 03:41:15,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23814 states. [2019-01-13 03:41:15,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23814 to 22474. [2019-01-13 03:41:15,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22474 states. [2019-01-13 03:41:15,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22474 states to 22474 states and 68748 transitions. [2019-01-13 03:41:15,791 INFO L78 Accepts]: Start accepts. Automaton has 22474 states and 68748 transitions. Word has length 67 [2019-01-13 03:41:15,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:41:15,791 INFO L480 AbstractCegarLoop]: Abstraction has 22474 states and 68748 transitions. [2019-01-13 03:41:15,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:41:15,791 INFO L276 IsEmpty]: Start isEmpty. Operand 22474 states and 68748 transitions. [2019-01-13 03:41:15,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-13 03:41:15,802 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:41:15,803 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] [2019-01-13 03:41:15,803 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:41:15,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:41:15,803 INFO L82 PathProgramCache]: Analyzing trace with hash -992136608, now seen corresponding path program 1 times [2019-01-13 03:41:15,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:41:15,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:41:15,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:15,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:41:15,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:15,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:41:16,001 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-13 03:41:16,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:41:16,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:41:16,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:41:16,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:41:16,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:41:16,002 INFO L87 Difference]: Start difference. First operand 22474 states and 68748 transitions. Second operand 6 states. [2019-01-13 03:41:16,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:41:16,615 INFO L93 Difference]: Finished difference Result 25702 states and 76208 transitions. [2019-01-13 03:41:16,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 03:41:16,615 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-01-13 03:41:16,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:41:16,654 INFO L225 Difference]: With dead ends: 25702 [2019-01-13 03:41:16,654 INFO L226 Difference]: Without dead ends: 25702 [2019-01-13 03:41:16,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-01-13 03:41:16,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25702 states. [2019-01-13 03:41:16,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25702 to 22858. [2019-01-13 03:41:16,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22858 states. [2019-01-13 03:41:16,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22858 states to 22858 states and 68854 transitions. [2019-01-13 03:41:16,962 INFO L78 Accepts]: Start accepts. Automaton has 22858 states and 68854 transitions. Word has length 67 [2019-01-13 03:41:16,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:41:16,962 INFO L480 AbstractCegarLoop]: Abstraction has 22858 states and 68854 transitions. [2019-01-13 03:41:16,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:41:16,962 INFO L276 IsEmpty]: Start isEmpty. Operand 22858 states and 68854 transitions. [2019-01-13 03:41:16,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-13 03:41:16,973 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:41:16,973 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] [2019-01-13 03:41:16,974 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:41:16,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:41:16,974 INFO L82 PathProgramCache]: Analyzing trace with hash -780785695, now seen corresponding path program 1 times [2019-01-13 03:41:16,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:41:16,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:41:16,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:16,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:41:16,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:16,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:41:17,109 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-13 03:41:17,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:41:17,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:41:17,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:41:17,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:41:17,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:41:17,111 INFO L87 Difference]: Start difference. First operand 22858 states and 68854 transitions. Second operand 5 states. [2019-01-13 03:41:17,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:41:17,608 INFO L93 Difference]: Finished difference Result 29793 states and 89419 transitions. [2019-01-13 03:41:17,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 03:41:17,608 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-01-13 03:41:17,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:41:17,653 INFO L225 Difference]: With dead ends: 29793 [2019-01-13 03:41:17,653 INFO L226 Difference]: Without dead ends: 29793 [2019-01-13 03:41:17,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:41:17,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29793 states. [2019-01-13 03:41:17,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29793 to 26814. [2019-01-13 03:41:17,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26814 states. [2019-01-13 03:41:18,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26814 states to 26814 states and 80363 transitions. [2019-01-13 03:41:18,027 INFO L78 Accepts]: Start accepts. Automaton has 26814 states and 80363 transitions. Word has length 67 [2019-01-13 03:41:18,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:41:18,028 INFO L480 AbstractCegarLoop]: Abstraction has 26814 states and 80363 transitions. [2019-01-13 03:41:18,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:41:18,028 INFO L276 IsEmpty]: Start isEmpty. Operand 26814 states and 80363 transitions. [2019-01-13 03:41:18,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-13 03:41:18,042 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:41:18,042 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] [2019-01-13 03:41:18,042 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:41:18,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:41:18,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1291319872, now seen corresponding path program 1 times [2019-01-13 03:41:18,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:41:18,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:41:18,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:18,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:41:18,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:18,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:41:18,187 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-13 03:41:18,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:41:18,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:41:18,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:41:18,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:41:18,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:41:18,188 INFO L87 Difference]: Start difference. First operand 26814 states and 80363 transitions. Second operand 5 states. [2019-01-13 03:41:18,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:41:18,818 INFO L93 Difference]: Finished difference Result 36420 states and 108433 transitions. [2019-01-13 03:41:18,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 03:41:18,819 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-01-13 03:41:18,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:41:18,876 INFO L225 Difference]: With dead ends: 36420 [2019-01-13 03:41:18,876 INFO L226 Difference]: Without dead ends: 36420 [2019-01-13 03:41:18,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:41:18,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36420 states. [2019-01-13 03:41:19,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36420 to 29428. [2019-01-13 03:41:19,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29428 states. [2019-01-13 03:41:19,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29428 states to 29428 states and 87839 transitions. [2019-01-13 03:41:19,347 INFO L78 Accepts]: Start accepts. Automaton has 29428 states and 87839 transitions. Word has length 67 [2019-01-13 03:41:19,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:41:19,347 INFO L480 AbstractCegarLoop]: Abstraction has 29428 states and 87839 transitions. [2019-01-13 03:41:19,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:41:19,347 INFO L276 IsEmpty]: Start isEmpty. Operand 29428 states and 87839 transitions. [2019-01-13 03:41:19,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-13 03:41:19,358 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:41:19,358 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] [2019-01-13 03:41:19,359 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:41:19,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:41:19,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1196192961, now seen corresponding path program 1 times [2019-01-13 03:41:19,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:41:19,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:41:19,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:19,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:41:19,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:19,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:41:19,480 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-13 03:41:19,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:41:19,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:41:19,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:41:19,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:41:19,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:41:19,481 INFO L87 Difference]: Start difference. First operand 29428 states and 87839 transitions. Second operand 4 states. [2019-01-13 03:41:20,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:41:20,319 INFO L93 Difference]: Finished difference Result 39012 states and 116891 transitions. [2019-01-13 03:41:20,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 03:41:20,320 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-01-13 03:41:20,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:41:20,381 INFO L225 Difference]: With dead ends: 39012 [2019-01-13 03:41:20,382 INFO L226 Difference]: Without dead ends: 38780 [2019-01-13 03:41:20,382 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-13 03:41:20,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38780 states. [2019-01-13 03:41:20,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38780 to 35900. [2019-01-13 03:41:20,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35900 states. [2019-01-13 03:41:20,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35900 states to 35900 states and 107661 transitions. [2019-01-13 03:41:20,906 INFO L78 Accepts]: Start accepts. Automaton has 35900 states and 107661 transitions. Word has length 67 [2019-01-13 03:41:20,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:41:20,906 INFO L480 AbstractCegarLoop]: Abstraction has 35900 states and 107661 transitions. [2019-01-13 03:41:20,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:41:20,906 INFO L276 IsEmpty]: Start isEmpty. Operand 35900 states and 107661 transitions. [2019-01-13 03:41:20,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-13 03:41:20,918 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:41:20,919 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] [2019-01-13 03:41:20,919 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:41:20,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:41:20,919 INFO L82 PathProgramCache]: Analyzing trace with hash -600758398, now seen corresponding path program 1 times [2019-01-13 03:41:20,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:41:20,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:41:20,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:20,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:41:20,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:20,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:41:21,101 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-13 03:41:21,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:41:21,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:41:21,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:41:21,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:41:21,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:41:21,103 INFO L87 Difference]: Start difference. First operand 35900 states and 107661 transitions. Second operand 5 states. [2019-01-13 03:41:21,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:41:21,176 INFO L93 Difference]: Finished difference Result 9316 states and 22547 transitions. [2019-01-13 03:41:21,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 03:41:21,177 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-01-13 03:41:21,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:41:21,185 INFO L225 Difference]: With dead ends: 9316 [2019-01-13 03:41:21,186 INFO L226 Difference]: Without dead ends: 7464 [2019-01-13 03:41:21,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:41:21,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7464 states. [2019-01-13 03:41:21,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7464 to 6361. [2019-01-13 03:41:21,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6361 states. [2019-01-13 03:41:21,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6361 states to 6361 states and 15018 transitions. [2019-01-13 03:41:21,276 INFO L78 Accepts]: Start accepts. Automaton has 6361 states and 15018 transitions. Word has length 67 [2019-01-13 03:41:21,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:41:21,276 INFO L480 AbstractCegarLoop]: Abstraction has 6361 states and 15018 transitions. [2019-01-13 03:41:21,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:41:21,276 INFO L276 IsEmpty]: Start isEmpty. Operand 6361 states and 15018 transitions. [2019-01-13 03:41:21,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-13 03:41:21,282 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:41:21,282 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] [2019-01-13 03:41:21,282 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:41:21,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:41:21,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1144549580, now seen corresponding path program 1 times [2019-01-13 03:41:21,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:41:21,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:41:21,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:21,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:41:21,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:21,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:41:21,359 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-13 03:41:21,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:41:21,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 03:41:21,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 03:41:21,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 03:41:21,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 03:41:21,362 INFO L87 Difference]: Start difference. First operand 6361 states and 15018 transitions. Second operand 3 states. [2019-01-13 03:41:21,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:41:21,645 INFO L93 Difference]: Finished difference Result 8820 states and 20757 transitions. [2019-01-13 03:41:21,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 03:41:21,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-01-13 03:41:21,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:41:21,667 INFO L225 Difference]: With dead ends: 8820 [2019-01-13 03:41:21,667 INFO L226 Difference]: Without dead ends: 8820 [2019-01-13 03:41:21,669 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-13 03:41:21,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8820 states. [2019-01-13 03:41:21,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8820 to 6300. [2019-01-13 03:41:21,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6300 states. [2019-01-13 03:41:21,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6300 states to 6300 states and 14558 transitions. [2019-01-13 03:41:21,863 INFO L78 Accepts]: Start accepts. Automaton has 6300 states and 14558 transitions. Word has length 67 [2019-01-13 03:41:21,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:41:21,863 INFO L480 AbstractCegarLoop]: Abstraction has 6300 states and 14558 transitions. [2019-01-13 03:41:21,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 03:41:21,863 INFO L276 IsEmpty]: Start isEmpty. Operand 6300 states and 14558 transitions. [2019-01-13 03:41:21,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-13 03:41:21,874 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:41:21,875 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] [2019-01-13 03:41:21,877 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:41:21,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:41:21,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1467487719, now seen corresponding path program 1 times [2019-01-13 03:41:21,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:41:21,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:41:21,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:21,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:41:21,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:21,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:41:22,298 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-13 03:41:22,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:41:22,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:41:22,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:41:22,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:41:22,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:41:22,303 INFO L87 Difference]: Start difference. First operand 6300 states and 14558 transitions. Second operand 5 states. [2019-01-13 03:41:24,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:41:24,054 INFO L93 Difference]: Finished difference Result 7470 states and 17199 transitions. [2019-01-13 03:41:24,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 03:41:24,056 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2019-01-13 03:41:24,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:41:24,072 INFO L225 Difference]: With dead ends: 7470 [2019-01-13 03:41:24,072 INFO L226 Difference]: Without dead ends: 7470 [2019-01-13 03:41:24,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-13 03:41:24,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7470 states. [2019-01-13 03:41:24,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7470 to 6744. [2019-01-13 03:41:24,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6744 states. [2019-01-13 03:41:24,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6744 states to 6744 states and 15562 transitions. [2019-01-13 03:41:24,222 INFO L78 Accepts]: Start accepts. Automaton has 6744 states and 15562 transitions. Word has length 73 [2019-01-13 03:41:24,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:41:24,223 INFO L480 AbstractCegarLoop]: Abstraction has 6744 states and 15562 transitions. [2019-01-13 03:41:24,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:41:24,223 INFO L276 IsEmpty]: Start isEmpty. Operand 6744 states and 15562 transitions. [2019-01-13 03:41:24,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-13 03:41:24,234 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:41:24,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:41:24,234 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:41:24,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:41:24,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1084669242, now seen corresponding path program 1 times [2019-01-13 03:41:24,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:41:24,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:41:24,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:24,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:41:24,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:24,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:41:24,540 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-13 03:41:24,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:41:24,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:41:24,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:41:24,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:41:24,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:41:24,542 INFO L87 Difference]: Start difference. First operand 6744 states and 15562 transitions. Second operand 7 states. [2019-01-13 03:41:25,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:41:25,168 INFO L93 Difference]: Finished difference Result 7881 states and 17984 transitions. [2019-01-13 03:41:25,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-13 03:41:25,169 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2019-01-13 03:41:25,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:41:25,179 INFO L225 Difference]: With dead ends: 7881 [2019-01-13 03:41:25,179 INFO L226 Difference]: Without dead ends: 7762 [2019-01-13 03:41:25,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-01-13 03:41:25,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7762 states. [2019-01-13 03:41:25,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7762 to 6841. [2019-01-13 03:41:25,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6841 states. [2019-01-13 03:41:25,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6841 states to 6841 states and 15655 transitions. [2019-01-13 03:41:25,277 INFO L78 Accepts]: Start accepts. Automaton has 6841 states and 15655 transitions. Word has length 73 [2019-01-13 03:41:25,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:41:25,277 INFO L480 AbstractCegarLoop]: Abstraction has 6841 states and 15655 transitions. [2019-01-13 03:41:25,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:41:25,277 INFO L276 IsEmpty]: Start isEmpty. Operand 6841 states and 15655 transitions. [2019-01-13 03:41:25,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 03:41:25,286 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:41:25,286 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] [2019-01-13 03:41:25,286 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:41:25,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:41:25,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1510650383, now seen corresponding path program 1 times [2019-01-13 03:41:25,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:41:25,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:41:25,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:25,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:41:25,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:25,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:41:25,412 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-13 03:41:25,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:41:25,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:41:25,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:41:25,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:41:25,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:41:25,413 INFO L87 Difference]: Start difference. First operand 6841 states and 15655 transitions. Second operand 4 states. [2019-01-13 03:41:25,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:41:25,775 INFO L93 Difference]: Finished difference Result 10608 states and 24142 transitions. [2019-01-13 03:41:25,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 03:41:25,776 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-01-13 03:41:25,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:41:25,789 INFO L225 Difference]: With dead ends: 10608 [2019-01-13 03:41:25,789 INFO L226 Difference]: Without dead ends: 10608 [2019-01-13 03:41:25,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:41:25,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10608 states. [2019-01-13 03:41:25,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10608 to 7961. [2019-01-13 03:41:25,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7961 states. [2019-01-13 03:41:25,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7961 states to 7961 states and 17989 transitions. [2019-01-13 03:41:25,882 INFO L78 Accepts]: Start accepts. Automaton has 7961 states and 17989 transitions. Word has length 92 [2019-01-13 03:41:25,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:41:25,882 INFO L480 AbstractCegarLoop]: Abstraction has 7961 states and 17989 transitions. [2019-01-13 03:41:25,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:41:25,882 INFO L276 IsEmpty]: Start isEmpty. Operand 7961 states and 17989 transitions. [2019-01-13 03:41:25,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 03:41:25,890 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:41:25,891 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] [2019-01-13 03:41:25,891 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:41:25,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:41:25,891 INFO L82 PathProgramCache]: Analyzing trace with hash 699437460, now seen corresponding path program 1 times [2019-01-13 03:41:25,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:41:25,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:41:25,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:25,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:41:25,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:25,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:41:26,121 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-13 03:41:26,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:41:26,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:41:26,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:41:26,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:41:26,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:41:26,125 INFO L87 Difference]: Start difference. First operand 7961 states and 17989 transitions. Second operand 4 states. [2019-01-13 03:41:26,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:41:26,264 INFO L93 Difference]: Finished difference Result 8526 states and 19282 transitions. [2019-01-13 03:41:26,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 03:41:26,265 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-01-13 03:41:26,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:41:26,274 INFO L225 Difference]: With dead ends: 8526 [2019-01-13 03:41:26,274 INFO L226 Difference]: Without dead ends: 8526 [2019-01-13 03:41:26,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:41:26,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8526 states. [2019-01-13 03:41:26,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8526 to 7867. [2019-01-13 03:41:26,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7867 states. [2019-01-13 03:41:26,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7867 states to 7867 states and 17884 transitions. [2019-01-13 03:41:26,353 INFO L78 Accepts]: Start accepts. Automaton has 7867 states and 17884 transitions. Word has length 92 [2019-01-13 03:41:26,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:41:26,353 INFO L480 AbstractCegarLoop]: Abstraction has 7867 states and 17884 transitions. [2019-01-13 03:41:26,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:41:26,354 INFO L276 IsEmpty]: Start isEmpty. Operand 7867 states and 17884 transitions. [2019-01-13 03:41:26,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 03:41:26,361 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:41:26,361 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, 1] [2019-01-13 03:41:26,362 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:41:26,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:41:26,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1302041195, now seen corresponding path program 1 times [2019-01-13 03:41:26,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:41:26,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:41:26,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:26,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:41:26,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:26,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:41:26,497 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-13 03:41:26,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:41:26,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:41:26,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:41:26,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:41:26,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:41:26,498 INFO L87 Difference]: Start difference. First operand 7867 states and 17884 transitions. Second operand 5 states. [2019-01-13 03:41:26,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:41:26,623 INFO L93 Difference]: Finished difference Result 9015 states and 20390 transitions. [2019-01-13 03:41:26,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 03:41:26,623 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-01-13 03:41:26,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:41:26,633 INFO L225 Difference]: With dead ends: 9015 [2019-01-13 03:41:26,633 INFO L226 Difference]: Without dead ends: 9015 [2019-01-13 03:41:26,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:41:26,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9015 states. [2019-01-13 03:41:26,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9015 to 6969. [2019-01-13 03:41:26,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6969 states. [2019-01-13 03:41:26,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6969 states to 6969 states and 15888 transitions. [2019-01-13 03:41:26,709 INFO L78 Accepts]: Start accepts. Automaton has 6969 states and 15888 transitions. Word has length 94 [2019-01-13 03:41:26,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:41:26,709 INFO L480 AbstractCegarLoop]: Abstraction has 6969 states and 15888 transitions. [2019-01-13 03:41:26,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:41:26,709 INFO L276 IsEmpty]: Start isEmpty. Operand 6969 states and 15888 transitions. [2019-01-13 03:41:26,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 03:41:26,716 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:41:26,716 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, 1] [2019-01-13 03:41:26,716 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:41:26,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:41:26,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1556777740, now seen corresponding path program 1 times [2019-01-13 03:41:26,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:41:26,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:41:26,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:26,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:41:26,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:26,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:41:26,935 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-13 03:41:26,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:41:26,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:41:26,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:41:26,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:41:26,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:41:26,936 INFO L87 Difference]: Start difference. First operand 6969 states and 15888 transitions. Second operand 5 states. [2019-01-13 03:41:27,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:41:27,614 INFO L93 Difference]: Finished difference Result 13317 states and 30551 transitions. [2019-01-13 03:41:27,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 03:41:27,616 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-01-13 03:41:27,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:41:27,630 INFO L225 Difference]: With dead ends: 13317 [2019-01-13 03:41:27,630 INFO L226 Difference]: Without dead ends: 13317 [2019-01-13 03:41:27,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:41:27,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13317 states. [2019-01-13 03:41:27,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13317 to 8041. [2019-01-13 03:41:27,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8041 states. [2019-01-13 03:41:27,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8041 states to 8041 states and 18325 transitions. [2019-01-13 03:41:27,741 INFO L78 Accepts]: Start accepts. Automaton has 8041 states and 18325 transitions. Word has length 94 [2019-01-13 03:41:27,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:41:27,741 INFO L480 AbstractCegarLoop]: Abstraction has 8041 states and 18325 transitions. [2019-01-13 03:41:27,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:41:27,741 INFO L276 IsEmpty]: Start isEmpty. Operand 8041 states and 18325 transitions. [2019-01-13 03:41:27,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 03:41:27,749 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:41:27,749 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, 1] [2019-01-13 03:41:27,749 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:41:27,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:41:27,750 INFO L82 PathProgramCache]: Analyzing trace with hash -312013259, now seen corresponding path program 1 times [2019-01-13 03:41:27,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:41:27,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:41:27,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:27,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:41:27,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:27,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:41:27,934 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-13 03:41:27,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:41:27,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 03:41:27,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 03:41:27,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 03:41:27,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:41:27,937 INFO L87 Difference]: Start difference. First operand 8041 states and 18325 transitions. Second operand 8 states. [2019-01-13 03:41:28,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:41:28,564 INFO L93 Difference]: Finished difference Result 11629 states and 26298 transitions. [2019-01-13 03:41:28,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-13 03:41:28,566 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2019-01-13 03:41:28,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:41:28,578 INFO L225 Difference]: With dead ends: 11629 [2019-01-13 03:41:28,578 INFO L226 Difference]: Without dead ends: 11597 [2019-01-13 03:41:28,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-01-13 03:41:28,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11597 states. [2019-01-13 03:41:28,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11597 to 10054. [2019-01-13 03:41:28,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10054 states. [2019-01-13 03:41:28,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10054 states to 10054 states and 22699 transitions. [2019-01-13 03:41:28,694 INFO L78 Accepts]: Start accepts. Automaton has 10054 states and 22699 transitions. Word has length 94 [2019-01-13 03:41:28,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:41:28,694 INFO L480 AbstractCegarLoop]: Abstraction has 10054 states and 22699 transitions. [2019-01-13 03:41:28,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 03:41:28,694 INFO L276 IsEmpty]: Start isEmpty. Operand 10054 states and 22699 transitions. [2019-01-13 03:41:28,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 03:41:28,703 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:41:28,704 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, 1] [2019-01-13 03:41:28,704 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:41:28,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:41:28,704 INFO L82 PathProgramCache]: Analyzing trace with hash -2108964618, now seen corresponding path program 1 times [2019-01-13 03:41:28,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:41:28,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:41:28,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:28,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:41:28,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:28,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:41:28,872 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-13 03:41:28,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:41:28,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 03:41:28,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 03:41:28,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 03:41:28,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:41:28,873 INFO L87 Difference]: Start difference. First operand 10054 states and 22699 transitions. Second operand 8 states. [2019-01-13 03:41:29,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:41:29,415 INFO L93 Difference]: Finished difference Result 16042 states and 36876 transitions. [2019-01-13 03:41:29,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-13 03:41:29,417 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2019-01-13 03:41:29,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:41:29,435 INFO L225 Difference]: With dead ends: 16042 [2019-01-13 03:41:29,435 INFO L226 Difference]: Without dead ends: 16042 [2019-01-13 03:41:29,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-01-13 03:41:29,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16042 states. [2019-01-13 03:41:29,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16042 to 11490. [2019-01-13 03:41:29,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11490 states. [2019-01-13 03:41:29,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11490 states to 11490 states and 26152 transitions. [2019-01-13 03:41:29,582 INFO L78 Accepts]: Start accepts. Automaton has 11490 states and 26152 transitions. Word has length 94 [2019-01-13 03:41:29,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:41:29,583 INFO L480 AbstractCegarLoop]: Abstraction has 11490 states and 26152 transitions. [2019-01-13 03:41:29,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 03:41:29,583 INFO L276 IsEmpty]: Start isEmpty. Operand 11490 states and 26152 transitions. [2019-01-13 03:41:29,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 03:41:29,595 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:41:29,595 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, 1] [2019-01-13 03:41:29,595 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:41:29,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:41:29,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1221460937, now seen corresponding path program 1 times [2019-01-13 03:41:29,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:41:29,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:41:29,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:29,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:41:29,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:29,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:41:30,023 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-13 03:41:30,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:41:30,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:41:30,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:41:30,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:41:30,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:41:30,025 INFO L87 Difference]: Start difference. First operand 11490 states and 26152 transitions. Second operand 6 states. [2019-01-13 03:41:30,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:41:30,415 INFO L93 Difference]: Finished difference Result 11285 states and 25403 transitions. [2019-01-13 03:41:30,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 03:41:30,416 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-01-13 03:41:30,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:41:30,429 INFO L225 Difference]: With dead ends: 11285 [2019-01-13 03:41:30,429 INFO L226 Difference]: Without dead ends: 11285 [2019-01-13 03:41:30,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:41:30,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11285 states. [2019-01-13 03:41:30,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11285 to 10587. [2019-01-13 03:41:30,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10587 states. [2019-01-13 03:41:30,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10587 states to 10587 states and 23935 transitions. [2019-01-13 03:41:30,537 INFO L78 Accepts]: Start accepts. Automaton has 10587 states and 23935 transitions. Word has length 94 [2019-01-13 03:41:30,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:41:30,538 INFO L480 AbstractCegarLoop]: Abstraction has 10587 states and 23935 transitions. [2019-01-13 03:41:30,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:41:30,538 INFO L276 IsEmpty]: Start isEmpty. Operand 10587 states and 23935 transitions. [2019-01-13 03:41:30,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 03:41:30,551 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:41:30,551 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, 1] [2019-01-13 03:41:30,551 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:41:30,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:41:30,552 INFO L82 PathProgramCache]: Analyzing trace with hash 690824024, now seen corresponding path program 1 times [2019-01-13 03:41:30,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:41:30,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:41:30,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:30,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:41:30,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:30,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:41:31,212 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 15 [2019-01-13 03:41:31,259 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-13 03:41:31,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:41:31,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:41:31,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:41:31,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:41:31,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:41:31,260 INFO L87 Difference]: Start difference. First operand 10587 states and 23935 transitions. Second operand 7 states. [2019-01-13 03:41:31,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:41:31,675 INFO L93 Difference]: Finished difference Result 13401 states and 29845 transitions. [2019-01-13 03:41:31,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-13 03:41:31,676 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-01-13 03:41:31,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:41:31,691 INFO L225 Difference]: With dead ends: 13401 [2019-01-13 03:41:31,691 INFO L226 Difference]: Without dead ends: 13272 [2019-01-13 03:41:31,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-01-13 03:41:31,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13272 states. [2019-01-13 03:41:31,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13272 to 10916. [2019-01-13 03:41:31,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10916 states. [2019-01-13 03:41:31,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10916 states to 10916 states and 24543 transitions. [2019-01-13 03:41:31,814 INFO L78 Accepts]: Start accepts. Automaton has 10916 states and 24543 transitions. Word has length 94 [2019-01-13 03:41:31,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:41:31,814 INFO L480 AbstractCegarLoop]: Abstraction has 10916 states and 24543 transitions. [2019-01-13 03:41:31,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:41:31,814 INFO L276 IsEmpty]: Start isEmpty. Operand 10916 states and 24543 transitions. [2019-01-13 03:41:31,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 03:41:31,825 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:41:31,825 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, 1] [2019-01-13 03:41:31,826 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:41:31,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:41:31,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1753974521, now seen corresponding path program 2 times [2019-01-13 03:41:31,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:41:31,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:41:31,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:31,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:41:31,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:31,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:41:32,030 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-13 03:41:32,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:41:32,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:41:32,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:41:32,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:41:32,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:41:32,032 INFO L87 Difference]: Start difference. First operand 10916 states and 24543 transitions. Second operand 7 states. [2019-01-13 03:41:32,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:41:32,521 INFO L93 Difference]: Finished difference Result 12866 states and 29142 transitions. [2019-01-13 03:41:32,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 03:41:32,522 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-01-13 03:41:32,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:41:32,537 INFO L225 Difference]: With dead ends: 12866 [2019-01-13 03:41:32,537 INFO L226 Difference]: Without dead ends: 12866 [2019-01-13 03:41:32,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-01-13 03:41:32,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12866 states. [2019-01-13 03:41:32,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12866 to 11227. [2019-01-13 03:41:32,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11227 states. [2019-01-13 03:41:32,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11227 states to 11227 states and 25196 transitions. [2019-01-13 03:41:32,660 INFO L78 Accepts]: Start accepts. Automaton has 11227 states and 25196 transitions. Word has length 94 [2019-01-13 03:41:32,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:41:32,660 INFO L480 AbstractCegarLoop]: Abstraction has 11227 states and 25196 transitions. [2019-01-13 03:41:32,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:41:32,660 INFO L276 IsEmpty]: Start isEmpty. Operand 11227 states and 25196 transitions. [2019-01-13 03:41:32,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 03:41:32,671 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:41:32,671 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, 1] [2019-01-13 03:41:32,671 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:41:32,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:41:32,672 INFO L82 PathProgramCache]: Analyzing trace with hash 940045282, now seen corresponding path program 1 times [2019-01-13 03:41:32,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:41:32,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:41:32,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:32,673 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 03:41:32,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:32,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:41:32,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-13 03:41:32,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:41:32,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 03:41:32,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 03:41:32,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 03:41:32,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 03:41:32,779 INFO L87 Difference]: Start difference. First operand 11227 states and 25196 transitions. Second operand 3 states. [2019-01-13 03:41:32,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:41:32,843 INFO L93 Difference]: Finished difference Result 10971 states and 24364 transitions. [2019-01-13 03:41:32,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 03:41:32,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-01-13 03:41:32,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:41:32,858 INFO L225 Difference]: With dead ends: 10971 [2019-01-13 03:41:32,858 INFO L226 Difference]: Without dead ends: 10939 [2019-01-13 03:41:32,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 03:41:32,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10939 states. [2019-01-13 03:41:32,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10939 to 8275. [2019-01-13 03:41:32,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8275 states. [2019-01-13 03:41:32,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8275 states to 8275 states and 18147 transitions. [2019-01-13 03:41:32,964 INFO L78 Accepts]: Start accepts. Automaton has 8275 states and 18147 transitions. Word has length 94 [2019-01-13 03:41:32,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:41:32,964 INFO L480 AbstractCegarLoop]: Abstraction has 8275 states and 18147 transitions. [2019-01-13 03:41:32,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 03:41:32,964 INFO L276 IsEmpty]: Start isEmpty. Operand 8275 states and 18147 transitions. [2019-01-13 03:41:32,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-13 03:41:32,973 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:41:32,973 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, 1, 1, 1] [2019-01-13 03:41:32,973 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:41:32,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:41:32,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1852674146, now seen corresponding path program 1 times [2019-01-13 03:41:32,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:41:32,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:41:32,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:32,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:41:32,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:32,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:41:33,308 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-13 03:41:33,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-13 03:41:33,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:41:33,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:41:33,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:41:33,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:41:33,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:41:33,616 INFO L87 Difference]: Start difference. First operand 8275 states and 18147 transitions. Second operand 6 states. [2019-01-13 03:41:34,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:41:34,233 INFO L93 Difference]: Finished difference Result 10891 states and 23671 transitions. [2019-01-13 03:41:34,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 03:41:34,234 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-01-13 03:41:34,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:41:34,247 INFO L225 Difference]: With dead ends: 10891 [2019-01-13 03:41:34,247 INFO L226 Difference]: Without dead ends: 10747 [2019-01-13 03:41:34,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-01-13 03:41:34,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10747 states. [2019-01-13 03:41:34,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10747 to 8818. [2019-01-13 03:41:34,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8818 states. [2019-01-13 03:41:34,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8818 states to 8818 states and 19452 transitions. [2019-01-13 03:41:34,345 INFO L78 Accepts]: Start accepts. Automaton has 8818 states and 19452 transitions. Word has length 96 [2019-01-13 03:41:34,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:41:34,345 INFO L480 AbstractCegarLoop]: Abstraction has 8818 states and 19452 transitions. [2019-01-13 03:41:34,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:41:34,345 INFO L276 IsEmpty]: Start isEmpty. Operand 8818 states and 19452 transitions. [2019-01-13 03:41:34,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-13 03:41:34,354 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:41:34,354 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, 1, 1, 1] [2019-01-13 03:41:34,354 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:41:34,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:41:34,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1641323233, now seen corresponding path program 1 times [2019-01-13 03:41:34,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:41:34,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:41:34,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:34,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:41:34,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:34,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:41:34,821 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-13 03:41:34,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:41:34,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:41:34,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:41:34,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:41:34,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:41:34,823 INFO L87 Difference]: Start difference. First operand 8818 states and 19452 transitions. Second operand 6 states. [2019-01-13 03:41:35,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:41:35,353 INFO L93 Difference]: Finished difference Result 9326 states and 20389 transitions. [2019-01-13 03:41:35,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 03:41:35,355 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-01-13 03:41:35,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:41:35,365 INFO L225 Difference]: With dead ends: 9326 [2019-01-13 03:41:35,365 INFO L226 Difference]: Without dead ends: 9265 [2019-01-13 03:41:35,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:41:35,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9265 states. [2019-01-13 03:41:35,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9265 to 8609. [2019-01-13 03:41:35,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8609 states. [2019-01-13 03:41:35,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8609 states to 8609 states and 18937 transitions. [2019-01-13 03:41:35,449 INFO L78 Accepts]: Start accepts. Automaton has 8609 states and 18937 transitions. Word has length 96 [2019-01-13 03:41:35,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:41:35,450 INFO L480 AbstractCegarLoop]: Abstraction has 8609 states and 18937 transitions. [2019-01-13 03:41:35,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:41:35,450 INFO L276 IsEmpty]: Start isEmpty. Operand 8609 states and 18937 transitions. [2019-01-13 03:41:35,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-13 03:41:35,459 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:41:35,459 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, 1, 1, 1] [2019-01-13 03:41:35,459 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:41:35,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:41:35,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1159572449, now seen corresponding path program 1 times [2019-01-13 03:41:35,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:41:35,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:41:35,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:35,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:41:35,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:35,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:41:35,818 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-13 03:41:35,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:41:35,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-13 03:41:35,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 03:41:35,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 03:41:35,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-01-13 03:41:35,820 INFO L87 Difference]: Start difference. First operand 8609 states and 18937 transitions. Second operand 9 states. [2019-01-13 03:41:36,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:41:36,443 INFO L93 Difference]: Finished difference Result 10219 states and 22252 transitions. [2019-01-13 03:41:36,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 03:41:36,444 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-01-13 03:41:36,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:41:36,456 INFO L225 Difference]: With dead ends: 10219 [2019-01-13 03:41:36,456 INFO L226 Difference]: Without dead ends: 10219 [2019-01-13 03:41:36,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-13 03:41:36,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10219 states. [2019-01-13 03:41:36,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10219 to 8765. [2019-01-13 03:41:36,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8765 states. [2019-01-13 03:41:36,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8765 states to 8765 states and 19254 transitions. [2019-01-13 03:41:36,550 INFO L78 Accepts]: Start accepts. Automaton has 8765 states and 19254 transitions. Word has length 96 [2019-01-13 03:41:36,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:41:36,551 INFO L480 AbstractCegarLoop]: Abstraction has 8765 states and 19254 transitions. [2019-01-13 03:41:36,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 03:41:36,551 INFO L276 IsEmpty]: Start isEmpty. Operand 8765 states and 19254 transitions. [2019-01-13 03:41:36,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-13 03:41:36,560 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:41:36,560 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, 1, 1, 1] [2019-01-13 03:41:36,560 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:41:36,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:41:36,560 INFO L82 PathProgramCache]: Analyzing trace with hash 2085110559, now seen corresponding path program 1 times [2019-01-13 03:41:36,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:41:36,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:41:36,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:36,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:41:36,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:36,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:41:37,077 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-13 03:41:37,188 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-13 03:41:37,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:41:37,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 03:41:37,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 03:41:37,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 03:41:37,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:41:37,189 INFO L87 Difference]: Start difference. First operand 8765 states and 19254 transitions. Second operand 8 states. [2019-01-13 03:41:37,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:41:37,998 INFO L93 Difference]: Finished difference Result 11577 states and 25253 transitions. [2019-01-13 03:41:37,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-13 03:41:37,999 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2019-01-13 03:41:38,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:41:38,013 INFO L225 Difference]: With dead ends: 11577 [2019-01-13 03:41:38,013 INFO L226 Difference]: Without dead ends: 11503 [2019-01-13 03:41:38,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2019-01-13 03:41:38,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11503 states. [2019-01-13 03:41:38,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11503 to 9265. [2019-01-13 03:41:38,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9265 states. [2019-01-13 03:41:38,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9265 states to 9265 states and 20327 transitions. [2019-01-13 03:41:38,118 INFO L78 Accepts]: Start accepts. Automaton has 9265 states and 20327 transitions. Word has length 96 [2019-01-13 03:41:38,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:41:38,119 INFO L480 AbstractCegarLoop]: Abstraction has 9265 states and 20327 transitions. [2019-01-13 03:41:38,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 03:41:38,119 INFO L276 IsEmpty]: Start isEmpty. Operand 9265 states and 20327 transitions. [2019-01-13 03:41:38,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-13 03:41:38,128 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:41:38,128 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, 1, 1, 1] [2019-01-13 03:41:38,128 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:41:38,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:41:38,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1979580544, now seen corresponding path program 1 times [2019-01-13 03:41:38,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:41:38,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:41:38,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:38,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:41:38,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:38,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:41:38,249 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-13 03:41:38,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:41:38,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:41:38,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:41:38,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:41:38,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:41:38,250 INFO L87 Difference]: Start difference. First operand 9265 states and 20327 transitions. Second operand 7 states. [2019-01-13 03:41:38,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:41:38,712 INFO L93 Difference]: Finished difference Result 10852 states and 23780 transitions. [2019-01-13 03:41:38,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-13 03:41:38,713 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-01-13 03:41:38,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:41:38,725 INFO L225 Difference]: With dead ends: 10852 [2019-01-13 03:41:38,725 INFO L226 Difference]: Without dead ends: 10852 [2019-01-13 03:41:38,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-01-13 03:41:38,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10852 states. [2019-01-13 03:41:38,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10852 to 8674. [2019-01-13 03:41:38,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8674 states. [2019-01-13 03:41:38,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8674 states to 8674 states and 19044 transitions. [2019-01-13 03:41:38,821 INFO L78 Accepts]: Start accepts. Automaton has 8674 states and 19044 transitions. Word has length 96 [2019-01-13 03:41:38,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:41:38,822 INFO L480 AbstractCegarLoop]: Abstraction has 8674 states and 19044 transitions. [2019-01-13 03:41:38,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:41:38,822 INFO L276 IsEmpty]: Start isEmpty. Operand 8674 states and 19044 transitions. [2019-01-13 03:41:38,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-13 03:41:38,831 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:41:38,831 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, 1, 1, 1] [2019-01-13 03:41:38,831 INFO L423 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:41:38,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:41:38,831 INFO L82 PathProgramCache]: Analyzing trace with hash 7901216, now seen corresponding path program 1 times [2019-01-13 03:41:38,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:41:38,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:41:38,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:38,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:41:38,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:38,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:41:39,032 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-13 03:41:39,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:41:39,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-13 03:41:39,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 03:41:39,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 03:41:39,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-01-13 03:41:39,033 INFO L87 Difference]: Start difference. First operand 8674 states and 19044 transitions. Second operand 9 states. [2019-01-13 03:41:39,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:41:39,596 INFO L93 Difference]: Finished difference Result 11129 states and 24467 transitions. [2019-01-13 03:41:39,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 03:41:39,598 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-01-13 03:41:39,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:41:39,610 INFO L225 Difference]: With dead ends: 11129 [2019-01-13 03:41:39,610 INFO L226 Difference]: Without dead ends: 11129 [2019-01-13 03:41:39,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2019-01-13 03:41:39,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11129 states. [2019-01-13 03:41:39,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11129 to 9107. [2019-01-13 03:41:39,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9107 states. [2019-01-13 03:41:39,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9107 states to 9107 states and 19978 transitions. [2019-01-13 03:41:39,710 INFO L78 Accepts]: Start accepts. Automaton has 9107 states and 19978 transitions. Word has length 96 [2019-01-13 03:41:39,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:41:39,710 INFO L480 AbstractCegarLoop]: Abstraction has 9107 states and 19978 transitions. [2019-01-13 03:41:39,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 03:41:39,710 INFO L276 IsEmpty]: Start isEmpty. Operand 9107 states and 19978 transitions. [2019-01-13 03:41:39,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-13 03:41:39,720 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:41:39,720 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, 1, 1, 1] [2019-01-13 03:41:39,720 INFO L423 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:41:39,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:41:39,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1625008032, now seen corresponding path program 2 times [2019-01-13 03:41:39,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:41:39,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:41:39,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:39,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:41:39,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:39,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:41:39,907 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-13 03:41:39,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:41:39,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:41:39,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:41:39,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:41:39,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:41:39,908 INFO L87 Difference]: Start difference. First operand 9107 states and 19978 transitions. Second operand 7 states. [2019-01-13 03:41:40,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:41:40,475 INFO L93 Difference]: Finished difference Result 11149 states and 24222 transitions. [2019-01-13 03:41:40,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-13 03:41:40,476 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-01-13 03:41:40,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:41:40,491 INFO L225 Difference]: With dead ends: 11149 [2019-01-13 03:41:40,491 INFO L226 Difference]: Without dead ends: 11149 [2019-01-13 03:41:40,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-01-13 03:41:40,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11149 states. [2019-01-13 03:41:40,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11149 to 9717. [2019-01-13 03:41:40,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9717 states. [2019-01-13 03:41:40,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9717 states to 9717 states and 21341 transitions. [2019-01-13 03:41:40,592 INFO L78 Accepts]: Start accepts. Automaton has 9717 states and 21341 transitions. Word has length 96 [2019-01-13 03:41:40,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:41:40,592 INFO L480 AbstractCegarLoop]: Abstraction has 9717 states and 21341 transitions. [2019-01-13 03:41:40,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:41:40,592 INFO L276 IsEmpty]: Start isEmpty. Operand 9717 states and 21341 transitions. [2019-01-13 03:41:40,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-13 03:41:40,602 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:41:40,602 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, 1, 1, 1] [2019-01-13 03:41:40,602 INFO L423 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:41:40,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:41:40,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1836358945, now seen corresponding path program 1 times [2019-01-13 03:41:40,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:41:40,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:41:40,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:40,604 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 03:41:40,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:40,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:41:40,830 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-13 03:41:40,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:41:40,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-13 03:41:40,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-13 03:41:40,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-13 03:41:40,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-01-13 03:41:40,831 INFO L87 Difference]: Start difference. First operand 9717 states and 21341 transitions. Second operand 11 states. [2019-01-13 03:41:41,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:41:41,821 INFO L93 Difference]: Finished difference Result 11629 states and 25431 transitions. [2019-01-13 03:41:41,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-13 03:41:41,823 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2019-01-13 03:41:41,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:41:41,835 INFO L225 Difference]: With dead ends: 11629 [2019-01-13 03:41:41,835 INFO L226 Difference]: Without dead ends: 11629 [2019-01-13 03:41:41,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2019-01-13 03:41:41,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11629 states. [2019-01-13 03:41:41,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11629 to 9906. [2019-01-13 03:41:41,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9906 states. [2019-01-13 03:41:41,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9906 states to 9906 states and 21768 transitions. [2019-01-13 03:41:41,937 INFO L78 Accepts]: Start accepts. Automaton has 9906 states and 21768 transitions. Word has length 96 [2019-01-13 03:41:41,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:41:41,938 INFO L480 AbstractCegarLoop]: Abstraction has 9906 states and 21768 transitions. [2019-01-13 03:41:41,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-13 03:41:41,938 INFO L276 IsEmpty]: Start isEmpty. Operand 9906 states and 21768 transitions. [2019-01-13 03:41:41,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-13 03:41:41,946 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:41:41,947 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, 1, 1, 1] [2019-01-13 03:41:41,947 INFO L423 AbstractCegarLoop]: === Iteration 40 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:41:41,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:41:41,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1571104670, now seen corresponding path program 1 times [2019-01-13 03:41:41,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:41:41,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:41:41,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:41,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:41:41,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:41,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:41:42,262 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-13 03:41:42,361 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-13 03:41:42,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:41:42,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-13 03:41:42,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-13 03:41:42,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-13 03:41:42,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-01-13 03:41:42,362 INFO L87 Difference]: Start difference. First operand 9906 states and 21768 transitions. Second operand 11 states. [2019-01-13 03:41:44,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:41:44,027 INFO L93 Difference]: Finished difference Result 17943 states and 39956 transitions. [2019-01-13 03:41:44,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-13 03:41:44,028 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2019-01-13 03:41:44,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:41:44,046 INFO L225 Difference]: With dead ends: 17943 [2019-01-13 03:41:44,046 INFO L226 Difference]: Without dead ends: 11870 [2019-01-13 03:41:44,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2019-01-13 03:41:44,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11870 states. [2019-01-13 03:41:44,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11870 to 9030. [2019-01-13 03:41:44,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9030 states. [2019-01-13 03:41:44,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9030 states to 9030 states and 19924 transitions. [2019-01-13 03:41:44,181 INFO L78 Accepts]: Start accepts. Automaton has 9030 states and 19924 transitions. Word has length 96 [2019-01-13 03:41:44,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:41:44,181 INFO L480 AbstractCegarLoop]: Abstraction has 9030 states and 19924 transitions. [2019-01-13 03:41:44,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-13 03:41:44,182 INFO L276 IsEmpty]: Start isEmpty. Operand 9030 states and 19924 transitions. [2019-01-13 03:41:44,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-13 03:41:44,194 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:41:44,194 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, 1, 1, 1] [2019-01-13 03:41:44,195 INFO L423 AbstractCegarLoop]: === Iteration 41 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:41:44,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:41:44,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1465989324, now seen corresponding path program 2 times [2019-01-13 03:41:44,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:41:44,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:41:44,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:44,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:41:44,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:44,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 03:41:44,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 03:41:44,302 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-13 03:41:44,513 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-13 03:41:44,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 03:41:44 BasicIcfg [2019-01-13 03:41:44,514 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 03:41:44,515 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 03:41:44,515 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 03:41:44,515 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 03:41:44,519 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 03:40:39" (3/4) ... [2019-01-13 03:41:44,522 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-13 03:41:44,724 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 03:41:44,725 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 03:41:44,726 INFO L168 Benchmark]: Toolchain (without parser) took 67078.63 ms. Allocated memory was 1.0 GB in the beginning and 5.3 GB in the end (delta: 4.3 GB). Free memory was 946.0 MB in the beginning and 3.2 GB in the end (delta: -2.2 GB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2019-01-13 03:41:44,727 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 03:41:44,728 INFO L168 Benchmark]: CACSL2BoogieTranslator took 853.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -171.3 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-01-13 03:41:44,728 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-13 03:41:44,730 INFO L168 Benchmark]: Boogie Preprocessor took 62.88 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 03:41:44,730 INFO L168 Benchmark]: RCFGBuilder took 1217.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. [2019-01-13 03:41:44,730 INFO L168 Benchmark]: TraceAbstraction took 64653.76 ms. Allocated memory was 1.2 GB in the beginning and 5.3 GB in the end (delta: 4.1 GB). Free memory was 1.1 GB in the beginning and 3.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2019-01-13 03:41:44,733 INFO L168 Benchmark]: Witness Printer took 210.20 ms. Allocated memory is still 5.3 GB. Free memory was 3.2 GB in the beginning and 3.2 GB in the end (delta: 62.1 MB). Peak memory consumption was 62.1 MB. Max. memory is 11.5 GB. [2019-01-13 03:41:44,736 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 853.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -171.3 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 74.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 62.88 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1217.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 64653.76 ms. Allocated memory was 1.2 GB in the beginning and 5.3 GB in the end (delta: 4.1 GB). Free memory was 1.1 GB in the beginning and 3.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. * Witness Printer took 210.20 ms. Allocated memory is still 5.3 GB. Free memory was 3.2 GB in the beginning and 3.2 GB in the end (delta: 62.1 MB). Peak memory consumption was 62.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] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L675] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L680] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L681] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L682] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L683] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L684] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L685] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L686] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L687] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L688] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L689] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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}] [L690] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L691] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L692] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L693] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L695] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L697] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, z=0] [L698] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, z=0] [L699] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, z=0] [L778] -1 pthread_t t1603; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, z=0] [L779] FCALL, FORK -1 pthread_create(&t1603, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, z=0] [L703] 0 x$w_buff1 = x$w_buff0 [L704] 0 x$w_buff0 = 1 [L705] 0 x$w_buff1_used = x$w_buff0_used [L706] 0 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L708] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L709] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L710] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L711] 0 x$r_buff0_thd1 = (_Bool)1 [L714] 0 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L717] EXPR 0 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, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L780] -1 pthread_t t1604; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L781] FCALL, FORK -1 pthread_create(&t1604, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L731] 1 y = 2 [L734] 1 z = 1 [L737] 1 __unbuffered_p1_EAX = z [L740] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L741] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L742] 1 x$flush_delayed = weak$$choice2 [L743] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L744] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L744] 1 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L745] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L745] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L746] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L746] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L747] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L747] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L748] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L748] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L749] EXPR 1 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L749] 1 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L750] EXPR 1 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L750] 1 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L751] 1 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L752] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L717] 0 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L752] 1 x = x$flush_delayed ? x$mem_tmp : x [L753] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L756] EXPR 1 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L756] EXPR 1 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=2, z=1] [L756] EXPR 1 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=2, z=1] [L756] 1 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L757] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L757] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L758] EXPR 1 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L758] 1 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 [L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L759] 1 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L718] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L718] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L719] EXPR 0 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L719] 0 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 [L720] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L720] 0 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L721] EXPR 0 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=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L721] 0 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 [L724] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L760] EXPR 1 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=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L760] 1 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 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L783] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L787] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L787] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L787] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L787] -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) [L788] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L788] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L789] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L789] -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 [L790] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L790] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L791] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L791] -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 [L794] -1 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 223 locations, 3 error locations. UNSAFE Result, 64.4s OverallTime, 41 OverallIterations, 1 TraceHistogramMax, 31.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 10842 SDtfs, 12045 SDslu, 26714 SDs, 0 SdLazy, 12804 SolverSat, 672 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 430 GetRequests, 103 SyntacticMatches, 36 SemanticMatches, 291 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 9.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74881occurred in iteration=6, 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: 20.3s AutomataMinimizationTime, 40 MinimizatonAttempts, 189458 StatesRemovedByMinimization, 40 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.8s InterpolantComputationTime, 3151 NumberOfCodeBlocks, 3151 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 3015 ConstructedInterpolants, 0 QuantifiedInterpolants, 828193 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 40 InterpolantComputations, 40 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...