./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix034_tso.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 91b1670e 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/mix034_tso.opt_false-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 957f139f0b65b272965e1ab3f33f2b98232837f4 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-91b1670 [2018-11-28 20:01:06,821 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 20:01:06,823 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 20:01:06,836 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 20:01:06,836 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 20:01:06,837 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 20:01:06,839 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 20:01:06,841 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 20:01:06,844 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 20:01:06,845 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 20:01:06,846 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 20:01:06,847 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 20:01:06,852 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 20:01:06,854 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 20:01:06,860 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 20:01:06,861 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 20:01:06,861 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 20:01:06,863 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 20:01:06,865 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 20:01:06,867 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 20:01:06,868 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 20:01:06,869 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 20:01:06,872 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 20:01:06,872 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 20:01:06,872 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 20:01:06,874 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 20:01:06,875 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 20:01:06,876 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 20:01:06,876 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 20:01:06,878 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 20:01:06,878 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 20:01:06,879 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 20:01:06,880 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 20:01:06,880 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 20:01:06,881 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 20:01:06,881 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 20:01:06,882 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 20:01:06,897 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 20:01:06,898 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 20:01:06,899 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 20:01:06,899 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 20:01:06,900 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 20:01:06,900 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 20:01:06,900 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 20:01:06,900 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 20:01:06,900 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 20:01:06,902 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 20:01:06,902 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 20:01:06,902 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 20:01:06,902 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 20:01:06,902 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 20:01:06,902 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 20:01:06,903 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 20:01:06,903 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 20:01:06,904 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 20:01:06,904 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 20:01:06,904 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 20:01:06,904 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 20:01:06,904 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 20:01:06,904 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 20:01:06,905 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 20:01:06,905 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 20:01:06,905 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 20:01:06,905 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 20:01:06,905 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 20:01:06,907 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 20:01:06,907 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 20:01:06,907 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 -> 957f139f0b65b272965e1ab3f33f2b98232837f4 [2018-11-28 20:01:06,970 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 20:01:06,988 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 20:01:06,993 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 20:01:06,994 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 20:01:06,995 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 20:01:06,995 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix034_tso.opt_false-unreach-call.i [2018-11-28 20:01:07,049 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e20644abf/c87f06246a8349aa8c346b2200e348c8/FLAG89c63c91a [2018-11-28 20:01:07,596 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 20:01:07,597 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix034_tso.opt_false-unreach-call.i [2018-11-28 20:01:07,618 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e20644abf/c87f06246a8349aa8c346b2200e348c8/FLAG89c63c91a [2018-11-28 20:01:07,853 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e20644abf/c87f06246a8349aa8c346b2200e348c8 [2018-11-28 20:01:07,858 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 20:01:07,860 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 20:01:07,861 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 20:01:07,861 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 20:01:07,866 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 20:01:07,867 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:01:07" (1/1) ... [2018-11-28 20:01:07,871 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dc9f617 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:01:07, skipping insertion in model container [2018-11-28 20:01:07,871 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:01:07" (1/1) ... [2018-11-28 20:01:07,881 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 20:01:07,945 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 20:01:08,462 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 20:01:08,479 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 20:01:08,672 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 20:01:08,749 INFO L195 MainTranslator]: Completed translation [2018-11-28 20:01:08,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:01:08 WrapperNode [2018-11-28 20:01:08,750 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 20:01:08,751 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 20:01:08,751 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 20:01:08,751 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 20:01:08,763 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:01:08" (1/1) ... [2018-11-28 20:01:08,798 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:01:08" (1/1) ... [2018-11-28 20:01:08,842 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 20:01:08,843 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 20:01:08,843 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 20:01:08,843 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 20:01:08,856 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:01:08" (1/1) ... [2018-11-28 20:01:08,856 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:01:08" (1/1) ... [2018-11-28 20:01:08,862 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:01:08" (1/1) ... [2018-11-28 20:01:08,862 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:01:08" (1/1) ... [2018-11-28 20:01:08,873 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:01:08" (1/1) ... [2018-11-28 20:01:08,878 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:01:08" (1/1) ... [2018-11-28 20:01:08,885 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:01:08" (1/1) ... [2018-11-28 20:01:08,890 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 20:01:08,891 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 20:01:08,891 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 20:01:08,891 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 20:01:08,892 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:01:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 20:01:08,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 20:01:08,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 20:01:08,976 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-11-28 20:01:08,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 20:01:08,976 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-11-28 20:01:08,976 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-11-28 20:01:08,976 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-11-28 20:01:08,977 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-11-28 20:01:08,978 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-11-28 20:01:08,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 20:01:08,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 20:01:08,981 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-11-28 20:01:10,318 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 20:01:10,318 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 20:01:10,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:01:10 BoogieIcfgContainer [2018-11-28 20:01:10,322 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 20:01:10,323 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 20:01:10,323 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 20:01:10,326 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 20:01:10,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:01:07" (1/3) ... [2018-11-28 20:01:10,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b5938a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:01:10, skipping insertion in model container [2018-11-28 20:01:10,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:01:08" (2/3) ... [2018-11-28 20:01:10,328 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b5938a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:01:10, skipping insertion in model container [2018-11-28 20:01:10,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:01:10" (3/3) ... [2018-11-28 20:01:10,330 INFO L112 eAbstractionObserver]: Analyzing ICFG mix034_tso.opt_false-unreach-call.i [2018-11-28 20:01:10,376 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,376 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,377 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,377 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,377 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,378 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,378 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,378 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,378 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,379 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,379 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,379 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,379 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,380 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,380 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,380 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,380 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,380 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,381 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,381 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,381 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,381 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,382 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,382 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,382 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,382 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,382 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,383 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,383 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,383 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,383 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,384 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,384 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,384 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,384 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,384 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,385 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,385 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,385 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,385 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,386 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,386 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,386 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,386 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,386 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,387 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,387 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,387 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,387 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,387 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,388 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,388 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,388 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,388 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,389 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,389 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,389 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,389 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,389 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,390 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,390 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,390 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,390 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,391 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,391 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,391 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,391 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,391 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,392 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,392 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,392 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,392 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,393 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,393 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,393 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,393 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,393 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,394 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,394 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,394 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,394 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,394 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,395 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,395 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,395 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,395 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,395 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,396 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,396 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,396 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,396 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,397 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,397 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,397 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,397 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,397 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,397 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,398 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,398 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,399 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,399 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,399 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,399 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,399 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,399 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,400 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,400 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,400 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,400 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,406 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,406 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,406 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,407 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,407 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,407 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,407 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,408 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,408 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,408 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,408 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,409 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,409 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,409 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,409 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,409 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,410 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,410 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,410 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,410 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,410 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,414 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,414 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,414 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,414 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,415 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,415 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:01:10,440 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-11-28 20:01:10,441 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 20:01:10,449 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-28 20:01:10,467 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-28 20:01:10,493 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 20:01:10,494 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 20:01:10,494 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 20:01:10,494 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 20:01:10,494 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 20:01:10,494 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 20:01:10,495 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 20:01:10,495 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 20:01:10,495 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 20:01:10,509 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 132places, 164 transitions [2018-11-28 20:01:12,357 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27856 states. [2018-11-28 20:01:12,360 INFO L276 IsEmpty]: Start isEmpty. Operand 27856 states. [2018-11-28 20:01:12,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-28 20:01:12,371 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:01:12,372 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] [2018-11-28 20:01:12,375 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:01:12,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:01:12,382 INFO L82 PathProgramCache]: Analyzing trace with hash 180674909, now seen corresponding path program 1 times [2018-11-28 20:01:12,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:01:12,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:01:12,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:01:12,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:01:12,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:01:12,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:01:12,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:01:12,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:01:12,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:01:12,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:01:12,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:01:12,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:01:12,796 INFO L87 Difference]: Start difference. First operand 27856 states. Second operand 4 states. [2018-11-28 20:01:13,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:01:13,885 INFO L93 Difference]: Finished difference Result 47768 states and 183119 transitions. [2018-11-28 20:01:13,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 20:01:13,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-11-28 20:01:13,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:01:14,222 INFO L225 Difference]: With dead ends: 47768 [2018-11-28 20:01:14,223 INFO L226 Difference]: Without dead ends: 34608 [2018-11-28 20:01:14,226 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 [2018-11-28 20:01:14,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34608 states. [2018-11-28 20:01:15,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34608 to 21756. [2018-11-28 20:01:15,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21756 states. [2018-11-28 20:01:15,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21756 states to 21756 states and 83441 transitions. [2018-11-28 20:01:15,880 INFO L78 Accepts]: Start accepts. Automaton has 21756 states and 83441 transitions. Word has length 39 [2018-11-28 20:01:15,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:01:15,881 INFO L480 AbstractCegarLoop]: Abstraction has 21756 states and 83441 transitions. [2018-11-28 20:01:15,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:01:15,881 INFO L276 IsEmpty]: Start isEmpty. Operand 21756 states and 83441 transitions. [2018-11-28 20:01:15,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-28 20:01:15,900 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:01:15,900 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] [2018-11-28 20:01:15,901 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:01:15,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:01:15,901 INFO L82 PathProgramCache]: Analyzing trace with hash 2098734837, now seen corresponding path program 1 times [2018-11-28 20:01:15,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:01:15,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:01:15,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:01:15,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:01:15,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:01:15,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:01:16,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:01:16,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:01:16,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:01:16,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:01:16,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:01:16,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:01:16,082 INFO L87 Difference]: Start difference. First operand 21756 states and 83441 transitions. Second operand 5 states. [2018-11-28 20:01:18,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:01:18,891 INFO L93 Difference]: Finished difference Result 47634 states and 173802 transitions. [2018-11-28 20:01:18,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 20:01:18,892 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-11-28 20:01:18,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:01:19,145 INFO L225 Difference]: With dead ends: 47634 [2018-11-28 20:01:19,146 INFO L226 Difference]: Without dead ends: 47066 [2018-11-28 20:01:19,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:01:19,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47066 states. [2018-11-28 20:01:20,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47066 to 31796. [2018-11-28 20:01:20,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31796 states. [2018-11-28 20:01:20,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31796 states to 31796 states and 116819 transitions. [2018-11-28 20:01:20,819 INFO L78 Accepts]: Start accepts. Automaton has 31796 states and 116819 transitions. Word has length 47 [2018-11-28 20:01:20,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:01:20,820 INFO L480 AbstractCegarLoop]: Abstraction has 31796 states and 116819 transitions. [2018-11-28 20:01:20,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:01:20,820 INFO L276 IsEmpty]: Start isEmpty. Operand 31796 states and 116819 transitions. [2018-11-28 20:01:20,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-28 20:01:20,826 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:01:20,826 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] [2018-11-28 20:01:20,826 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:01:20,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:01:20,827 INFO L82 PathProgramCache]: Analyzing trace with hash -7906472, now seen corresponding path program 1 times [2018-11-28 20:01:20,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:01:20,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:01:20,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:01:20,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:01:20,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:01:20,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:01:20,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:01:20,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:01:20,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:01:20,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:01:20,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:01:20,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:01:20,960 INFO L87 Difference]: Start difference. First operand 31796 states and 116819 transitions. Second operand 5 states. [2018-11-28 20:01:21,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:01:21,702 INFO L93 Difference]: Finished difference Result 63028 states and 229114 transitions. [2018-11-28 20:01:21,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 20:01:21,709 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-11-28 20:01:21,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:01:21,916 INFO L225 Difference]: With dead ends: 63028 [2018-11-28 20:01:21,916 INFO L226 Difference]: Without dead ends: 62564 [2018-11-28 20:01:21,917 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 [2018-11-28 20:01:22,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62564 states. [2018-11-28 20:01:24,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62564 to 35364. [2018-11-28 20:01:24,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35364 states. [2018-11-28 20:01:24,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35364 states to 35364 states and 128877 transitions. [2018-11-28 20:01:24,127 INFO L78 Accepts]: Start accepts. Automaton has 35364 states and 128877 transitions. Word has length 48 [2018-11-28 20:01:24,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:01:24,127 INFO L480 AbstractCegarLoop]: Abstraction has 35364 states and 128877 transitions. [2018-11-28 20:01:24,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:01:24,128 INFO L276 IsEmpty]: Start isEmpty. Operand 35364 states and 128877 transitions. [2018-11-28 20:01:24,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-28 20:01:24,135 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:01:24,135 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] [2018-11-28 20:01:24,136 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:01:24,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:01:24,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1874387838, now seen corresponding path program 1 times [2018-11-28 20:01:24,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:01:24,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:01:24,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:01:24,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:01:24,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:01:24,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:01:24,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:01:24,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:01:24,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 20:01:24,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 20:01:24,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 20:01:24,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:01:24,227 INFO L87 Difference]: Start difference. First operand 35364 states and 128877 transitions. Second operand 3 states. [2018-11-28 20:01:24,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:01:24,507 INFO L93 Difference]: Finished difference Result 45910 states and 163945 transitions. [2018-11-28 20:01:24,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 20:01:24,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-11-28 20:01:24,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:01:24,623 INFO L225 Difference]: With dead ends: 45910 [2018-11-28 20:01:24,623 INFO L226 Difference]: Without dead ends: 45910 [2018-11-28 20:01:24,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:01:24,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45910 states. [2018-11-28 20:01:25,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45910 to 40247. [2018-11-28 20:01:25,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40247 states. [2018-11-28 20:01:29,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40247 states to 40247 states and 145215 transitions. [2018-11-28 20:01:29,258 INFO L78 Accepts]: Start accepts. Automaton has 40247 states and 145215 transitions. Word has length 50 [2018-11-28 20:01:29,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:01:29,258 INFO L480 AbstractCegarLoop]: Abstraction has 40247 states and 145215 transitions. [2018-11-28 20:01:29,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 20:01:29,259 INFO L276 IsEmpty]: Start isEmpty. Operand 40247 states and 145215 transitions. [2018-11-28 20:01:29,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-28 20:01:29,275 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:01:29,275 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] [2018-11-28 20:01:29,276 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:01:29,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:01:29,276 INFO L82 PathProgramCache]: Analyzing trace with hash -249286711, now seen corresponding path program 1 times [2018-11-28 20:01:29,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:01:29,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:01:29,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:01:29,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:01:29,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:01:29,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:01:29,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:01:29,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:01:29,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:01:29,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:01:29,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:01:29,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:01:29,440 INFO L87 Difference]: Start difference. First operand 40247 states and 145215 transitions. Second operand 6 states. [2018-11-28 20:01:30,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:01:30,775 INFO L93 Difference]: Finished difference Result 70850 states and 252355 transitions. [2018-11-28 20:01:30,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 20:01:30,776 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-11-28 20:01:30,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:01:30,963 INFO L225 Difference]: With dead ends: 70850 [2018-11-28 20:01:30,963 INFO L226 Difference]: Without dead ends: 70314 [2018-11-28 20:01:30,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-11-28 20:01:31,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70314 states. [2018-11-28 20:01:31,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70314 to 40898. [2018-11-28 20:01:31,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40898 states. [2018-11-28 20:01:32,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40898 states to 40898 states and 147668 transitions. [2018-11-28 20:01:32,052 INFO L78 Accepts]: Start accepts. Automaton has 40898 states and 147668 transitions. Word has length 54 [2018-11-28 20:01:32,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:01:32,052 INFO L480 AbstractCegarLoop]: Abstraction has 40898 states and 147668 transitions. [2018-11-28 20:01:32,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:01:32,053 INFO L276 IsEmpty]: Start isEmpty. Operand 40898 states and 147668 transitions. [2018-11-28 20:01:32,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-28 20:01:32,068 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:01:32,068 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] [2018-11-28 20:01:32,068 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:01:32,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:01:32,069 INFO L82 PathProgramCache]: Analyzing trace with hash 854385994, now seen corresponding path program 1 times [2018-11-28 20:01:32,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:01:32,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:01:32,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:01:32,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:01:32,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:01:32,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:01:32,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:01:32,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:01:32,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:01:32,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:01:32,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:01:32,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:01:32,260 INFO L87 Difference]: Start difference. First operand 40898 states and 147668 transitions. Second operand 6 states. [2018-11-28 20:01:33,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:01:33,416 INFO L93 Difference]: Finished difference Result 56599 states and 201648 transitions. [2018-11-28 20:01:33,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 20:01:33,417 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-11-28 20:01:33,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:01:33,579 INFO L225 Difference]: With dead ends: 56599 [2018-11-28 20:01:33,579 INFO L226 Difference]: Without dead ends: 55460 [2018-11-28 20:01:33,580 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 [2018-11-28 20:01:34,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55460 states. [2018-11-28 20:01:34,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55460 to 51955. [2018-11-28 20:01:34,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51955 states. [2018-11-28 20:01:35,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51955 states to 51955 states and 186007 transitions. [2018-11-28 20:01:35,142 INFO L78 Accepts]: Start accepts. Automaton has 51955 states and 186007 transitions. Word has length 54 [2018-11-28 20:01:35,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:01:35,143 INFO L480 AbstractCegarLoop]: Abstraction has 51955 states and 186007 transitions. [2018-11-28 20:01:35,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:01:35,143 INFO L276 IsEmpty]: Start isEmpty. Operand 51955 states and 186007 transitions. [2018-11-28 20:01:35,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-28 20:01:35,163 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:01:35,163 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] [2018-11-28 20:01:35,163 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:01:35,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:01:35,164 INFO L82 PathProgramCache]: Analyzing trace with hash -942565365, now seen corresponding path program 1 times [2018-11-28 20:01:35,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:01:35,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:01:35,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:01:35,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:01:35,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:01:35,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:01:35,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:01:35,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:01:35,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:01:35,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:01:35,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:01:35,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:01:35,420 INFO L87 Difference]: Start difference. First operand 51955 states and 186007 transitions. Second operand 7 states. [2018-11-28 20:01:36,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:01:36,909 INFO L93 Difference]: Finished difference Result 75638 states and 260104 transitions. [2018-11-28 20:01:36,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 20:01:36,909 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2018-11-28 20:01:36,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:01:37,085 INFO L225 Difference]: With dead ends: 75638 [2018-11-28 20:01:37,085 INFO L226 Difference]: Without dead ends: 75638 [2018-11-28 20:01:37,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-28 20:01:37,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75638 states. [2018-11-28 20:01:38,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75638 to 61473. [2018-11-28 20:01:38,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61473 states. [2018-11-28 20:01:38,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61473 states to 61473 states and 215184 transitions. [2018-11-28 20:01:38,960 INFO L78 Accepts]: Start accepts. Automaton has 61473 states and 215184 transitions. Word has length 54 [2018-11-28 20:01:38,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:01:38,960 INFO L480 AbstractCegarLoop]: Abstraction has 61473 states and 215184 transitions. [2018-11-28 20:01:38,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:01:38,961 INFO L276 IsEmpty]: Start isEmpty. Operand 61473 states and 215184 transitions. [2018-11-28 20:01:38,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-28 20:01:38,976 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:01:38,976 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] [2018-11-28 20:01:38,976 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:01:38,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:01:38,977 INFO L82 PathProgramCache]: Analyzing trace with hash -55061684, now seen corresponding path program 1 times [2018-11-28 20:01:38,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:01:38,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:01:38,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:01:38,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:01:38,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:01:38,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:01:39,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:01:39,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:01:39,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:01:39,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:01:39,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:01:39,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:01:39,122 INFO L87 Difference]: Start difference. First operand 61473 states and 215184 transitions. Second operand 4 states. [2018-11-28 20:01:39,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:01:39,394 INFO L93 Difference]: Finished difference Result 13778 states and 43274 transitions. [2018-11-28 20:01:39,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:01:39,395 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-11-28 20:01:39,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:01:39,414 INFO L225 Difference]: With dead ends: 13778 [2018-11-28 20:01:39,414 INFO L226 Difference]: Without dead ends: 12161 [2018-11-28 20:01:39,414 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 [2018-11-28 20:01:39,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12161 states. [2018-11-28 20:01:39,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12161 to 12113. [2018-11-28 20:01:39,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12113 states. [2018-11-28 20:01:39,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12113 states to 12113 states and 37958 transitions. [2018-11-28 20:01:39,579 INFO L78 Accepts]: Start accepts. Automaton has 12113 states and 37958 transitions. Word has length 54 [2018-11-28 20:01:39,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:01:39,579 INFO L480 AbstractCegarLoop]: Abstraction has 12113 states and 37958 transitions. [2018-11-28 20:01:39,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:01:39,580 INFO L276 IsEmpty]: Start isEmpty. Operand 12113 states and 37958 transitions. [2018-11-28 20:01:39,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-28 20:01:39,585 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:01:39,586 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] [2018-11-28 20:01:39,586 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:01:39,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:01:39,586 INFO L82 PathProgramCache]: Analyzing trace with hash 751631644, now seen corresponding path program 1 times [2018-11-28 20:01:39,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:01:39,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:01:39,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:01:39,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:01:39,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:01:39,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:01:39,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:01:39,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:01:39,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:01:39,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:01:39,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:01:39,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:01:39,755 INFO L87 Difference]: Start difference. First operand 12113 states and 37958 transitions. Second operand 6 states. [2018-11-28 20:01:40,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:01:40,564 INFO L93 Difference]: Finished difference Result 22006 states and 68473 transitions. [2018-11-28 20:01:40,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 20:01:40,565 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-11-28 20:01:40,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:01:40,603 INFO L225 Difference]: With dead ends: 22006 [2018-11-28 20:01:40,603 INFO L226 Difference]: Without dead ends: 21942 [2018-11-28 20:01:40,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-11-28 20:01:40,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21942 states. [2018-11-28 20:01:40,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21942 to 13082. [2018-11-28 20:01:40,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13082 states. [2018-11-28 20:01:40,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13082 states to 13082 states and 40746 transitions. [2018-11-28 20:01:40,899 INFO L78 Accepts]: Start accepts. Automaton has 13082 states and 40746 transitions. Word has length 64 [2018-11-28 20:01:40,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:01:40,900 INFO L480 AbstractCegarLoop]: Abstraction has 13082 states and 40746 transitions. [2018-11-28 20:01:40,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:01:40,900 INFO L276 IsEmpty]: Start isEmpty. Operand 13082 states and 40746 transitions. [2018-11-28 20:01:40,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 20:01:40,910 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:01:40,911 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] [2018-11-28 20:01:40,911 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:01:40,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:01:40,911 INFO L82 PathProgramCache]: Analyzing trace with hash 312014749, now seen corresponding path program 1 times [2018-11-28 20:01:40,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:01:40,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:01:40,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:01:40,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:01:40,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:01:40,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:01:41,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:01:41,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:01:41,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:01:41,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:01:41,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:01:41,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:01:41,206 INFO L87 Difference]: Start difference. First operand 13082 states and 40746 transitions. Second operand 5 states. [2018-11-28 20:01:41,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:01:41,667 INFO L93 Difference]: Finished difference Result 18936 states and 57626 transitions. [2018-11-28 20:01:41,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:01:41,668 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-11-28 20:01:41,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:01:41,701 INFO L225 Difference]: With dead ends: 18936 [2018-11-28 20:01:41,702 INFO L226 Difference]: Without dead ends: 18864 [2018-11-28 20:01:41,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:01:41,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18864 states. [2018-11-28 20:01:41,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18864 to 14593. [2018-11-28 20:01:41,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14593 states. [2018-11-28 20:01:41,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14593 states to 14593 states and 44939 transitions. [2018-11-28 20:01:41,953 INFO L78 Accepts]: Start accepts. Automaton has 14593 states and 44939 transitions. Word has length 66 [2018-11-28 20:01:41,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:01:41,953 INFO L480 AbstractCegarLoop]: Abstraction has 14593 states and 44939 transitions. [2018-11-28 20:01:41,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:01:41,954 INFO L276 IsEmpty]: Start isEmpty. Operand 14593 states and 44939 transitions. [2018-11-28 20:01:41,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 20:01:41,965 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:01:41,965 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] [2018-11-28 20:01:41,965 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:01:41,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:01:41,966 INFO L82 PathProgramCache]: Analyzing trace with hash 100663836, now seen corresponding path program 1 times [2018-11-28 20:01:41,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:01:41,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:01:41,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:01:41,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:01:41,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:01:41,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:01:42,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:01:42,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:01:42,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:01:42,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:01:42,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:01:42,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:01:42,093 INFO L87 Difference]: Start difference. First operand 14593 states and 44939 transitions. Second operand 4 states. [2018-11-28 20:01:42,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:01:42,910 INFO L93 Difference]: Finished difference Result 18063 states and 54942 transitions. [2018-11-28 20:01:42,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 20:01:42,911 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-11-28 20:01:42,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:01:42,942 INFO L225 Difference]: With dead ends: 18063 [2018-11-28 20:01:42,942 INFO L226 Difference]: Without dead ends: 18063 [2018-11-28 20:01:42,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:01:42,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18063 states. [2018-11-28 20:01:43,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18063 to 14853. [2018-11-28 20:01:43,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14853 states. [2018-11-28 20:01:43,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14853 states to 14853 states and 45667 transitions. [2018-11-28 20:01:43,186 INFO L78 Accepts]: Start accepts. Automaton has 14853 states and 45667 transitions. Word has length 66 [2018-11-28 20:01:43,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:01:43,187 INFO L480 AbstractCegarLoop]: Abstraction has 14853 states and 45667 transitions. [2018-11-28 20:01:43,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:01:43,187 INFO L276 IsEmpty]: Start isEmpty. Operand 14853 states and 45667 transitions. [2018-11-28 20:01:43,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 20:01:43,198 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:01:43,198 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] [2018-11-28 20:01:43,199 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:01:43,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:01:43,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1976545507, now seen corresponding path program 1 times [2018-11-28 20:01:43,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:01:43,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:01:43,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:01:43,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:01:43,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:01:43,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:01:43,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:01:43,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:01:43,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 20:01:43,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 20:01:43,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 20:01:43,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:01:43,332 INFO L87 Difference]: Start difference. First operand 14853 states and 45667 transitions. Second operand 3 states. [2018-11-28 20:01:43,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:01:43,582 INFO L93 Difference]: Finished difference Result 15321 states and 46968 transitions. [2018-11-28 20:01:43,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 20:01:43,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-11-28 20:01:43,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:01:43,613 INFO L225 Difference]: With dead ends: 15321 [2018-11-28 20:01:43,614 INFO L226 Difference]: Without dead ends: 15321 [2018-11-28 20:01:43,614 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 [2018-11-28 20:01:43,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15321 states. [2018-11-28 20:01:43,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15321 to 15087. [2018-11-28 20:01:43,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15087 states. [2018-11-28 20:01:43,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15087 states to 15087 states and 46302 transitions. [2018-11-28 20:01:43,907 INFO L78 Accepts]: Start accepts. Automaton has 15087 states and 46302 transitions. Word has length 66 [2018-11-28 20:01:43,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:01:43,907 INFO L480 AbstractCegarLoop]: Abstraction has 15087 states and 46302 transitions. [2018-11-28 20:01:43,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 20:01:43,908 INFO L276 IsEmpty]: Start isEmpty. Operand 15087 states and 46302 transitions. [2018-11-28 20:01:43,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-28 20:01:43,923 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:01:43,923 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] [2018-11-28 20:01:43,923 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:01:43,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:01:43,923 INFO L82 PathProgramCache]: Analyzing trace with hash -4461880, now seen corresponding path program 1 times [2018-11-28 20:01:43,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:01:43,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:01:43,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:01:43,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:01:43,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:01:43,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:01:44,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:01:44,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:01:44,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:01:44,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:01:44,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:01:44,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:01:44,076 INFO L87 Difference]: Start difference. First operand 15087 states and 46302 transitions. Second operand 6 states. [2018-11-28 20:01:45,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:01:45,051 INFO L93 Difference]: Finished difference Result 18372 states and 55442 transitions. [2018-11-28 20:01:45,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:01:45,052 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-11-28 20:01:45,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:01:45,084 INFO L225 Difference]: With dead ends: 18372 [2018-11-28 20:01:45,084 INFO L226 Difference]: Without dead ends: 18372 [2018-11-28 20:01:45,084 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 [2018-11-28 20:01:45,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18372 states. [2018-11-28 20:01:45,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18372 to 16985. [2018-11-28 20:01:45,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16985 states. [2018-11-28 20:01:45,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16985 states to 16985 states and 51614 transitions. [2018-11-28 20:01:45,358 INFO L78 Accepts]: Start accepts. Automaton has 16985 states and 51614 transitions. Word has length 68 [2018-11-28 20:01:45,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:01:45,358 INFO L480 AbstractCegarLoop]: Abstraction has 16985 states and 51614 transitions. [2018-11-28 20:01:45,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:01:45,360 INFO L276 IsEmpty]: Start isEmpty. Operand 16985 states and 51614 transitions. [2018-11-28 20:01:45,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-28 20:01:45,377 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:01:45,377 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] [2018-11-28 20:01:45,378 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:01:45,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:01:45,378 INFO L82 PathProgramCache]: Analyzing trace with hash -2081671223, now seen corresponding path program 1 times [2018-11-28 20:01:45,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:01:45,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:01:45,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:01:45,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:01:45,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:01:45,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:01:45,761 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-11-28 20:01:45,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:01:45,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:01:45,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:01:45,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:01:45,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:01:45,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:01:45,806 INFO L87 Difference]: Start difference. First operand 16985 states and 51614 transitions. Second operand 6 states. [2018-11-28 20:01:46,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:01:46,262 INFO L93 Difference]: Finished difference Result 18713 states and 55989 transitions. [2018-11-28 20:01:46,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 20:01:46,263 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-11-28 20:01:46,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:01:46,294 INFO L225 Difference]: With dead ends: 18713 [2018-11-28 20:01:46,295 INFO L226 Difference]: Without dead ends: 18713 [2018-11-28 20:01:46,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-28 20:01:46,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18713 states. [2018-11-28 20:01:46,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18713 to 17253. [2018-11-28 20:01:46,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17253 states. [2018-11-28 20:01:46,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17253 states to 17253 states and 52053 transitions. [2018-11-28 20:01:46,557 INFO L78 Accepts]: Start accepts. Automaton has 17253 states and 52053 transitions. Word has length 68 [2018-11-28 20:01:46,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:01:46,558 INFO L480 AbstractCegarLoop]: Abstraction has 17253 states and 52053 transitions. [2018-11-28 20:01:46,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:01:46,558 INFO L276 IsEmpty]: Start isEmpty. Operand 17253 states and 52053 transitions. [2018-11-28 20:01:46,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-28 20:01:46,570 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:01:46,570 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] [2018-11-28 20:01:46,571 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:01:46,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:01:46,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1870320310, now seen corresponding path program 1 times [2018-11-28 20:01:46,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:01:46,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:01:46,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:01:46,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:01:46,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:01:46,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:01:46,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:01:46,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:01:46,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:01:46,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:01:46,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:01:46,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:01:46,778 INFO L87 Difference]: Start difference. First operand 17253 states and 52053 transitions. Second operand 5 states. [2018-11-28 20:01:47,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:01:47,295 INFO L93 Difference]: Finished difference Result 25141 states and 75022 transitions. [2018-11-28 20:01:47,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 20:01:47,296 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-11-28 20:01:47,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:01:47,338 INFO L225 Difference]: With dead ends: 25141 [2018-11-28 20:01:47,338 INFO L226 Difference]: Without dead ends: 25141 [2018-11-28 20:01:47,339 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 [2018-11-28 20:01:47,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25141 states. [2018-11-28 20:01:47,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25141 to 19615. [2018-11-28 20:01:47,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19615 states. [2018-11-28 20:01:47,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19615 states to 19615 states and 58937 transitions. [2018-11-28 20:01:47,676 INFO L78 Accepts]: Start accepts. Automaton has 19615 states and 58937 transitions. Word has length 68 [2018-11-28 20:01:47,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:01:47,677 INFO L480 AbstractCegarLoop]: Abstraction has 19615 states and 58937 transitions. [2018-11-28 20:01:47,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:01:47,677 INFO L276 IsEmpty]: Start isEmpty. Operand 19615 states and 58937 transitions. [2018-11-28 20:01:47,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-28 20:01:47,690 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:01:47,690 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] [2018-11-28 20:01:47,691 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:01:47,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:01:47,691 INFO L82 PathProgramCache]: Analyzing trace with hash 617192523, now seen corresponding path program 1 times [2018-11-28 20:01:47,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:01:47,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:01:47,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:01:47,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:01:47,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:01:47,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:01:47,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:01:47,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:01:47,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:01:47,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:01:47,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:01:47,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:01:47,970 INFO L87 Difference]: Start difference. First operand 19615 states and 58937 transitions. Second operand 6 states. [2018-11-28 20:01:48,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:01:48,137 INFO L93 Difference]: Finished difference Result 18683 states and 52718 transitions. [2018-11-28 20:01:48,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:01:48,139 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-11-28 20:01:48,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:01:48,167 INFO L225 Difference]: With dead ends: 18683 [2018-11-28 20:01:48,167 INFO L226 Difference]: Without dead ends: 18683 [2018-11-28 20:01:48,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:01:48,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18683 states. [2018-11-28 20:01:48,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18683 to 15605. [2018-11-28 20:01:48,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15605 states. [2018-11-28 20:01:48,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15605 states to 15605 states and 44281 transitions. [2018-11-28 20:01:48,411 INFO L78 Accepts]: Start accepts. Automaton has 15605 states and 44281 transitions. Word has length 68 [2018-11-28 20:01:48,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:01:48,411 INFO L480 AbstractCegarLoop]: Abstraction has 15605 states and 44281 transitions. [2018-11-28 20:01:48,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:01:48,411 INFO L276 IsEmpty]: Start isEmpty. Operand 15605 states and 44281 transitions. [2018-11-28 20:01:48,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-28 20:01:48,421 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:01:48,422 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] [2018-11-28 20:01:48,422 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:01:48,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:01:48,422 INFO L82 PathProgramCache]: Analyzing trace with hash -292255155, now seen corresponding path program 1 times [2018-11-28 20:01:48,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:01:48,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:01:48,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:01:48,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:01:48,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:01:48,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:01:48,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:01:48,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:01:48,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:01:48,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:01:48,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:01:48,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:01:48,608 INFO L87 Difference]: Start difference. First operand 15605 states and 44281 transitions. Second operand 5 states. [2018-11-28 20:01:48,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:01:48,659 INFO L93 Difference]: Finished difference Result 4337 states and 10398 transitions. [2018-11-28 20:01:48,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 20:01:48,660 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-11-28 20:01:48,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:01:48,665 INFO L225 Difference]: With dead ends: 4337 [2018-11-28 20:01:48,665 INFO L226 Difference]: Without dead ends: 3471 [2018-11-28 20:01:48,665 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 [2018-11-28 20:01:48,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3471 states. [2018-11-28 20:01:48,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3471 to 2915. [2018-11-28 20:01:48,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2915 states. [2018-11-28 20:01:48,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2915 states to 2915 states and 6809 transitions. [2018-11-28 20:01:48,702 INFO L78 Accepts]: Start accepts. Automaton has 2915 states and 6809 transitions. Word has length 68 [2018-11-28 20:01:48,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:01:48,702 INFO L480 AbstractCegarLoop]: Abstraction has 2915 states and 6809 transitions. [2018-11-28 20:01:48,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:01:48,703 INFO L276 IsEmpty]: Start isEmpty. Operand 2915 states and 6809 transitions. [2018-11-28 20:01:48,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-28 20:01:48,706 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:01:48,706 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:01:48,707 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:01:48,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:01:48,707 INFO L82 PathProgramCache]: Analyzing trace with hash -978840141, now seen corresponding path program 1 times [2018-11-28 20:01:48,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:01:48,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:01:48,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:01:48,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:01:48,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:01:48,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:01:48,865 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-28 20:01:48,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:01:48,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:01:48,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:01:48,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:01:48,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:01:48,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:01:48,930 INFO L87 Difference]: Start difference. First operand 2915 states and 6809 transitions. Second operand 7 states. [2018-11-28 20:01:49,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:01:49,573 INFO L93 Difference]: Finished difference Result 4238 states and 9787 transitions. [2018-11-28 20:01:49,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:01:49,574 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2018-11-28 20:01:49,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:01:49,579 INFO L225 Difference]: With dead ends: 4238 [2018-11-28 20:01:49,579 INFO L226 Difference]: Without dead ends: 4238 [2018-11-28 20:01:49,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:01:49,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4238 states. [2018-11-28 20:01:49,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4238 to 3041. [2018-11-28 20:01:49,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3041 states. [2018-11-28 20:01:49,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3041 states to 3041 states and 7133 transitions. [2018-11-28 20:01:49,620 INFO L78 Accepts]: Start accepts. Automaton has 3041 states and 7133 transitions. Word has length 85 [2018-11-28 20:01:49,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:01:49,620 INFO L480 AbstractCegarLoop]: Abstraction has 3041 states and 7133 transitions. [2018-11-28 20:01:49,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:01:49,620 INFO L276 IsEmpty]: Start isEmpty. Operand 3041 states and 7133 transitions. [2018-11-28 20:01:49,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-28 20:01:49,624 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:01:49,624 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] [2018-11-28 20:01:49,624 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:01:49,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:01:49,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1492345996, now seen corresponding path program 1 times [2018-11-28 20:01:49,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:01:49,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:01:49,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:01:49,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:01:49,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:01:49,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:01:49,945 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-28 20:01:50,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:01:50,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:01:50,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 20:01:50,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 20:01:50,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 20:01:50,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-28 20:01:50,025 INFO L87 Difference]: Start difference. First operand 3041 states and 7133 transitions. Second operand 10 states. [2018-11-28 20:01:52,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:01:52,626 INFO L93 Difference]: Finished difference Result 5124 states and 11953 transitions. [2018-11-28 20:01:52,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 20:01:52,626 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 85 [2018-11-28 20:01:52,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:01:52,632 INFO L225 Difference]: With dead ends: 5124 [2018-11-28 20:01:52,632 INFO L226 Difference]: Without dead ends: 3687 [2018-11-28 20:01:52,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2018-11-28 20:01:52,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3687 states. [2018-11-28 20:01:52,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3687 to 3128. [2018-11-28 20:01:52,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2018-11-28 20:01:52,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 7279 transitions. [2018-11-28 20:01:52,670 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 7279 transitions. Word has length 85 [2018-11-28 20:01:52,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:01:52,670 INFO L480 AbstractCegarLoop]: Abstraction has 3128 states and 7279 transitions. [2018-11-28 20:01:52,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 20:01:52,671 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 7279 transitions. [2018-11-28 20:01:52,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-28 20:01:52,674 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:01:52,675 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] [2018-11-28 20:01:52,675 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:01:52,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:01:52,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1933159169, now seen corresponding path program 2 times [2018-11-28 20:01:52,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:01:52,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:01:52,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:01:52,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:01:52,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:01:52,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:01:52,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:01:52,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:01:52,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:01:52,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:01:52,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:01:52,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:01:52,842 INFO L87 Difference]: Start difference. First operand 3128 states and 7279 transitions. Second operand 6 states. [2018-11-28 20:01:53,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:01:53,063 INFO L93 Difference]: Finished difference Result 3620 states and 8311 transitions. [2018-11-28 20:01:53,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:01:53,064 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2018-11-28 20:01:53,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:01:53,069 INFO L225 Difference]: With dead ends: 3620 [2018-11-28 20:01:53,069 INFO L226 Difference]: Without dead ends: 3562 [2018-11-28 20:01:53,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:01:53,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3562 states. [2018-11-28 20:01:53,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3562 to 2873. [2018-11-28 20:01:53,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2873 states. [2018-11-28 20:01:53,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2873 states to 2873 states and 6589 transitions. [2018-11-28 20:01:53,106 INFO L78 Accepts]: Start accepts. Automaton has 2873 states and 6589 transitions. Word has length 85 [2018-11-28 20:01:53,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:01:53,107 INFO L480 AbstractCegarLoop]: Abstraction has 2873 states and 6589 transitions. [2018-11-28 20:01:53,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:01:53,107 INFO L276 IsEmpty]: Start isEmpty. Operand 2873 states and 6589 transitions. [2018-11-28 20:01:53,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-28 20:01:53,111 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:01:53,111 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] [2018-11-28 20:01:53,111 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:01:53,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:01:53,111 INFO L82 PathProgramCache]: Analyzing trace with hash 284598784, now seen corresponding path program 2 times [2018-11-28 20:01:53,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:01:53,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:01:53,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:01:53,116 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 20:01:53,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:01:53,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:01:53,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:01:53,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:01:53,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 20:01:53,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 20:01:53,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 20:01:53,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-28 20:01:53,292 INFO L87 Difference]: Start difference. First operand 2873 states and 6589 transitions. Second operand 10 states. [2018-11-28 20:01:54,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:01:54,104 INFO L93 Difference]: Finished difference Result 5568 states and 12798 transitions. [2018-11-28 20:01:54,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 20:01:54,106 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 85 [2018-11-28 20:01:54,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:01:54,109 INFO L225 Difference]: With dead ends: 5568 [2018-11-28 20:01:54,109 INFO L226 Difference]: Without dead ends: 2147 [2018-11-28 20:01:54,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2018-11-28 20:01:54,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2147 states. [2018-11-28 20:01:54,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2147 to 2147. [2018-11-28 20:01:54,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2147 states. [2018-11-28 20:01:54,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2147 states to 2147 states and 4923 transitions. [2018-11-28 20:01:54,132 INFO L78 Accepts]: Start accepts. Automaton has 2147 states and 4923 transitions. Word has length 85 [2018-11-28 20:01:54,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:01:54,133 INFO L480 AbstractCegarLoop]: Abstraction has 2147 states and 4923 transitions. [2018-11-28 20:01:54,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 20:01:54,133 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 4923 transitions. [2018-11-28 20:01:54,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-28 20:01:54,135 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:01:54,136 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] [2018-11-28 20:01:54,136 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:01:54,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:01:54,136 INFO L82 PathProgramCache]: Analyzing trace with hash 304772068, now seen corresponding path program 3 times [2018-11-28 20:01:54,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:01:54,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:01:54,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:01:54,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 20:01:54,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:01:54,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:01:54,406 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-28 20:01:54,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 20:01:54,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:01:54,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 20:01:54,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 20:01:54,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 20:01:54,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-28 20:01:54,502 INFO L87 Difference]: Start difference. First operand 2147 states and 4923 transitions. Second operand 11 states. [2018-11-28 20:01:55,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:01:55,687 INFO L93 Difference]: Finished difference Result 3613 states and 8295 transitions. [2018-11-28 20:01:55,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 20:01:55,689 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 85 [2018-11-28 20:01:55,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:01:55,693 INFO L225 Difference]: With dead ends: 3613 [2018-11-28 20:01:55,693 INFO L226 Difference]: Without dead ends: 2360 [2018-11-28 20:01:55,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2018-11-28 20:01:55,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2360 states. [2018-11-28 20:01:55,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2360 to 2145. [2018-11-28 20:01:55,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2145 states. [2018-11-28 20:01:55,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2145 states to 2145 states and 4915 transitions. [2018-11-28 20:01:55,725 INFO L78 Accepts]: Start accepts. Automaton has 2145 states and 4915 transitions. Word has length 85 [2018-11-28 20:01:55,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:01:55,725 INFO L480 AbstractCegarLoop]: Abstraction has 2145 states and 4915 transitions. [2018-11-28 20:01:55,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 20:01:55,725 INFO L276 IsEmpty]: Start isEmpty. Operand 2145 states and 4915 transitions. [2018-11-28 20:01:55,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-28 20:01:55,730 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:01:55,731 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] [2018-11-28 20:01:55,731 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:01:55,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:01:55,731 INFO L82 PathProgramCache]: Analyzing trace with hash -2020461724, now seen corresponding path program 4 times [2018-11-28 20:01:55,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:01:55,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:01:55,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:01:55,736 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 20:01:55,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:01:55,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 20:01:55,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 20:01:55,810 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 20:01:56,013 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-11-28 20:01:56,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:01:56 BasicIcfg [2018-11-28 20:01:56,017 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 20:01:56,017 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 20:01:56,017 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 20:01:56,017 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 20:01:56,019 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:01:10" (3/4) ... [2018-11-28 20:01:56,023 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 20:01:56,204 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 20:01:56,204 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 20:01:56,206 INFO L168 Benchmark]: Toolchain (without parser) took 48347.24 ms. Allocated memory was 1.0 GB in the beginning and 4.5 GB in the end (delta: 3.5 GB). Free memory was 952.7 MB in the beginning and 3.8 GB in the end (delta: -2.8 GB). Peak memory consumption was 624.1 MB. Max. memory is 11.5 GB. [2018-11-28 20:01:56,210 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 20:01:56,210 INFO L168 Benchmark]: CACSL2BoogieTranslator took 889.33 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -142.0 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2018-11-28 20:01:56,210 INFO L168 Benchmark]: Boogie Procedure Inliner took 91.61 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-11-28 20:01:56,212 INFO L168 Benchmark]: Boogie Preprocessor took 47.31 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 20:01:56,212 INFO L168 Benchmark]: RCFGBuilder took 1431.46 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 40.0 MB). Peak memory consumption was 40.0 MB. Max. memory is 11.5 GB. [2018-11-28 20:01:56,214 INFO L168 Benchmark]: TraceAbstraction took 45693.91 ms. Allocated memory was 1.1 GB in the beginning and 4.5 GB in the end (delta: 3.3 GB). Free memory was 1.0 GB in the beginning and 3.8 GB in the end (delta: -2.7 GB). Peak memory consumption was 598.0 MB. Max. memory is 11.5 GB. [2018-11-28 20:01:56,214 INFO L168 Benchmark]: Witness Printer took 187.44 ms. Allocated memory is still 4.5 GB. Free memory is still 3.8 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 20:01:56,218 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.20 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 889.33 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -142.0 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 91.61 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.31 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1431.46 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 40.0 MB). Peak memory consumption was 40.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 45693.91 ms. Allocated memory was 1.1 GB in the beginning and 4.5 GB in the end (delta: 3.3 GB). Free memory was 1.0 GB in the beginning and 3.8 GB in the end (delta: -2.7 GB). Peak memory consumption was 598.0 MB. Max. memory is 11.5 GB. * Witness Printer took 187.44 ms. Allocated memory is still 4.5 GB. Free memory is still 3.8 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L678] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L679] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L680] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L682] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L683] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L684] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L685] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L686] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L687] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L688] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L689] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L690] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L691] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L692] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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}] [L693] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L694] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L695] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L696] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L698] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L700] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L701] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L702] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L776] -1 pthread_t t913; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L777] FCALL, FORK -1 pthread_create(&t913, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=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 t914; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=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(&t914, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=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] [L734] 0 x$w_buff1 = x$w_buff0 [L735] 0 x$w_buff0 = 1 [L736] 0 x$w_buff1_used = x$w_buff0_used [L737] 0 x$w_buff0_used = (_Bool)1 [L5] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=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] [L739] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L740] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L741] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L742] 0 x$r_buff0_thd2 = (_Bool)1 [L745] 0 y = 1 [L748] 0 __unbuffered_p1_EAX = y [L751] 0 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __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=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L754] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __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=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L706] 1 z = 1 [L709] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L710] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L711] 1 x$flush_delayed = weak$$choice2 [L712] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L713] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=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=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L754] 0 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L755] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=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=7, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L755] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L756] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=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=7, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L713] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L714] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? 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=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L714] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L715] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? 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=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L715] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L757] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L757] 0 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L758] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L758] 0 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L761] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L716] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L716] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L717] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L717] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L718] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=7, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L718] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L719] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=7, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L719] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L720] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L721] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=7, 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=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L721] 1 x = x$flush_delayed ? x$mem_tmp : x [L722] 1 x$flush_delayed = (_Bool)0 [L727] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L781] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L785] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L785] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L785] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L785] -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) [L786] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L786] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L787] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L787] -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 [L788] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L788] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L789] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L789] -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 [L792] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L5] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L5] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 200 locations, 3 error locations. UNSAFE Result, 45.5s OverallTime, 23 OverallIterations, 1 TraceHistogramMax, 20.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6277 SDtfs, 8172 SDslu, 14980 SDs, 0 SdLazy, 6437 SolverSat, 386 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 214 GetRequests, 54 SyntacticMatches, 8 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61473occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 17.2s AutomataMinimizationTime, 22 MinimizatonAttempts, 139361 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 1512 NumberOfCodeBlocks, 1512 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1405 ConstructedInterpolants, 0 QuantifiedInterpolants, 253352 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...