./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix054_power.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/mix054_power.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 afbf25d75f484a934aa8912c08ac22e74061fce8 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:14:35,102 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 20:14:35,104 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 20:14:35,117 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 20:14:35,117 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 20:14:35,118 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 20:14:35,119 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 20:14:35,122 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 20:14:35,123 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 20:14:35,124 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 20:14:35,125 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 20:14:35,126 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 20:14:35,127 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 20:14:35,128 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 20:14:35,130 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 20:14:35,130 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 20:14:35,131 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 20:14:35,133 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 20:14:35,136 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 20:14:35,137 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 20:14:35,138 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 20:14:35,140 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 20:14:35,143 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 20:14:35,143 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 20:14:35,143 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 20:14:35,145 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 20:14:35,146 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 20:14:35,147 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 20:14:35,148 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 20:14:35,149 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 20:14:35,149 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 20:14:35,151 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 20:14:35,151 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 20:14:35,151 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 20:14:35,152 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 20:14:35,153 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 20:14:35,154 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:14:35,179 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 20:14:35,180 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 20:14:35,181 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 20:14:35,181 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 20:14:35,181 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 20:14:35,182 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 20:14:35,183 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 20:14:35,183 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 20:14:35,183 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 20:14:35,183 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 20:14:35,183 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 20:14:35,184 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 20:14:35,184 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 20:14:35,185 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 20:14:35,185 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 20:14:35,185 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 20:14:35,185 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 20:14:35,185 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 20:14:35,186 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 20:14:35,186 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 20:14:35,186 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 20:14:35,186 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 20:14:35,186 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 20:14:35,188 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 20:14:35,188 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 20:14:35,188 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 20:14:35,189 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 20:14:35,189 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 20:14:35,189 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 20:14:35,189 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 20:14:35,189 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 -> afbf25d75f484a934aa8912c08ac22e74061fce8 [2018-11-28 20:14:35,231 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 20:14:35,251 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 20:14:35,259 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 20:14:35,260 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 20:14:35,261 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 20:14:35,262 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix054_power.opt_false-unreach-call.i [2018-11-28 20:14:35,345 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38d4a4838/1be376c527ab42e998255edb6e938bde/FLAG87232d069 [2018-11-28 20:14:35,939 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 20:14:35,940 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix054_power.opt_false-unreach-call.i [2018-11-28 20:14:35,964 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38d4a4838/1be376c527ab42e998255edb6e938bde/FLAG87232d069 [2018-11-28 20:14:36,204 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38d4a4838/1be376c527ab42e998255edb6e938bde [2018-11-28 20:14:36,209 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 20:14:36,210 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 20:14:36,211 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 20:14:36,212 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 20:14:36,216 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 20:14:36,217 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:14:36" (1/1) ... [2018-11-28 20:14:36,222 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@390992f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:14:36, skipping insertion in model container [2018-11-28 20:14:36,223 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:14:36" (1/1) ... [2018-11-28 20:14:36,231 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 20:14:36,307 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 20:14:36,828 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 20:14:36,845 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 20:14:37,008 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 20:14:37,106 INFO L195 MainTranslator]: Completed translation [2018-11-28 20:14:37,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:14:37 WrapperNode [2018-11-28 20:14:37,107 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 20:14:37,108 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 20:14:37,109 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 20:14:37,109 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 20:14:37,119 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:14:37" (1/1) ... [2018-11-28 20:14:37,139 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:14:37" (1/1) ... [2018-11-28 20:14:37,175 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 20:14:37,176 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 20:14:37,176 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 20:14:37,176 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 20:14:37,189 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:14:37" (1/1) ... [2018-11-28 20:14:37,190 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:14:37" (1/1) ... [2018-11-28 20:14:37,195 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:14:37" (1/1) ... [2018-11-28 20:14:37,196 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:14:37" (1/1) ... [2018-11-28 20:14:37,210 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:14:37" (1/1) ... [2018-11-28 20:14:37,215 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:14:37" (1/1) ... [2018-11-28 20:14:37,219 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:14:37" (1/1) ... [2018-11-28 20:14:37,225 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 20:14:37,226 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 20:14:37,226 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 20:14:37,227 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 20:14:37,228 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:14:37" (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:14:37,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 20:14:37,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 20:14:37,299 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-11-28 20:14:37,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 20:14:37,300 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-11-28 20:14:37,300 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-11-28 20:14:37,300 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-11-28 20:14:37,300 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-11-28 20:14:37,300 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-11-28 20:14:37,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 20:14:37,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 20:14:37,302 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:14:38,557 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 20:14:38,559 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 20:14:38,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:14:38 BoogieIcfgContainer [2018-11-28 20:14:38,560 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 20:14:38,562 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 20:14:38,562 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 20:14:38,566 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 20:14:38,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:14:36" (1/3) ... [2018-11-28 20:14:38,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@442bcac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:14:38, skipping insertion in model container [2018-11-28 20:14:38,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:14:37" (2/3) ... [2018-11-28 20:14:38,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@442bcac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:14:38, skipping insertion in model container [2018-11-28 20:14:38,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:14:38" (3/3) ... [2018-11-28 20:14:38,570 INFO L112 eAbstractionObserver]: Analyzing ICFG mix054_power.opt_false-unreach-call.i [2018-11-28 20:14:38,617 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,618 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,618 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,618 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,619 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,619 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,619 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,620 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,620 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,621 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,621 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,621 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,621 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,625 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,625 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,625 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,625 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,626 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,626 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,626 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,626 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,627 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,627 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,627 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,627 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,627 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,628 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,628 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,629 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,629 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,629 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,629 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,630 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,630 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,630 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,630 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,630 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,630 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,632 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,632 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,633 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,633 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,633 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,633 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,634 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,634 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,634 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,634 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,634 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,634 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,636 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,636 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,636 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,636 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,637 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,637 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,637 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,637 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,637 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,644 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,644 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,644 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,644 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,645 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,645 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,645 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,646 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,646 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,646 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,646 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,646 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,647 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,647 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,647 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,647 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,647 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,649 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,649 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,649 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,650 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,650 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,650 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,650 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,650 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,651 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,651 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,651 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,651 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,651 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,652 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,652 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,652 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,652 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,653 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,653 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,653 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,653 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,654 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,654 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,654 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,654 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,655 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,655 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,656 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,656 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,656 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,656 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,657 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,659 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,659 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,660 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,660 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,660 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,660 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,660 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,661 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,661 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,661 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,661 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,662 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,663 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,663 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,663 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,663 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,664 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,664 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,664 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,664 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,664 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,665 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,665 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,665 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,665 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,665 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,666 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,666 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,666 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,666 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,666 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,667 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,667 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,667 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,667 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,667 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,669 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,669 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,669 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,669 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,669 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,670 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,670 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,670 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,670 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,670 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,671 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,671 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,671 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,671 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,671 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,672 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,672 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,672 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,672 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,672 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 20:14:38,704 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-11-28 20:14:38,704 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 20:14:38,716 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-28 20:14:38,739 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-28 20:14:38,767 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 20:14:38,767 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 20:14:38,768 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 20:14:38,768 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 20:14:38,768 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 20:14:38,768 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 20:14:38,768 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 20:14:38,768 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 20:14:38,768 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 20:14:38,783 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 141places, 179 transitions [2018-11-28 20:14:41,658 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34805 states. [2018-11-28 20:14:41,660 INFO L276 IsEmpty]: Start isEmpty. Operand 34805 states. [2018-11-28 20:14:41,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-28 20:14:41,667 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:14:41,669 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:14:41,671 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:14:41,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:14:41,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1272153477, now seen corresponding path program 1 times [2018-11-28 20:14:41,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:14:41,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:14:41,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:14:41,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:14:41,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:14:41,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:14:42,002 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:14:42,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:14:42,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:14:42,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:14:42,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:14:42,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:14:42,030 INFO L87 Difference]: Start difference. First operand 34805 states. Second operand 4 states. [2018-11-28 20:14:43,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:14:43,484 INFO L93 Difference]: Finished difference Result 60789 states and 234492 transitions. [2018-11-28 20:14:43,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 20:14:43,487 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-11-28 20:14:43,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:14:43,861 INFO L225 Difference]: With dead ends: 60789 [2018-11-28 20:14:43,861 INFO L226 Difference]: Without dead ends: 44269 [2018-11-28 20:14:43,863 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:14:44,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44269 states. [2018-11-28 20:14:45,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44269 to 27337. [2018-11-28 20:14:45,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27337 states. [2018-11-28 20:14:45,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27337 states to 27337 states and 105498 transitions. [2018-11-28 20:14:45,632 INFO L78 Accepts]: Start accepts. Automaton has 27337 states and 105498 transitions. Word has length 32 [2018-11-28 20:14:45,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:14:45,636 INFO L480 AbstractCegarLoop]: Abstraction has 27337 states and 105498 transitions. [2018-11-28 20:14:45,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:14:45,636 INFO L276 IsEmpty]: Start isEmpty. Operand 27337 states and 105498 transitions. [2018-11-28 20:14:45,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-28 20:14:45,656 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:14:45,656 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:14:45,657 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:14:45,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:14:45,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1559910934, now seen corresponding path program 1 times [2018-11-28 20:14:45,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:14:45,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:14:45,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:14:45,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:14:45,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:14:45,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:14:45,904 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:14:45,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:14:45,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:14:45,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:14:45,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:14:45,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:14:45,913 INFO L87 Difference]: Start difference. First operand 27337 states and 105498 transitions. Second operand 4 states. [2018-11-28 20:14:46,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:14:46,254 INFO L93 Difference]: Finished difference Result 8527 states and 28343 transitions. [2018-11-28 20:14:46,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:14:46,255 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-11-28 20:14:46,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:14:46,292 INFO L225 Difference]: With dead ends: 8527 [2018-11-28 20:14:46,293 INFO L226 Difference]: Without dead ends: 7465 [2018-11-28 20:14:46,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:14:46,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7465 states. [2018-11-28 20:14:46,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7465 to 7465. [2018-11-28 20:14:46,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7465 states. [2018-11-28 20:14:46,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7465 states to 7465 states and 24635 transitions. [2018-11-28 20:14:46,508 INFO L78 Accepts]: Start accepts. Automaton has 7465 states and 24635 transitions. Word has length 44 [2018-11-28 20:14:46,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:14:46,509 INFO L480 AbstractCegarLoop]: Abstraction has 7465 states and 24635 transitions. [2018-11-28 20:14:46,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:14:46,509 INFO L276 IsEmpty]: Start isEmpty. Operand 7465 states and 24635 transitions. [2018-11-28 20:14:46,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-28 20:14:46,514 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:14:46,514 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] [2018-11-28 20:14:46,515 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:14:46,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:14:46,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1459656693, now seen corresponding path program 1 times [2018-11-28 20:14:46,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:14:46,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:14:46,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:14:46,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:14:46,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:14:46,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:14:46,797 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:14:46,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:14:46,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:14:46,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:14:46,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:14:46,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:14:46,800 INFO L87 Difference]: Start difference. First operand 7465 states and 24635 transitions. Second operand 5 states. [2018-11-28 20:14:48,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:14:48,863 INFO L93 Difference]: Finished difference Result 13997 states and 45804 transitions. [2018-11-28 20:14:48,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:14:48,865 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-11-28 20:14:48,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:14:48,919 INFO L225 Difference]: With dead ends: 13997 [2018-11-28 20:14:48,920 INFO L226 Difference]: Without dead ends: 13929 [2018-11-28 20:14:48,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:14:48,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13929 states. [2018-11-28 20:14:49,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13929 to 9440. [2018-11-28 20:14:49,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9440 states. [2018-11-28 20:14:49,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9440 states to 9440 states and 30541 transitions. [2018-11-28 20:14:49,437 INFO L78 Accepts]: Start accepts. Automaton has 9440 states and 30541 transitions. Word has length 45 [2018-11-28 20:14:49,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:14:49,439 INFO L480 AbstractCegarLoop]: Abstraction has 9440 states and 30541 transitions. [2018-11-28 20:14:49,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:14:49,439 INFO L276 IsEmpty]: Start isEmpty. Operand 9440 states and 30541 transitions. [2018-11-28 20:14:49,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-28 20:14:49,441 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:14:49,441 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:14:49,442 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:14:49,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:14:49,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1598559727, now seen corresponding path program 1 times [2018-11-28 20:14:49,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:14:49,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:14:49,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:14:49,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:14:49,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:14:49,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:14:49,565 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:14:49,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:14:49,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 20:14:49,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 20:14:49,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 20:14:49,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:14:49,568 INFO L87 Difference]: Start difference. First operand 9440 states and 30541 transitions. Second operand 3 states. [2018-11-28 20:14:49,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:14:49,710 INFO L93 Difference]: Finished difference Result 13278 states and 42640 transitions. [2018-11-28 20:14:49,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 20:14:49,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-11-28 20:14:49,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:14:49,760 INFO L225 Difference]: With dead ends: 13278 [2018-11-28 20:14:49,760 INFO L226 Difference]: Without dead ends: 13278 [2018-11-28 20:14:49,760 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:14:49,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13278 states. [2018-11-28 20:14:49,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13278 to 9844. [2018-11-28 20:14:49,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9844 states. [2018-11-28 20:14:50,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9844 states to 9844 states and 31507 transitions. [2018-11-28 20:14:50,007 INFO L78 Accepts]: Start accepts. Automaton has 9844 states and 31507 transitions. Word has length 47 [2018-11-28 20:14:50,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:14:50,008 INFO L480 AbstractCegarLoop]: Abstraction has 9844 states and 31507 transitions. [2018-11-28 20:14:50,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 20:14:50,008 INFO L276 IsEmpty]: Start isEmpty. Operand 9844 states and 31507 transitions. [2018-11-28 20:14:50,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-28 20:14:50,010 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:14:50,011 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] [2018-11-28 20:14:50,011 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:14:50,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:14:50,011 INFO L82 PathProgramCache]: Analyzing trace with hash -108379620, now seen corresponding path program 1 times [2018-11-28 20:14:50,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:14:50,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:14:50,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:14:50,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:14:50,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:14:50,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:14:50,325 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:14:50,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:14:50,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 20:14:50,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 20:14:50,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 20:14:50,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:14:50,327 INFO L87 Difference]: Start difference. First operand 9844 states and 31507 transitions. Second operand 7 states. [2018-11-28 20:14:51,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:14:51,569 INFO L93 Difference]: Finished difference Result 12284 states and 38672 transitions. [2018-11-28 20:14:51,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 20:14:51,571 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2018-11-28 20:14:51,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:14:51,602 INFO L225 Difference]: With dead ends: 12284 [2018-11-28 20:14:51,602 INFO L226 Difference]: Without dead ends: 12212 [2018-11-28 20:14:51,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-11-28 20:14:51,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12212 states. [2018-11-28 20:14:51,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12212 to 10848. [2018-11-28 20:14:51,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10848 states. [2018-11-28 20:14:51,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10848 states to 10848 states and 34562 transitions. [2018-11-28 20:14:51,848 INFO L78 Accepts]: Start accepts. Automaton has 10848 states and 34562 transitions. Word has length 51 [2018-11-28 20:14:51,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:14:51,848 INFO L480 AbstractCegarLoop]: Abstraction has 10848 states and 34562 transitions. [2018-11-28 20:14:51,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 20:14:51,849 INFO L276 IsEmpty]: Start isEmpty. Operand 10848 states and 34562 transitions. [2018-11-28 20:14:51,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-28 20:14:51,854 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:14:51,855 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] [2018-11-28 20:14:51,855 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:14:51,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:14:51,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1204429704, now seen corresponding path program 1 times [2018-11-28 20:14:51,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:14:51,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:14:51,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:14:51,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:14:51,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:14:51,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:14:51,996 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:14:51,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:14:51,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:14:51,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:14:51,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:14:51,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:14:51,997 INFO L87 Difference]: Start difference. First operand 10848 states and 34562 transitions. Second operand 4 states. [2018-11-28 20:14:52,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:14:52,185 INFO L93 Difference]: Finished difference Result 12395 states and 39571 transitions. [2018-11-28 20:14:52,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:14:52,188 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-11-28 20:14:52,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:14:52,212 INFO L225 Difference]: With dead ends: 12395 [2018-11-28 20:14:52,212 INFO L226 Difference]: Without dead ends: 12395 [2018-11-28 20:14:52,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:14:52,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12395 states. [2018-11-28 20:14:52,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12395 to 11368. [2018-11-28 20:14:52,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11368 states. [2018-11-28 20:14:52,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11368 states to 11368 states and 36235 transitions. [2018-11-28 20:14:52,504 INFO L78 Accepts]: Start accepts. Automaton has 11368 states and 36235 transitions. Word has length 59 [2018-11-28 20:14:52,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:14:52,505 INFO L480 AbstractCegarLoop]: Abstraction has 11368 states and 36235 transitions. [2018-11-28 20:14:52,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:14:52,505 INFO L276 IsEmpty]: Start isEmpty. Operand 11368 states and 36235 transitions. [2018-11-28 20:14:52,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-28 20:14:52,513 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:14:52,514 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] [2018-11-28 20:14:52,514 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:14:52,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:14:52,514 INFO L82 PathProgramCache]: Analyzing trace with hash 538380631, now seen corresponding path program 1 times [2018-11-28 20:14:52,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:14:52,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:14:52,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:14:52,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:14:52,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:14:52,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:14:52,792 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:14:52,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:14:52,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:14:52,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:14:52,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:14:52,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:14:52,794 INFO L87 Difference]: Start difference. First operand 11368 states and 36235 transitions. Second operand 6 states. [2018-11-28 20:14:53,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:14:53,645 INFO L93 Difference]: Finished difference Result 20968 states and 66485 transitions. [2018-11-28 20:14:53,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 20:14:53,646 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2018-11-28 20:14:53,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:14:53,691 INFO L225 Difference]: With dead ends: 20968 [2018-11-28 20:14:53,691 INFO L226 Difference]: Without dead ends: 20897 [2018-11-28 20:14:53,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-11-28 20:14:53,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20897 states. [2018-11-28 20:14:54,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20897 to 13754. [2018-11-28 20:14:54,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13754 states. [2018-11-28 20:14:54,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13754 states to 13754 states and 43279 transitions. [2018-11-28 20:14:54,349 INFO L78 Accepts]: Start accepts. Automaton has 13754 states and 43279 transitions. Word has length 59 [2018-11-28 20:14:54,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:14:54,349 INFO L480 AbstractCegarLoop]: Abstraction has 13754 states and 43279 transitions. [2018-11-28 20:14:54,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:14:54,350 INFO L276 IsEmpty]: Start isEmpty. Operand 13754 states and 43279 transitions. [2018-11-28 20:14:54,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-28 20:14:54,360 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:14:54,360 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] [2018-11-28 20:14:54,360 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:14:54,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:14:54,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1067585964, now seen corresponding path program 1 times [2018-11-28 20:14:54,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:14:54,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:14:54,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:14:54,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:14:54,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:14:54,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:14:54,508 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:14:54,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:14:54,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:14:54,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:14:54,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:14:54,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:14:54,511 INFO L87 Difference]: Start difference. First operand 13754 states and 43279 transitions. Second operand 4 states. [2018-11-28 20:14:55,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:14:55,355 INFO L93 Difference]: Finished difference Result 20200 states and 61902 transitions. [2018-11-28 20:14:55,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:14:55,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-11-28 20:14:55,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:14:55,397 INFO L225 Difference]: With dead ends: 20200 [2018-11-28 20:14:55,397 INFO L226 Difference]: Without dead ends: 20200 [2018-11-28 20:14:55,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:14:55,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20200 states. [2018-11-28 20:14:55,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20200 to 15792. [2018-11-28 20:14:55,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15792 states. [2018-11-28 20:14:55,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15792 states to 15792 states and 49060 transitions. [2018-11-28 20:14:55,755 INFO L78 Accepts]: Start accepts. Automaton has 15792 states and 49060 transitions. Word has length 63 [2018-11-28 20:14:55,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:14:55,755 INFO L480 AbstractCegarLoop]: Abstraction has 15792 states and 49060 transitions. [2018-11-28 20:14:55,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:14:55,755 INFO L276 IsEmpty]: Start isEmpty. Operand 15792 states and 49060 transitions. [2018-11-28 20:14:55,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-28 20:14:55,765 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:14:55,765 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] [2018-11-28 20:14:55,765 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:14:55,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:14:55,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1407465811, now seen corresponding path program 1 times [2018-11-28 20:14:55,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:14:55,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:14:55,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:14:55,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:14:55,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:14:55,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:14:55,920 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:14:55,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:14:55,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:14:55,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:14:55,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:14:55,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:14:55,922 INFO L87 Difference]: Start difference. First operand 15792 states and 49060 transitions. Second operand 4 states. [2018-11-28 20:14:56,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:14:56,356 INFO L93 Difference]: Finished difference Result 19959 states and 61084 transitions. [2018-11-28 20:14:56,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 20:14:56,357 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-11-28 20:14:56,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:14:56,401 INFO L225 Difference]: With dead ends: 19959 [2018-11-28 20:14:56,401 INFO L226 Difference]: Without dead ends: 19959 [2018-11-28 20:14:56,402 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:14:56,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19959 states. [2018-11-28 20:14:56,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19959 to 16086. [2018-11-28 20:14:56,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16086 states. [2018-11-28 20:14:56,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16086 states to 16086 states and 49917 transitions. [2018-11-28 20:14:56,735 INFO L78 Accepts]: Start accepts. Automaton has 16086 states and 49917 transitions. Word has length 63 [2018-11-28 20:14:56,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:14:56,736 INFO L480 AbstractCegarLoop]: Abstraction has 16086 states and 49917 transitions. [2018-11-28 20:14:56,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:14:56,742 INFO L276 IsEmpty]: Start isEmpty. Operand 16086 states and 49917 transitions. [2018-11-28 20:14:56,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-28 20:14:56,755 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:14:56,755 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] [2018-11-28 20:14:56,755 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:14:56,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:14:56,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1152729266, now seen corresponding path program 1 times [2018-11-28 20:14:56,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:14:56,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:14:56,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:14:56,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:14:56,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:14:56,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:14:56,845 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:14:56,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:14:56,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 20:14:56,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 20:14:56,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 20:14:56,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:14:56,846 INFO L87 Difference]: Start difference. First operand 16086 states and 49917 transitions. Second operand 3 states. [2018-11-28 20:14:57,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:14:57,117 INFO L93 Difference]: Finished difference Result 16558 states and 51205 transitions. [2018-11-28 20:14:57,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 20:14:57,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-11-28 20:14:57,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:14:57,148 INFO L225 Difference]: With dead ends: 16558 [2018-11-28 20:14:57,148 INFO L226 Difference]: Without dead ends: 16558 [2018-11-28 20:14:57,148 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:14:57,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16558 states. [2018-11-28 20:14:57,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16558 to 16322. [2018-11-28 20:14:57,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16322 states. [2018-11-28 20:14:57,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16322 states to 16322 states and 50541 transitions. [2018-11-28 20:14:57,659 INFO L78 Accepts]: Start accepts. Automaton has 16322 states and 50541 transitions. Word has length 63 [2018-11-28 20:14:57,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:14:57,660 INFO L480 AbstractCegarLoop]: Abstraction has 16322 states and 50541 transitions. [2018-11-28 20:14:57,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 20:14:57,660 INFO L276 IsEmpty]: Start isEmpty. Operand 16322 states and 50541 transitions. [2018-11-28 20:14:57,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-28 20:14:57,671 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:14:57,671 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:14:57,672 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:14:57,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:14:57,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1952113636, now seen corresponding path program 1 times [2018-11-28 20:14:57,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:14:57,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:14:57,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:14:57,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:14:57,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:14:57,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:14:57,937 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:14:57,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:14:57,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:14:57,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:14:57,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:14:57,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:14:57,939 INFO L87 Difference]: Start difference. First operand 16322 states and 50541 transitions. Second operand 6 states. [2018-11-28 20:14:58,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:14:58,585 INFO L93 Difference]: Finished difference Result 17646 states and 53545 transitions. [2018-11-28 20:14:58,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 20:14:58,586 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2018-11-28 20:14:58,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:14:58,619 INFO L225 Difference]: With dead ends: 17646 [2018-11-28 20:14:58,619 INFO L226 Difference]: Without dead ends: 17646 [2018-11-28 20:14:58,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-28 20:14:58,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17646 states. [2018-11-28 20:14:58,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17646 to 16546. [2018-11-28 20:14:58,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16546 states. [2018-11-28 20:14:58,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16546 states to 16546 states and 50764 transitions. [2018-11-28 20:14:58,868 INFO L78 Accepts]: Start accepts. Automaton has 16546 states and 50764 transitions. Word has length 65 [2018-11-28 20:14:58,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:14:58,868 INFO L480 AbstractCegarLoop]: Abstraction has 16546 states and 50764 transitions. [2018-11-28 20:14:58,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:14:58,868 INFO L276 IsEmpty]: Start isEmpty. Operand 16546 states and 50764 transitions. [2018-11-28 20:14:58,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-28 20:14:58,878 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:14:58,878 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] [2018-11-28 20:14:58,878 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:14:58,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:14:58,878 INFO L82 PathProgramCache]: Analyzing trace with hash -707349155, now seen corresponding path program 1 times [2018-11-28 20:14:58,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:14:58,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:14:58,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:14:58,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:14:58,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:14:58,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:14:59,224 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:14:59,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:14:59,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:14:59,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:14:59,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:14:59,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:14:59,226 INFO L87 Difference]: Start difference. First operand 16546 states and 50764 transitions. Second operand 5 states. [2018-11-28 20:15:00,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:00,086 INFO L93 Difference]: Finished difference Result 21334 states and 64873 transitions. [2018-11-28 20:15:00,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:15:00,087 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-11-28 20:15:00,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:00,122 INFO L225 Difference]: With dead ends: 21334 [2018-11-28 20:15:00,122 INFO L226 Difference]: Without dead ends: 21334 [2018-11-28 20:15:00,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:15:00,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21334 states. [2018-11-28 20:15:00,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21334 to 19570. [2018-11-28 20:15:00,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19570 states. [2018-11-28 20:15:00,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19570 states to 19570 states and 59494 transitions. [2018-11-28 20:15:00,434 INFO L78 Accepts]: Start accepts. Automaton has 19570 states and 59494 transitions. Word has length 65 [2018-11-28 20:15:00,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:00,434 INFO L480 AbstractCegarLoop]: Abstraction has 19570 states and 59494 transitions. [2018-11-28 20:15:00,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:15:00,434 INFO L276 IsEmpty]: Start isEmpty. Operand 19570 states and 59494 transitions. [2018-11-28 20:15:00,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-28 20:15:00,445 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:00,445 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] [2018-11-28 20:15:00,446 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:00,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:00,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1217883332, now seen corresponding path program 1 times [2018-11-28 20:15:00,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:00,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:00,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:00,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:00,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:00,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:00,866 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:15:00,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:00,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:15:00,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:15:00,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:15:00,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:15:00,869 INFO L87 Difference]: Start difference. First operand 19570 states and 59494 transitions. Second operand 5 states. [2018-11-28 20:15:01,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:01,513 INFO L93 Difference]: Finished difference Result 30156 states and 90237 transitions. [2018-11-28 20:15:01,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 20:15:01,514 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-11-28 20:15:01,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:01,561 INFO L225 Difference]: With dead ends: 30156 [2018-11-28 20:15:01,561 INFO L226 Difference]: Without dead ends: 30156 [2018-11-28 20:15:01,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 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:15:01,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30156 states. [2018-11-28 20:15:01,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30156 to 26760. [2018-11-28 20:15:01,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26760 states. [2018-11-28 20:15:02,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26760 states to 26760 states and 80370 transitions. [2018-11-28 20:15:02,044 INFO L78 Accepts]: Start accepts. Automaton has 26760 states and 80370 transitions. Word has length 65 [2018-11-28 20:15:02,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:02,045 INFO L480 AbstractCegarLoop]: Abstraction has 26760 states and 80370 transitions. [2018-11-28 20:15:02,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:15:02,045 INFO L276 IsEmpty]: Start isEmpty. Operand 26760 states and 80370 transitions. [2018-11-28 20:15:02,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-28 20:15:02,060 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:02,061 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] [2018-11-28 20:15:02,061 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:02,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:02,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1269629501, now seen corresponding path program 1 times [2018-11-28 20:15:02,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:02,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:02,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:02,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:02,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:02,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:02,296 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:15:02,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:02,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:15:02,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:15:02,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:15:02,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:15:02,298 INFO L87 Difference]: Start difference. First operand 26760 states and 80370 transitions. Second operand 5 states. [2018-11-28 20:15:02,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:02,412 INFO L93 Difference]: Finished difference Result 8084 states and 19691 transitions. [2018-11-28 20:15:02,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 20:15:02,413 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-11-28 20:15:02,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:02,422 INFO L225 Difference]: With dead ends: 8084 [2018-11-28 20:15:02,422 INFO L226 Difference]: Without dead ends: 6316 [2018-11-28 20:15:02,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:15:02,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6316 states. [2018-11-28 20:15:02,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6316 to 4889. [2018-11-28 20:15:02,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4889 states. [2018-11-28 20:15:02,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4889 states to 4889 states and 11646 transitions. [2018-11-28 20:15:02,498 INFO L78 Accepts]: Start accepts. Automaton has 4889 states and 11646 transitions. Word has length 65 [2018-11-28 20:15:02,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:02,499 INFO L480 AbstractCegarLoop]: Abstraction has 4889 states and 11646 transitions. [2018-11-28 20:15:02,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:15:02,499 INFO L276 IsEmpty]: Start isEmpty. Operand 4889 states and 11646 transitions. [2018-11-28 20:15:02,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-28 20:15:02,504 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:02,505 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] [2018-11-28 20:15:02,505 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:02,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:02,505 INFO L82 PathProgramCache]: Analyzing trace with hash -2026999384, now seen corresponding path program 1 times [2018-11-28 20:15:02,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:02,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:02,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:02,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:02,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:02,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:02,597 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:15:02,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:02,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 20:15:02,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 20:15:02,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 20:15:02,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:15:02,598 INFO L87 Difference]: Start difference. First operand 4889 states and 11646 transitions. Second operand 3 states. [2018-11-28 20:15:02,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:02,707 INFO L93 Difference]: Finished difference Result 6692 states and 15894 transitions. [2018-11-28 20:15:02,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 20:15:02,708 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-11-28 20:15:02,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:02,718 INFO L225 Difference]: With dead ends: 6692 [2018-11-28 20:15:02,718 INFO L226 Difference]: Without dead ends: 6692 [2018-11-28 20:15:02,719 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:15:02,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6692 states. [2018-11-28 20:15:02,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6692 to 4832. [2018-11-28 20:15:02,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4832 states. [2018-11-28 20:15:02,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4832 states to 4832 states and 11279 transitions. [2018-11-28 20:15:02,803 INFO L78 Accepts]: Start accepts. Automaton has 4832 states and 11279 transitions. Word has length 65 [2018-11-28 20:15:02,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:02,803 INFO L480 AbstractCegarLoop]: Abstraction has 4832 states and 11279 transitions. [2018-11-28 20:15:02,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 20:15:02,803 INFO L276 IsEmpty]: Start isEmpty. Operand 4832 states and 11279 transitions. [2018-11-28 20:15:02,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-28 20:15:02,810 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:02,810 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] [2018-11-28 20:15:02,811 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:02,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:02,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1343049765, now seen corresponding path program 1 times [2018-11-28 20:15:02,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:02,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:02,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:02,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:02,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:02,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:02,993 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:15:02,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:02,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:15:02,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:15:02,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:15:02,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:15:02,995 INFO L87 Difference]: Start difference. First operand 4832 states and 11279 transitions. Second operand 5 states. [2018-11-28 20:15:03,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:03,221 INFO L93 Difference]: Finished difference Result 5855 states and 13632 transitions. [2018-11-28 20:15:03,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 20:15:03,223 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2018-11-28 20:15:03,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:03,232 INFO L225 Difference]: With dead ends: 5855 [2018-11-28 20:15:03,233 INFO L226 Difference]: Without dead ends: 5855 [2018-11-28 20:15:03,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-28 20:15:03,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5855 states. [2018-11-28 20:15:03,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5855 to 5224. [2018-11-28 20:15:03,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5224 states. [2018-11-28 20:15:03,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5224 states to 5224 states and 12180 transitions. [2018-11-28 20:15:03,414 INFO L78 Accepts]: Start accepts. Automaton has 5224 states and 12180 transitions. Word has length 71 [2018-11-28 20:15:03,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:03,414 INFO L480 AbstractCegarLoop]: Abstraction has 5224 states and 12180 transitions. [2018-11-28 20:15:03,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:15:03,414 INFO L276 IsEmpty]: Start isEmpty. Operand 5224 states and 12180 transitions. [2018-11-28 20:15:03,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-28 20:15:03,421 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:03,421 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] [2018-11-28 20:15:03,422 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:03,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:03,422 INFO L82 PathProgramCache]: Analyzing trace with hash 399760570, now seen corresponding path program 1 times [2018-11-28 20:15:03,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:03,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:03,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:03,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:03,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:03,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:03,675 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-28 20:15:03,872 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:15:03,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:03,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 20:15:03,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 20:15:03,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 20:15:03,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-28 20:15:03,874 INFO L87 Difference]: Start difference. First operand 5224 states and 12180 transitions. Second operand 9 states. [2018-11-28 20:15:04,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:04,673 INFO L93 Difference]: Finished difference Result 7087 states and 16418 transitions. [2018-11-28 20:15:04,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-28 20:15:04,675 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 71 [2018-11-28 20:15:04,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:04,684 INFO L225 Difference]: With dead ends: 7087 [2018-11-28 20:15:04,684 INFO L226 Difference]: Without dead ends: 7032 [2018-11-28 20:15:04,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-11-28 20:15:04,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7032 states. [2018-11-28 20:15:04,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7032 to 5292. [2018-11-28 20:15:04,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5292 states. [2018-11-28 20:15:04,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5292 states to 5292 states and 12246 transitions. [2018-11-28 20:15:04,752 INFO L78 Accepts]: Start accepts. Automaton has 5292 states and 12246 transitions. Word has length 71 [2018-11-28 20:15:04,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:04,752 INFO L480 AbstractCegarLoop]: Abstraction has 5292 states and 12246 transitions. [2018-11-28 20:15:04,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 20:15:04,752 INFO L276 IsEmpty]: Start isEmpty. Operand 5292 states and 12246 transitions. [2018-11-28 20:15:04,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-28 20:15:04,760 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:04,761 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:04,761 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:04,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:04,761 INFO L82 PathProgramCache]: Analyzing trace with hash -2052149765, now seen corresponding path program 1 times [2018-11-28 20:15:04,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:04,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:04,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:04,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:04,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:04,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:04,915 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:15:04,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:04,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 20:15:04,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 20:15:04,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 20:15:04,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:15:04,916 INFO L87 Difference]: Start difference. First operand 5292 states and 12246 transitions. Second operand 3 states. [2018-11-28 20:15:05,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:05,458 INFO L93 Difference]: Finished difference Result 7021 states and 15768 transitions. [2018-11-28 20:15:05,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 20:15:05,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2018-11-28 20:15:05,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:05,469 INFO L225 Difference]: With dead ends: 7021 [2018-11-28 20:15:05,469 INFO L226 Difference]: Without dead ends: 6693 [2018-11-28 20:15:05,469 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:15:05,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6693 states. [2018-11-28 20:15:05,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6693 to 6163. [2018-11-28 20:15:05,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6163 states. [2018-11-28 20:15:05,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6163 states to 6163 states and 14048 transitions. [2018-11-28 20:15:05,543 INFO L78 Accepts]: Start accepts. Automaton has 6163 states and 14048 transitions. Word has length 90 [2018-11-28 20:15:05,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:05,544 INFO L480 AbstractCegarLoop]: Abstraction has 6163 states and 14048 transitions. [2018-11-28 20:15:05,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 20:15:05,544 INFO L276 IsEmpty]: Start isEmpty. Operand 6163 states and 14048 transitions. [2018-11-28 20:15:05,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-28 20:15:05,551 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:05,552 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:15:05,552 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:05,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:05,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1511204534, now seen corresponding path program 1 times [2018-11-28 20:15:05,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:05,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:05,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:05,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:05,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:05,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:05,651 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:15:05,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:05,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:15:05,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:15:05,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:15:05,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:15:05,653 INFO L87 Difference]: Start difference. First operand 6163 states and 14048 transitions. Second operand 4 states. [2018-11-28 20:15:05,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:05,778 INFO L93 Difference]: Finished difference Result 6551 states and 14955 transitions. [2018-11-28 20:15:05,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 20:15:05,779 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2018-11-28 20:15:05,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:05,785 INFO L225 Difference]: With dead ends: 6551 [2018-11-28 20:15:05,786 INFO L226 Difference]: Without dead ends: 6551 [2018-11-28 20:15:05,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:15:05,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6551 states. [2018-11-28 20:15:05,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6551 to 6087. [2018-11-28 20:15:05,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6087 states. [2018-11-28 20:15:05,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6087 states to 6087 states and 13961 transitions. [2018-11-28 20:15:05,848 INFO L78 Accepts]: Start accepts. Automaton has 6087 states and 13961 transitions. Word has length 90 [2018-11-28 20:15:05,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:05,849 INFO L480 AbstractCegarLoop]: Abstraction has 6087 states and 13961 transitions. [2018-11-28 20:15:05,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:15:05,849 INFO L276 IsEmpty]: Start isEmpty. Operand 6087 states and 13961 transitions. [2018-11-28 20:15:05,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-28 20:15:05,855 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:05,856 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:15:05,856 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:05,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:05,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1808901631, now seen corresponding path program 1 times [2018-11-28 20:15:05,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:05,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:05,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:05,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:05,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:05,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:06,066 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:15:06,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:06,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:15:06,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:15:06,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:15:06,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:15:06,068 INFO L87 Difference]: Start difference. First operand 6087 states and 13961 transitions. Second operand 5 states. [2018-11-28 20:15:06,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:06,202 INFO L93 Difference]: Finished difference Result 7052 states and 16062 transitions. [2018-11-28 20:15:06,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 20:15:06,202 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2018-11-28 20:15:06,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:06,211 INFO L225 Difference]: With dead ends: 7052 [2018-11-28 20:15:06,211 INFO L226 Difference]: Without dead ends: 7052 [2018-11-28 20:15:06,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 20:15:06,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7052 states. [2018-11-28 20:15:06,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7052 to 5452. [2018-11-28 20:15:06,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5452 states. [2018-11-28 20:15:06,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5452 states to 5452 states and 12506 transitions. [2018-11-28 20:15:06,278 INFO L78 Accepts]: Start accepts. Automaton has 5452 states and 12506 transitions. Word has length 92 [2018-11-28 20:15:06,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:06,279 INFO L480 AbstractCegarLoop]: Abstraction has 5452 states and 12506 transitions. [2018-11-28 20:15:06,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:15:06,279 INFO L276 IsEmpty]: Start isEmpty. Operand 5452 states and 12506 transitions. [2018-11-28 20:15:06,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-28 20:15:06,285 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:06,285 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:15:06,286 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:06,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:06,286 INFO L82 PathProgramCache]: Analyzing trace with hash -2063638176, now seen corresponding path program 1 times [2018-11-28 20:15:06,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:06,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:06,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:06,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:06,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:06,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:06,518 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:15:06,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:06,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:15:06,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:15:06,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:15:06,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:15:06,519 INFO L87 Difference]: Start difference. First operand 5452 states and 12506 transitions. Second operand 5 states. [2018-11-28 20:15:07,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:07,058 INFO L93 Difference]: Finished difference Result 9104 states and 21056 transitions. [2018-11-28 20:15:07,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 20:15:07,059 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2018-11-28 20:15:07,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:07,073 INFO L225 Difference]: With dead ends: 9104 [2018-11-28 20:15:07,074 INFO L226 Difference]: Without dead ends: 9088 [2018-11-28 20:15:07,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-28 20:15:07,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9088 states. [2018-11-28 20:15:07,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9088 to 6276. [2018-11-28 20:15:07,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6276 states. [2018-11-28 20:15:07,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6276 states to 6276 states and 14440 transitions. [2018-11-28 20:15:07,166 INFO L78 Accepts]: Start accepts. Automaton has 6276 states and 14440 transitions. Word has length 92 [2018-11-28 20:15:07,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:07,166 INFO L480 AbstractCegarLoop]: Abstraction has 6276 states and 14440 transitions. [2018-11-28 20:15:07,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:15:07,167 INFO L276 IsEmpty]: Start isEmpty. Operand 6276 states and 14440 transitions. [2018-11-28 20:15:07,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-28 20:15:07,175 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:07,175 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:15:07,175 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:07,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:07,176 INFO L82 PathProgramCache]: Analyzing trace with hash -818873695, now seen corresponding path program 1 times [2018-11-28 20:15:07,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:07,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:07,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:07,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:07,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:07,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:07,313 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:15:07,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:07,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 20:15:07,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 20:15:07,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 20:15:07,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:15:07,314 INFO L87 Difference]: Start difference. First operand 6276 states and 14440 transitions. Second operand 6 states. [2018-11-28 20:15:07,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:07,734 INFO L93 Difference]: Finished difference Result 8414 states and 19086 transitions. [2018-11-28 20:15:07,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 20:15:07,736 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2018-11-28 20:15:07,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:07,747 INFO L225 Difference]: With dead ends: 8414 [2018-11-28 20:15:07,747 INFO L226 Difference]: Without dead ends: 8414 [2018-11-28 20:15:07,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-11-28 20:15:07,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8414 states. [2018-11-28 20:15:07,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8414 to 6415. [2018-11-28 20:15:07,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6415 states. [2018-11-28 20:15:07,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6415 states to 6415 states and 14631 transitions. [2018-11-28 20:15:07,838 INFO L78 Accepts]: Start accepts. Automaton has 6415 states and 14631 transitions. Word has length 92 [2018-11-28 20:15:07,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:07,838 INFO L480 AbstractCegarLoop]: Abstraction has 6415 states and 14631 transitions. [2018-11-28 20:15:07,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 20:15:07,838 INFO L276 IsEmpty]: Start isEmpty. Operand 6415 states and 14631 transitions. [2018-11-28 20:15:07,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-28 20:15:07,850 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:07,850 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:15:07,851 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:07,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:07,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1620714257, now seen corresponding path program 1 times [2018-11-28 20:15:07,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:07,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:07,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:07,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:07,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:07,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:08,198 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:15:08,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:08,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 20:15:08,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 20:15:08,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 20:15:08,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:15:08,200 INFO L87 Difference]: Start difference. First operand 6415 states and 14631 transitions. Second operand 8 states. [2018-11-28 20:15:08,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:08,638 INFO L93 Difference]: Finished difference Result 10090 states and 22670 transitions. [2018-11-28 20:15:08,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 20:15:08,639 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 92 [2018-11-28 20:15:08,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:08,652 INFO L225 Difference]: With dead ends: 10090 [2018-11-28 20:15:08,652 INFO L226 Difference]: Without dead ends: 10090 [2018-11-28 20:15:08,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-11-28 20:15:08,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10090 states. [2018-11-28 20:15:08,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10090 to 7293. [2018-11-28 20:15:08,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7293 states. [2018-11-28 20:15:08,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7293 states to 7293 states and 16594 transitions. [2018-11-28 20:15:08,755 INFO L78 Accepts]: Start accepts. Automaton has 7293 states and 16594 transitions. Word has length 92 [2018-11-28 20:15:08,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:08,756 INFO L480 AbstractCegarLoop]: Abstraction has 7293 states and 16594 transitions. [2018-11-28 20:15:08,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 20:15:08,756 INFO L276 IsEmpty]: Start isEmpty. Operand 7293 states and 16594 transitions. [2018-11-28 20:15:08,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-28 20:15:08,764 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:08,765 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:15:08,765 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:08,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:08,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1344853488, now seen corresponding path program 1 times [2018-11-28 20:15:08,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:08,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:08,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:08,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:08,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:08,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:08,944 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:15:08,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:08,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 20:15:08,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 20:15:08,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 20:15:08,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-28 20:15:08,945 INFO L87 Difference]: Start difference. First operand 7293 states and 16594 transitions. Second operand 9 states. [2018-11-28 20:15:09,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:09,772 INFO L93 Difference]: Finished difference Result 10558 states and 23992 transitions. [2018-11-28 20:15:09,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-28 20:15:09,774 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 92 [2018-11-28 20:15:09,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:09,787 INFO L225 Difference]: With dead ends: 10558 [2018-11-28 20:15:09,788 INFO L226 Difference]: Without dead ends: 10526 [2018-11-28 20:15:09,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-11-28 20:15:09,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10526 states. [2018-11-28 20:15:09,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10526 to 9413. [2018-11-28 20:15:09,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9413 states. [2018-11-28 20:15:09,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9413 states to 9413 states and 21423 transitions. [2018-11-28 20:15:09,907 INFO L78 Accepts]: Start accepts. Automaton has 9413 states and 21423 transitions. Word has length 92 [2018-11-28 20:15:09,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:09,907 INFO L480 AbstractCegarLoop]: Abstraction has 9413 states and 21423 transitions. [2018-11-28 20:15:09,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 20:15:09,907 INFO L276 IsEmpty]: Start isEmpty. Operand 9413 states and 21423 transitions. [2018-11-28 20:15:09,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-28 20:15:09,919 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:09,919 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:09,920 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:09,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:09,920 INFO L82 PathProgramCache]: Analyzing trace with hash -452097871, now seen corresponding path program 1 times [2018-11-28 20:15:09,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:09,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:09,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:09,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:09,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:09,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:10,052 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:15:10,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:10,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 20:15:10,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 20:15:10,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 20:15:10,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-28 20:15:10,053 INFO L87 Difference]: Start difference. First operand 9413 states and 21423 transitions. Second operand 8 states. [2018-11-28 20:15:11,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:11,524 INFO L93 Difference]: Finished difference Result 14313 states and 33272 transitions. [2018-11-28 20:15:11,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 20:15:11,526 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 92 [2018-11-28 20:15:11,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:11,544 INFO L225 Difference]: With dead ends: 14313 [2018-11-28 20:15:11,544 INFO L226 Difference]: Without dead ends: 14313 [2018-11-28 20:15:11,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-11-28 20:15:11,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14313 states. [2018-11-28 20:15:11,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14313 to 9971. [2018-11-28 20:15:11,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9971 states. [2018-11-28 20:15:11,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9971 states to 9971 states and 22916 transitions. [2018-11-28 20:15:11,756 INFO L78 Accepts]: Start accepts. Automaton has 9971 states and 22916 transitions. Word has length 92 [2018-11-28 20:15:11,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:11,756 INFO L480 AbstractCegarLoop]: Abstraction has 9971 states and 22916 transitions. [2018-11-28 20:15:11,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 20:15:11,757 INFO L276 IsEmpty]: Start isEmpty. Operand 9971 states and 22916 transitions. [2018-11-28 20:15:11,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-28 20:15:11,772 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:11,772 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:15:11,772 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:11,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:11,772 INFO L82 PathProgramCache]: Analyzing trace with hash 435405810, now seen corresponding path program 1 times [2018-11-28 20:15:11,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:11,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:11,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:11,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:11,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:11,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:11,920 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:15:11,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:11,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 20:15:11,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 20:15:11,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 20:15:11,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:15:11,923 INFO L87 Difference]: Start difference. First operand 9971 states and 22916 transitions. Second operand 3 states. [2018-11-28 20:15:11,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:11,973 INFO L93 Difference]: Finished difference Result 9715 states and 22100 transitions. [2018-11-28 20:15:11,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 20:15:11,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2018-11-28 20:15:11,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:11,987 INFO L225 Difference]: With dead ends: 9715 [2018-11-28 20:15:11,987 INFO L226 Difference]: Without dead ends: 9683 [2018-11-28 20:15:11,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 20:15:12,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9683 states. [2018-11-28 20:15:12,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9683 to 7662. [2018-11-28 20:15:12,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7662 states. [2018-11-28 20:15:12,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7662 states to 7662 states and 17304 transitions. [2018-11-28 20:15:12,090 INFO L78 Accepts]: Start accepts. Automaton has 7662 states and 17304 transitions. Word has length 92 [2018-11-28 20:15:12,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:12,090 INFO L480 AbstractCegarLoop]: Abstraction has 7662 states and 17304 transitions. [2018-11-28 20:15:12,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 20:15:12,090 INFO L276 IsEmpty]: Start isEmpty. Operand 7662 states and 17304 transitions. [2018-11-28 20:15:12,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-28 20:15:12,099 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:12,100 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:15:12,100 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:12,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:12,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1410010744, now seen corresponding path program 1 times [2018-11-28 20:15:12,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:12,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:12,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:12,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:12,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:12,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:12,337 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:15:12,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:12,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 20:15:12,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 20:15:12,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 20:15:12,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 20:15:12,339 INFO L87 Difference]: Start difference. First operand 7662 states and 17304 transitions. Second operand 4 states. [2018-11-28 20:15:12,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:12,722 INFO L93 Difference]: Finished difference Result 8647 states and 19331 transitions. [2018-11-28 20:15:12,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:15:12,724 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-11-28 20:15:12,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:12,734 INFO L225 Difference]: With dead ends: 8647 [2018-11-28 20:15:12,734 INFO L226 Difference]: Without dead ends: 8531 [2018-11-28 20:15:12,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:15:12,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8531 states. [2018-11-28 20:15:12,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8531 to 7965. [2018-11-28 20:15:12,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7965 states. [2018-11-28 20:15:12,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7965 states to 7965 states and 17865 transitions. [2018-11-28 20:15:12,831 INFO L78 Accepts]: Start accepts. Automaton has 7965 states and 17865 transitions. Word has length 94 [2018-11-28 20:15:12,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:12,831 INFO L480 AbstractCegarLoop]: Abstraction has 7965 states and 17865 transitions. [2018-11-28 20:15:12,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 20:15:12,831 INFO L276 IsEmpty]: Start isEmpty. Operand 7965 states and 17865 transitions. [2018-11-28 20:15:12,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-28 20:15:12,840 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:12,841 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:15:12,841 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:12,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:12,841 INFO L82 PathProgramCache]: Analyzing trace with hash 596396296, now seen corresponding path program 1 times [2018-11-28 20:15:12,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:12,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:12,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:12,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:12,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:12,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:14,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:15:14,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:14,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 20:15:14,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 20:15:14,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 20:15:14,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-28 20:15:14,122 INFO L87 Difference]: Start difference. First operand 7965 states and 17865 transitions. Second operand 9 states. [2018-11-28 20:15:15,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:15,042 INFO L93 Difference]: Finished difference Result 9894 states and 21848 transitions. [2018-11-28 20:15:15,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-28 20:15:15,044 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2018-11-28 20:15:15,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:15,056 INFO L225 Difference]: With dead ends: 9894 [2018-11-28 20:15:15,056 INFO L226 Difference]: Without dead ends: 9894 [2018-11-28 20:15:15,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2018-11-28 20:15:15,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9894 states. [2018-11-28 20:15:15,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9894 to 8424. [2018-11-28 20:15:15,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8424 states. [2018-11-28 20:15:15,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8424 states to 8424 states and 18820 transitions. [2018-11-28 20:15:15,162 INFO L78 Accepts]: Start accepts. Automaton has 8424 states and 18820 transitions. Word has length 94 [2018-11-28 20:15:15,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:15,162 INFO L480 AbstractCegarLoop]: Abstraction has 8424 states and 18820 transitions. [2018-11-28 20:15:15,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 20:15:15,162 INFO L276 IsEmpty]: Start isEmpty. Operand 8424 states and 18820 transitions. [2018-11-28 20:15:15,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-28 20:15:15,173 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:15,174 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:15:15,174 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:15,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:15,174 INFO L82 PathProgramCache]: Analyzing trace with hash 807747209, now seen corresponding path program 1 times [2018-11-28 20:15:15,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:15,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:15,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:15,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:15,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:15,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:15,367 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:15:15,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:15,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 20:15:15,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 20:15:15,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 20:15:15,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 20:15:15,368 INFO L87 Difference]: Start difference. First operand 8424 states and 18820 transitions. Second operand 5 states. [2018-11-28 20:15:15,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:15,434 INFO L93 Difference]: Finished difference Result 8424 states and 18772 transitions. [2018-11-28 20:15:15,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 20:15:15,435 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-11-28 20:15:15,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:15,447 INFO L225 Difference]: With dead ends: 8424 [2018-11-28 20:15:15,447 INFO L226 Difference]: Without dead ends: 8424 [2018-11-28 20:15:15,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-28 20:15:15,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8424 states. [2018-11-28 20:15:15,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8424 to 6247. [2018-11-28 20:15:15,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6247 states. [2018-11-28 20:15:15,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6247 states to 6247 states and 13931 transitions. [2018-11-28 20:15:15,535 INFO L78 Accepts]: Start accepts. Automaton has 6247 states and 13931 transitions. Word has length 94 [2018-11-28 20:15:15,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:15,535 INFO L480 AbstractCegarLoop]: Abstraction has 6247 states and 13931 transitions. [2018-11-28 20:15:15,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 20:15:15,536 INFO L276 IsEmpty]: Start isEmpty. Operand 6247 states and 13931 transitions. [2018-11-28 20:15:15,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-28 20:15:15,543 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:15,543 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:15:15,543 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:15,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:15,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1695250890, now seen corresponding path program 1 times [2018-11-28 20:15:15,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:15,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:15,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:15,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:15,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:15,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 20:15:15,834 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-28 20:15:15,992 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:15:15,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 20:15:15,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 20:15:15,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 20:15:15,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 20:15:15,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-28 20:15:15,993 INFO L87 Difference]: Start difference. First operand 6247 states and 13931 transitions. Second operand 11 states. [2018-11-28 20:15:17,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 20:15:17,824 INFO L93 Difference]: Finished difference Result 12519 states and 28054 transitions. [2018-11-28 20:15:17,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-28 20:15:17,826 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 94 [2018-11-28 20:15:17,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 20:15:17,838 INFO L225 Difference]: With dead ends: 12519 [2018-11-28 20:15:17,839 INFO L226 Difference]: Without dead ends: 8876 [2018-11-28 20:15:17,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-11-28 20:15:17,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8876 states. [2018-11-28 20:15:17,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8876 to 6300. [2018-11-28 20:15:17,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6300 states. [2018-11-28 20:15:17,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6300 states to 6300 states and 13964 transitions. [2018-11-28 20:15:17,933 INFO L78 Accepts]: Start accepts. Automaton has 6300 states and 13964 transitions. Word has length 94 [2018-11-28 20:15:17,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 20:15:17,933 INFO L480 AbstractCegarLoop]: Abstraction has 6300 states and 13964 transitions. [2018-11-28 20:15:17,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 20:15:17,933 INFO L276 IsEmpty]: Start isEmpty. Operand 6300 states and 13964 transitions. [2018-11-28 20:15:17,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-28 20:15:17,941 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 20:15:17,942 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 20:15:17,942 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 20:15:17,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 20:15:17,942 INFO L82 PathProgramCache]: Analyzing trace with hash -520452890, now seen corresponding path program 2 times [2018-11-28 20:15:17,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 20:15:17,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 20:15:17,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:17,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 20:15:17,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 20:15:17,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 20:15:17,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 20:15:18,030 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 20:15:18,237 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-11-28 20:15:18,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:15:18 BasicIcfg [2018-11-28 20:15:18,241 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 20:15:18,242 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 20:15:18,242 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 20:15:18,242 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 20:15:18,243 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:14:38" (3/4) ... [2018-11-28 20:15:18,249 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 20:15:18,480 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 20:15:18,481 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 20:15:18,482 INFO L168 Benchmark]: Toolchain (without parser) took 42272.67 ms. Allocated memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: 1.8 GB). Free memory was 952.7 MB in the beginning and 1.4 GB in the end (delta: -474.0 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2018-11-28 20:15:18,483 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 20:15:18,483 INFO L168 Benchmark]: CACSL2BoogieTranslator took 896.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -172.2 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2018-11-28 20:15:18,483 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-11-28 20:15:18,484 INFO L168 Benchmark]: Boogie Preprocessor took 50.19 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 20:15:18,486 INFO L168 Benchmark]: RCFGBuilder took 1334.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.6 MB). Peak memory consumption was 45.6 MB. Max. memory is 11.5 GB. [2018-11-28 20:15:18,487 INFO L168 Benchmark]: TraceAbstraction took 39679.14 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.6 GB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -396.9 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2018-11-28 20:15:18,487 INFO L168 Benchmark]: Witness Printer took 239.03 ms. Allocated memory is still 2.8 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 37.4 MB). Peak memory consumption was 37.4 MB. Max. memory is 11.5 GB. [2018-11-28 20:15:18,491 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 896.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -172.2 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 66.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.19 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1334.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.6 MB). Peak memory consumption was 45.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 39679.14 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.6 GB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -396.9 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 239.03 ms. Allocated memory is still 2.8 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 37.4 MB). Peak memory consumption was 37.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L674] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L675] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L677] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L679] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L680] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L681] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L682] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L683] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L684] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L685] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L686] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L687] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L688] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L689] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L690] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L691] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L692] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L693] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L694] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L695] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L768] -1 pthread_t t1445; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] FCALL, FORK -1 pthread_create(&t1445, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L699] 0 y$w_buff1 = y$w_buff0 [L700] 0 y$w_buff0 = 1 [L701] 0 y$w_buff1_used = y$w_buff0_used [L702] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L704] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L705] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L706] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L707] 0 y$r_buff0_thd1 = (_Bool)1 [L710] 0 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L713] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L770] -1 pthread_t t1446; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L771] FCALL, FORK -1 pthread_create(&t1446, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L727] 1 x = 2 [L730] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L731] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L732] 1 y$flush_delayed = weak$$choice2 [L733] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L734] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L713] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L714] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L734] 1 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L735] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L735] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L736] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L737] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L737] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L738] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L714] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L715] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L715] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L716] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L716] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L717] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L717] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L720] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L739] EXPR 1 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L740] EXPR 1 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L741] 1 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L742] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y = y$flush_delayed ? y$mem_tmp : y [L743] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L746] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L746] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L746] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L746] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L747] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L747] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L748] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L749] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L750] 1 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L773] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L778] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L778] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L779] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L780] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L781] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L784] -1 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 221 locations, 3 error locations. UNSAFE Result, 39.4s OverallTime, 31 OverallIterations, 1 TraceHistogramMax, 20.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7620 SDtfs, 7753 SDslu, 17628 SDs, 0 SdLazy, 7281 SolverSat, 385 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 313 GetRequests, 80 SyntacticMatches, 31 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 7.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34805occurred in iteration=0, 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: 7.8s AutomataMinimizationTime, 30 MinimizatonAttempts, 79291 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 2287 NumberOfCodeBlocks, 2287 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2163 ConstructedInterpolants, 0 QuantifiedInterpolants, 444821 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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...