./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix031_pso.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/mix031_pso.opt_false-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 340d44e6d272edde8a4a60d91a9d70b9dcde31ef ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 19:58:58,410 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 19:58:58,412 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 19:58:58,425 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 19:58:58,425 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 19:58:58,426 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 19:58:58,428 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 19:58:58,430 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 19:58:58,432 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 19:58:58,433 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 19:58:58,434 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 19:58:58,434 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 19:58:58,436 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 19:58:58,437 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 19:58:58,439 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 19:58:58,439 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 19:58:58,440 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 19:58:58,443 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 19:58:58,445 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 19:58:58,447 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 19:58:58,448 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 19:58:58,450 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 19:58:58,453 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 19:58:58,453 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 19:58:58,454 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 19:58:58,455 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 19:58:58,456 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 19:58:58,457 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 19:58:58,458 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 19:58:58,460 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 19:58:58,460 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 19:58:58,461 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 19:58:58,461 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 19:58:58,462 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 19:58:58,463 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 19:58:58,464 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 19:58:58,465 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 19:58:58,481 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 19:58:58,482 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 19:58:58,482 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 19:58:58,483 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 19:58:58,483 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 19:58:58,483 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 19:58:58,484 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 19:58:58,484 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 19:58:58,485 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 19:58:58,485 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 19:58:58,485 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 19:58:58,485 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 19:58:58,485 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 19:58:58,486 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 19:58:58,487 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 19:58:58,487 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 19:58:58,487 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 19:58:58,487 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 19:58:58,487 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 19:58:58,487 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 19:58:58,488 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 19:58:58,488 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 19:58:58,488 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 19:58:58,488 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 19:58:58,488 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 19:58:58,488 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 19:58:58,490 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 19:58:58,490 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 19:58:58,490 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 19:58:58,491 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 19:58:58,491 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 -> 340d44e6d272edde8a4a60d91a9d70b9dcde31ef [2018-11-28 19:58:58,547 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 19:58:58,561 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 19:58:58,565 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 19:58:58,567 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 19:58:58,567 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 19:58:58,568 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix031_pso.opt_false-unreach-call.i [2018-11-28 19:58:58,630 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dd7e498c/da1911ac12fe400d90c14fecdefd94db/FLAG701d13ca4 [2018-11-28 19:58:59,250 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 19:58:59,251 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix031_pso.opt_false-unreach-call.i [2018-11-28 19:58:59,282 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dd7e498c/da1911ac12fe400d90c14fecdefd94db/FLAG701d13ca4 [2018-11-28 19:58:59,483 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dd7e498c/da1911ac12fe400d90c14fecdefd94db [2018-11-28 19:58:59,487 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 19:58:59,489 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 19:58:59,491 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 19:58:59,491 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 19:58:59,496 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 19:58:59,497 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 07:58:59" (1/1) ... [2018-11-28 19:58:59,500 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c7a5556 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:58:59, skipping insertion in model container [2018-11-28 19:58:59,502 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 07:58:59" (1/1) ... [2018-11-28 19:58:59,511 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 19:58:59,586 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 19:59:00,037 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 19:59:00,057 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 19:59:00,268 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 19:59:00,370 INFO L195 MainTranslator]: Completed translation [2018-11-28 19:59:00,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:59:00 WrapperNode [2018-11-28 19:59:00,370 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 19:59:00,372 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 19:59:00,372 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 19:59:00,372 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 19:59:00,383 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:59:00" (1/1) ... [2018-11-28 19:59:00,408 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:59:00" (1/1) ... [2018-11-28 19:59:00,448 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 19:59:00,449 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 19:59:00,449 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 19:59:00,449 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 19:59:00,459 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:59:00" (1/1) ... [2018-11-28 19:59:00,459 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:59:00" (1/1) ... [2018-11-28 19:59:00,464 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:59:00" (1/1) ... [2018-11-28 19:59:00,464 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:59:00" (1/1) ... [2018-11-28 19:59:00,474 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:59:00" (1/1) ... [2018-11-28 19:59:00,479 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:59:00" (1/1) ... [2018-11-28 19:59:00,483 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:59:00" (1/1) ... [2018-11-28 19:59:00,488 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 19:59:00,489 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 19:59:00,489 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 19:59:00,490 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 19:59:00,491 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:59:00" (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 19:59:00,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 19:59:00,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 19:59:00,570 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-11-28 19:59:00,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 19:59:00,570 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-11-28 19:59:00,570 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-11-28 19:59:00,570 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-11-28 19:59:00,571 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-11-28 19:59:00,571 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-11-28 19:59:00,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 19:59:00,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 19:59:00,573 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 19:59:01,619 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 19:59:01,620 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 19:59:01,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 07:59:01 BoogieIcfgContainer [2018-11-28 19:59:01,620 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 19:59:01,624 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 19:59:01,624 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 19:59:01,627 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 19:59:01,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 07:58:59" (1/3) ... [2018-11-28 19:59:01,628 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@462a61fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 07:59:01, skipping insertion in model container [2018-11-28 19:59:01,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:59:00" (2/3) ... [2018-11-28 19:59:01,628 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@462a61fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 07:59:01, skipping insertion in model container [2018-11-28 19:59:01,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 07:59:01" (3/3) ... [2018-11-28 19:59:01,631 INFO L112 eAbstractionObserver]: Analyzing ICFG mix031_pso.opt_false-unreach-call.i [2018-11-28 19:59:01,678 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,679 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,679 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,679 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,679 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,680 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,680 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,680 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,680 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,682 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,682 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,682 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,682 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,683 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,683 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,683 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,683 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,685 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,685 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,685 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,685 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,686 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,687 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,687 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,687 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,687 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,687 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,688 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,688 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,688 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,688 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,688 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,690 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,690 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,691 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,691 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,691 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,691 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,692 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,692 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,692 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,692 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,692 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,693 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,693 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,693 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,693 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,693 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,694 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,694 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,694 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,694 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,694 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,695 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,695 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,695 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,695 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,696 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,696 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,696 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,696 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,697 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,697 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,697 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,697 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,697 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,700 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,700 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,700 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,701 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,701 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,701 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,701 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,702 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,703 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,703 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,703 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,704 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,704 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,705 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,705 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,705 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,705 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,706 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,706 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,706 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,706 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,706 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,708 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,708 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,709 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,709 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,709 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,710 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,710 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,711 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,711 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,711 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,712 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,713 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,713 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,713 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,713 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,713 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,714 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,714 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,714 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,714 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,716 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,716 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,717 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,717 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,717 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,718 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,718 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,718 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,718 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,718 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,719 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,719 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,719 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,719 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,720 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,722 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,722 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,722 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,722 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,723 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,724 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,724 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,724 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,724 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,724 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,724 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,725 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,725 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 19:59:01,755 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-11-28 19:59:01,756 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 19:59:01,767 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-28 19:59:01,787 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-28 19:59:01,812 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 19:59:01,813 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 19:59:01,813 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 19:59:01,813 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 19:59:01,813 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 19:59:01,814 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 19:59:01,814 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 19:59:01,814 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 19:59:01,814 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 19:59:01,828 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 134places, 166 transitions [2018-11-28 19:59:03,707 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27858 states. [2018-11-28 19:59:03,710 INFO L276 IsEmpty]: Start isEmpty. Operand 27858 states. [2018-11-28 19:59:03,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-28 19:59:03,721 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:59:03,722 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] [2018-11-28 19:59:03,726 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:59:03,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:59:03,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1858856236, now seen corresponding path program 1 times [2018-11-28 19:59:03,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:59:03,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:59:03,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:03,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:59:03,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:03,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:59:04,071 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 19:59:04,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:59:04,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 19:59:04,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 19:59:04,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 19:59:04,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 19:59:04,097 INFO L87 Difference]: Start difference. First operand 27858 states. Second operand 4 states. [2018-11-28 19:59:05,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:59:05,243 INFO L93 Difference]: Finished difference Result 47770 states and 183121 transitions. [2018-11-28 19:59:05,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 19:59:05,245 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-11-28 19:59:05,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:59:05,584 INFO L225 Difference]: With dead ends: 47770 [2018-11-28 19:59:05,584 INFO L226 Difference]: Without dead ends: 34610 [2018-11-28 19:59:05,587 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 19:59:06,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34610 states. [2018-11-28 19:59:07,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34610 to 21758. [2018-11-28 19:59:07,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21758 states. [2018-11-28 19:59:07,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21758 states to 21758 states and 83443 transitions. [2018-11-28 19:59:07,307 INFO L78 Accepts]: Start accepts. Automaton has 21758 states and 83443 transitions. Word has length 41 [2018-11-28 19:59:07,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:59:07,310 INFO L480 AbstractCegarLoop]: Abstraction has 21758 states and 83443 transitions. [2018-11-28 19:59:07,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 19:59:07,310 INFO L276 IsEmpty]: Start isEmpty. Operand 21758 states and 83443 transitions. [2018-11-28 19:59:07,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-28 19:59:07,333 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:59:07,333 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] [2018-11-28 19:59:07,334 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:59:07,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:59:07,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1910881222, now seen corresponding path program 1 times [2018-11-28 19:59:07,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:59:07,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:59:07,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:07,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:59:07,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:07,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:59:07,605 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 19:59:07,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:59:07,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 19:59:07,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 19:59:07,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 19:59:07,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 19:59:07,612 INFO L87 Difference]: Start difference. First operand 21758 states and 83443 transitions. Second operand 4 states. [2018-11-28 19:59:08,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:59:08,006 INFO L93 Difference]: Finished difference Result 7172 states and 23628 transitions. [2018-11-28 19:59:08,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 19:59:08,007 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-11-28 19:59:08,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:59:08,034 INFO L225 Difference]: With dead ends: 7172 [2018-11-28 19:59:08,034 INFO L226 Difference]: Without dead ends: 6326 [2018-11-28 19:59:08,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 19:59:08,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6326 states. [2018-11-28 19:59:08,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6326 to 6326. [2018-11-28 19:59:08,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6326 states. [2018-11-28 19:59:08,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6326 states to 6326 states and 20700 transitions. [2018-11-28 19:59:08,240 INFO L78 Accepts]: Start accepts. Automaton has 6326 states and 20700 transitions. Word has length 49 [2018-11-28 19:59:08,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:59:08,241 INFO L480 AbstractCegarLoop]: Abstraction has 6326 states and 20700 transitions. [2018-11-28 19:59:08,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 19:59:08,241 INFO L276 IsEmpty]: Start isEmpty. Operand 6326 states and 20700 transitions. [2018-11-28 19:59:08,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-28 19:59:08,244 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:59:08,245 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:59:08,245 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:59:08,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:59:08,245 INFO L82 PathProgramCache]: Analyzing trace with hash 844464111, now seen corresponding path program 1 times [2018-11-28 19:59:08,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:59:08,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:59:08,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:08,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:59:08,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:08,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:59:08,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 19:59:08,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:59:08,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 19:59:08,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 19:59:08,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 19:59:08,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 19:59:08,568 INFO L87 Difference]: Start difference. First operand 6326 states and 20700 transitions. Second operand 5 states. [2018-11-28 19:59:10,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:59:10,916 INFO L93 Difference]: Finished difference Result 12022 states and 38786 transitions. [2018-11-28 19:59:10,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 19:59:10,923 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-11-28 19:59:10,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:59:10,966 INFO L225 Difference]: With dead ends: 12022 [2018-11-28 19:59:10,967 INFO L226 Difference]: Without dead ends: 11947 [2018-11-28 19:59:10,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 19:59:11,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11947 states. [2018-11-28 19:59:11,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11947 to 8291. [2018-11-28 19:59:11,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8291 states. [2018-11-28 19:59:11,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8291 states to 8291 states and 26553 transitions. [2018-11-28 19:59:11,216 INFO L78 Accepts]: Start accepts. Automaton has 8291 states and 26553 transitions. Word has length 50 [2018-11-28 19:59:11,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:59:11,217 INFO L480 AbstractCegarLoop]: Abstraction has 8291 states and 26553 transitions. [2018-11-28 19:59:11,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 19:59:11,218 INFO L276 IsEmpty]: Start isEmpty. Operand 8291 states and 26553 transitions. [2018-11-28 19:59:11,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-28 19:59:11,221 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:59:11,222 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] [2018-11-28 19:59:11,222 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:59:11,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:59:11,222 INFO L82 PathProgramCache]: Analyzing trace with hash 663764693, now seen corresponding path program 1 times [2018-11-28 19:59:11,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:59:11,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:59:11,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:11,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:59:11,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:11,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:59:11,324 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 19:59:11,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:59:11,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 19:59:11,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 19:59:11,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 19:59:11,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 19:59:11,326 INFO L87 Difference]: Start difference. First operand 8291 states and 26553 transitions. Second operand 3 states. [2018-11-28 19:59:11,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:59:11,605 INFO L93 Difference]: Finished difference Result 10987 states and 34708 transitions. [2018-11-28 19:59:11,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 19:59:11,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-11-28 19:59:11,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:59:11,644 INFO L225 Difference]: With dead ends: 10987 [2018-11-28 19:59:11,644 INFO L226 Difference]: Without dead ends: 10983 [2018-11-28 19:59:11,644 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 19:59:11,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10983 states. [2018-11-28 19:59:11,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10983 to 8509. [2018-11-28 19:59:11,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8509 states. [2018-11-28 19:59:11,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8509 states to 8509 states and 26989 transitions. [2018-11-28 19:59:11,879 INFO L78 Accepts]: Start accepts. Automaton has 8509 states and 26989 transitions. Word has length 52 [2018-11-28 19:59:11,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:59:11,880 INFO L480 AbstractCegarLoop]: Abstraction has 8509 states and 26989 transitions. [2018-11-28 19:59:11,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 19:59:11,881 INFO L276 IsEmpty]: Start isEmpty. Operand 8509 states and 26989 transitions. [2018-11-28 19:59:11,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-28 19:59:11,884 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:59:11,884 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:59:11,885 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:59:11,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:59:11,885 INFO L82 PathProgramCache]: Analyzing trace with hash -324933472, now seen corresponding path program 1 times [2018-11-28 19:59:11,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:59:11,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:59:11,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:11,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:59:11,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:11,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:59:12,058 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 19:59:12,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:59:12,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 19:59:12,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 19:59:12,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 19:59:12,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 19:59:12,060 INFO L87 Difference]: Start difference. First operand 8509 states and 26989 transitions. Second operand 6 states. [2018-11-28 19:59:12,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:59:12,814 INFO L93 Difference]: Finished difference Result 11925 states and 37200 transitions. [2018-11-28 19:59:12,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 19:59:12,819 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2018-11-28 19:59:12,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:59:12,855 INFO L225 Difference]: With dead ends: 11925 [2018-11-28 19:59:12,856 INFO L226 Difference]: Without dead ends: 11828 [2018-11-28 19:59:12,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-11-28 19:59:12,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11828 states. [2018-11-28 19:59:13,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11828 to 9283. [2018-11-28 19:59:13,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9283 states. [2018-11-28 19:59:13,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9283 states to 9283 states and 29433 transitions. [2018-11-28 19:59:13,089 INFO L78 Accepts]: Start accepts. Automaton has 9283 states and 29433 transitions. Word has length 56 [2018-11-28 19:59:13,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:59:13,090 INFO L480 AbstractCegarLoop]: Abstraction has 9283 states and 29433 transitions. [2018-11-28 19:59:13,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 19:59:13,090 INFO L276 IsEmpty]: Start isEmpty. Operand 9283 states and 29433 transitions. [2018-11-28 19:59:13,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 19:59:13,103 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:59:13,103 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:59:13,104 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:59:13,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:59:13,104 INFO L82 PathProgramCache]: Analyzing trace with hash 841395753, now seen corresponding path program 1 times [2018-11-28 19:59:13,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:59:13,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:59:13,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:13,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:59:13,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:13,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:59:13,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 19:59:13,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:59:13,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 19:59:13,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 19:59:13,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 19:59:13,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 19:59:13,314 INFO L87 Difference]: Start difference. First operand 9283 states and 29433 transitions. Second operand 4 states. [2018-11-28 19:59:13,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:59:13,821 INFO L93 Difference]: Finished difference Result 10902 states and 34384 transitions. [2018-11-28 19:59:13,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 19:59:13,822 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-11-28 19:59:13,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:59:13,848 INFO L225 Difference]: With dead ends: 10902 [2018-11-28 19:59:13,848 INFO L226 Difference]: Without dead ends: 10902 [2018-11-28 19:59:13,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 19:59:13,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10902 states. [2018-11-28 19:59:14,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10902 to 9934. [2018-11-28 19:59:14,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9934 states. [2018-11-28 19:59:14,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9934 states to 9934 states and 31410 transitions. [2018-11-28 19:59:14,078 INFO L78 Accepts]: Start accepts. Automaton has 9934 states and 31410 transitions. Word has length 66 [2018-11-28 19:59:14,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:59:14,079 INFO L480 AbstractCegarLoop]: Abstraction has 9934 states and 31410 transitions. [2018-11-28 19:59:14,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 19:59:14,079 INFO L276 IsEmpty]: Start isEmpty. Operand 9934 states and 31410 transitions. [2018-11-28 19:59:14,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 19:59:14,091 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:59:14,091 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:59:14,091 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:59:14,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:59:14,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1710761208, now seen corresponding path program 1 times [2018-11-28 19:59:14,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:59:14,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:59:14,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:14,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:59:14,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:14,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:59:14,498 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 19:59:14,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:59:14,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 19:59:14,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 19:59:14,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 19:59:14,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 19:59:14,501 INFO L87 Difference]: Start difference. First operand 9934 states and 31410 transitions. Second operand 6 states. [2018-11-28 19:59:15,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:59:15,702 INFO L93 Difference]: Finished difference Result 21765 states and 67782 transitions. [2018-11-28 19:59:15,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 19:59:15,703 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-11-28 19:59:15,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:59:15,742 INFO L225 Difference]: With dead ends: 21765 [2018-11-28 19:59:15,742 INFO L226 Difference]: Without dead ends: 21701 [2018-11-28 19:59:15,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-11-28 19:59:15,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21701 states. [2018-11-28 19:59:16,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21701 to 13159. [2018-11-28 19:59:16,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13159 states. [2018-11-28 19:59:16,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13159 states to 13159 states and 40991 transitions. [2018-11-28 19:59:16,150 INFO L78 Accepts]: Start accepts. Automaton has 13159 states and 40991 transitions. Word has length 66 [2018-11-28 19:59:16,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:59:16,151 INFO L480 AbstractCegarLoop]: Abstraction has 13159 states and 40991 transitions. [2018-11-28 19:59:16,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 19:59:16,151 INFO L276 IsEmpty]: Start isEmpty. Operand 13159 states and 40991 transitions. [2018-11-28 19:59:16,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-28 19:59:16,170 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:59:16,170 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:59:16,170 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:59:16,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:59:16,171 INFO L82 PathProgramCache]: Analyzing trace with hash -52804182, now seen corresponding path program 1 times [2018-11-28 19:59:16,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:59:16,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:59:16,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:16,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:59:16,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:16,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:59:16,374 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 19:59:16,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:59:16,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 19:59:16,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 19:59:16,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 19:59:16,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 19:59:16,377 INFO L87 Difference]: Start difference. First operand 13159 states and 40991 transitions. Second operand 4 states. [2018-11-28 19:59:16,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:59:16,702 INFO L93 Difference]: Finished difference Result 16698 states and 51258 transitions. [2018-11-28 19:59:16,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 19:59:16,703 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2018-11-28 19:59:16,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:59:16,731 INFO L225 Difference]: With dead ends: 16698 [2018-11-28 19:59:16,731 INFO L226 Difference]: Without dead ends: 16698 [2018-11-28 19:59:16,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 19:59:16,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16698 states. [2018-11-28 19:59:17,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16698 to 15122. [2018-11-28 19:59:17,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15122 states. [2018-11-28 19:59:17,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15122 states to 15122 states and 46581 transitions. [2018-11-28 19:59:17,080 INFO L78 Accepts]: Start accepts. Automaton has 15122 states and 46581 transitions. Word has length 68 [2018-11-28 19:59:17,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:59:17,081 INFO L480 AbstractCegarLoop]: Abstraction has 15122 states and 46581 transitions. [2018-11-28 19:59:17,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 19:59:17,081 INFO L276 IsEmpty]: Start isEmpty. Operand 15122 states and 46581 transitions. [2018-11-28 19:59:17,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-28 19:59:17,105 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:59:17,105 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:59:17,105 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:59:17,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:59:17,106 INFO L82 PathProgramCache]: Analyzing trace with hash -2130013525, now seen corresponding path program 1 times [2018-11-28 19:59:17,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:59:17,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:59:17,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:17,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:59:17,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:17,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:59:17,262 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 19:59:17,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:59:17,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 19:59:17,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 19:59:17,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 19:59:17,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 19:59:17,265 INFO L87 Difference]: Start difference. First operand 15122 states and 46581 transitions. Second operand 3 states. [2018-11-28 19:59:17,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:59:17,732 INFO L93 Difference]: Finished difference Result 15720 states and 48233 transitions. [2018-11-28 19:59:17,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 19:59:17,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-11-28 19:59:17,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:59:17,767 INFO L225 Difference]: With dead ends: 15720 [2018-11-28 19:59:17,767 INFO L226 Difference]: Without dead ends: 15720 [2018-11-28 19:59:17,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 19:59:17,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15720 states. [2018-11-28 19:59:18,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15720 to 15448. [2018-11-28 19:59:18,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15448 states. [2018-11-28 19:59:18,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15448 states to 15448 states and 47475 transitions. [2018-11-28 19:59:18,271 INFO L78 Accepts]: Start accepts. Automaton has 15448 states and 47475 transitions. Word has length 68 [2018-11-28 19:59:18,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:59:18,271 INFO L480 AbstractCegarLoop]: Abstraction has 15448 states and 47475 transitions. [2018-11-28 19:59:18,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 19:59:18,271 INFO L276 IsEmpty]: Start isEmpty. Operand 15448 states and 47475 transitions. [2018-11-28 19:59:18,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-28 19:59:18,308 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:59:18,308 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] [2018-11-28 19:59:18,308 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:59:18,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:59:18,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1509935379, now seen corresponding path program 1 times [2018-11-28 19:59:18,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:59:18,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:59:18,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:18,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:59:18,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:18,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:59:18,542 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 19:59:18,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:59:18,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 19:59:18,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 19:59:18,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 19:59:18,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 19:59:18,544 INFO L87 Difference]: Start difference. First operand 15448 states and 47475 transitions. Second operand 6 states. [2018-11-28 19:59:19,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:59:19,587 INFO L93 Difference]: Finished difference Result 18771 states and 56913 transitions. [2018-11-28 19:59:19,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 19:59:19,587 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2018-11-28 19:59:19,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:59:19,617 INFO L225 Difference]: With dead ends: 18771 [2018-11-28 19:59:19,617 INFO L226 Difference]: Without dead ends: 18771 [2018-11-28 19:59:19,617 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 19:59:19,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18771 states. [2018-11-28 19:59:19,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18771 to 17775. [2018-11-28 19:59:19,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17775 states. [2018-11-28 19:59:19,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17775 states to 17775 states and 54207 transitions. [2018-11-28 19:59:19,888 INFO L78 Accepts]: Start accepts. Automaton has 17775 states and 54207 transitions. Word has length 70 [2018-11-28 19:59:19,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:59:19,889 INFO L480 AbstractCegarLoop]: Abstraction has 17775 states and 54207 transitions. [2018-11-28 19:59:19,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 19:59:19,889 INFO L276 IsEmpty]: Start isEmpty. Operand 17775 states and 54207 transitions. [2018-11-28 19:59:19,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-28 19:59:19,912 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:59:19,912 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] [2018-11-28 19:59:19,912 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:59:19,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:59:19,912 INFO L82 PathProgramCache]: Analyzing trace with hash -567273964, now seen corresponding path program 1 times [2018-11-28 19:59:19,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:59:19,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:59:19,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:19,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:59:19,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:19,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:59:20,074 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 19:59:20,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:59:20,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 19:59:20,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 19:59:20,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 19:59:20,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 19:59:20,076 INFO L87 Difference]: Start difference. First operand 17775 states and 54207 transitions. Second operand 6 states. [2018-11-28 19:59:20,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:59:20,808 INFO L93 Difference]: Finished difference Result 20829 states and 61550 transitions. [2018-11-28 19:59:20,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 19:59:20,809 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2018-11-28 19:59:20,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:59:20,844 INFO L225 Difference]: With dead ends: 20829 [2018-11-28 19:59:20,844 INFO L226 Difference]: Without dead ends: 20829 [2018-11-28 19:59:20,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-28 19:59:20,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20829 states. [2018-11-28 19:59:21,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20829 to 18076. [2018-11-28 19:59:21,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18076 states. [2018-11-28 19:59:21,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18076 states to 18076 states and 54063 transitions. [2018-11-28 19:59:21,125 INFO L78 Accepts]: Start accepts. Automaton has 18076 states and 54063 transitions. Word has length 70 [2018-11-28 19:59:21,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:59:21,125 INFO L480 AbstractCegarLoop]: Abstraction has 18076 states and 54063 transitions. [2018-11-28 19:59:21,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 19:59:21,125 INFO L276 IsEmpty]: Start isEmpty. Operand 18076 states and 54063 transitions. [2018-11-28 19:59:21,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-28 19:59:21,445 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:59:21,446 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] [2018-11-28 19:59:21,446 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:59:21,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:59:21,446 INFO L82 PathProgramCache]: Analyzing trace with hash -355923051, now seen corresponding path program 1 times [2018-11-28 19:59:21,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:59:21,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:59:21,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:21,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:59:21,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:21,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:59:21,807 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 19:59:21,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:59:21,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 19:59:21,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 19:59:21,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 19:59:21,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 19:59:21,808 INFO L87 Difference]: Start difference. First operand 18076 states and 54063 transitions. Second operand 5 states. [2018-11-28 19:59:22,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:59:22,282 INFO L93 Difference]: Finished difference Result 22793 states and 67730 transitions. [2018-11-28 19:59:22,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 19:59:22,283 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-11-28 19:59:22,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:59:22,319 INFO L225 Difference]: With dead ends: 22793 [2018-11-28 19:59:22,320 INFO L226 Difference]: Without dead ends: 22793 [2018-11-28 19:59:22,320 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 19:59:22,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22793 states. [2018-11-28 19:59:22,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22793 to 19399. [2018-11-28 19:59:22,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19399 states. [2018-11-28 19:59:22,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19399 states to 19399 states and 57544 transitions. [2018-11-28 19:59:22,617 INFO L78 Accepts]: Start accepts. Automaton has 19399 states and 57544 transitions. Word has length 70 [2018-11-28 19:59:22,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:59:22,617 INFO L480 AbstractCegarLoop]: Abstraction has 19399 states and 57544 transitions. [2018-11-28 19:59:22,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 19:59:22,617 INFO L276 IsEmpty]: Start isEmpty. Operand 19399 states and 57544 transitions. [2018-11-28 19:59:22,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-28 19:59:22,635 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:59:22,636 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] [2018-11-28 19:59:22,636 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:59:22,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:59:22,636 INFO L82 PathProgramCache]: Analyzing trace with hash -866457228, now seen corresponding path program 1 times [2018-11-28 19:59:22,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:59:22,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:59:22,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:22,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:59:22,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:22,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:59:22,932 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 19:59:22,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:59:22,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 19:59:22,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 19:59:22,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 19:59:22,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 19:59:22,934 INFO L87 Difference]: Start difference. First operand 19399 states and 57544 transitions. Second operand 5 states. [2018-11-28 19:59:23,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:59:23,482 INFO L93 Difference]: Finished difference Result 26466 states and 78091 transitions. [2018-11-28 19:59:23,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 19:59:23,483 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-11-28 19:59:23,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:59:23,526 INFO L225 Difference]: With dead ends: 26466 [2018-11-28 19:59:23,526 INFO L226 Difference]: Without dead ends: 26466 [2018-11-28 19:59:23,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 19:59:23,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26466 states. [2018-11-28 19:59:23,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26466 to 20584. [2018-11-28 19:59:23,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20584 states. [2018-11-28 19:59:23,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20584 states to 20584 states and 61050 transitions. [2018-11-28 19:59:23,859 INFO L78 Accepts]: Start accepts. Automaton has 20584 states and 61050 transitions. Word has length 70 [2018-11-28 19:59:23,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:59:23,859 INFO L480 AbstractCegarLoop]: Abstraction has 20584 states and 61050 transitions. [2018-11-28 19:59:23,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 19:59:23,859 INFO L276 IsEmpty]: Start isEmpty. Operand 20584 states and 61050 transitions. [2018-11-28 19:59:23,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-28 19:59:23,876 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:59:23,876 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] [2018-11-28 19:59:23,877 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:59:23,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:59:23,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1621055605, now seen corresponding path program 1 times [2018-11-28 19:59:23,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:59:23,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:59:23,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:23,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:59:23,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:23,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:59:24,031 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 19:59:24,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:59:24,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 19:59:24,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 19:59:24,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 19:59:24,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 19:59:24,032 INFO L87 Difference]: Start difference. First operand 20584 states and 61050 transitions. Second operand 4 states. [2018-11-28 19:59:24,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:59:24,729 INFO L93 Difference]: Finished difference Result 28448 states and 84504 transitions. [2018-11-28 19:59:24,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 19:59:24,730 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2018-11-28 19:59:24,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:59:24,778 INFO L225 Difference]: With dead ends: 28448 [2018-11-28 19:59:24,779 INFO L226 Difference]: Without dead ends: 28028 [2018-11-28 19:59:24,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 19:59:24,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28028 states. [2018-11-28 19:59:25,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28028 to 25836. [2018-11-28 19:59:25,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25836 states. [2018-11-28 19:59:25,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25836 states to 25836 states and 76852 transitions. [2018-11-28 19:59:25,228 INFO L78 Accepts]: Start accepts. Automaton has 25836 states and 76852 transitions. Word has length 70 [2018-11-28 19:59:25,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:59:25,228 INFO L480 AbstractCegarLoop]: Abstraction has 25836 states and 76852 transitions. [2018-11-28 19:59:25,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 19:59:25,228 INFO L276 IsEmpty]: Start isEmpty. Operand 25836 states and 76852 transitions. [2018-11-28 19:59:25,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-28 19:59:25,250 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:59:25,251 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] [2018-11-28 19:59:25,251 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:59:25,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:59:25,251 INFO L82 PathProgramCache]: Analyzing trace with hash -175895754, now seen corresponding path program 1 times [2018-11-28 19:59:25,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:59:25,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:59:25,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:25,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:59:25,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:25,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:59:25,474 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 19:59:25,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:59:25,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 19:59:25,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 19:59:25,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 19:59:25,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 19:59:25,475 INFO L87 Difference]: Start difference. First operand 25836 states and 76852 transitions. Second operand 5 states. [2018-11-28 19:59:25,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:59:25,912 INFO L93 Difference]: Finished difference Result 7052 states and 16992 transitions. [2018-11-28 19:59:25,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 19:59:25,912 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-11-28 19:59:25,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:59:25,919 INFO L225 Difference]: With dead ends: 7052 [2018-11-28 19:59:25,920 INFO L226 Difference]: Without dead ends: 5565 [2018-11-28 19:59:25,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-28 19:59:25,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5565 states. [2018-11-28 19:59:25,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5565 to 4891. [2018-11-28 19:59:25,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4891 states. [2018-11-28 19:59:25,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4891 states to 4891 states and 11544 transitions. [2018-11-28 19:59:25,992 INFO L78 Accepts]: Start accepts. Automaton has 4891 states and 11544 transitions. Word has length 70 [2018-11-28 19:59:25,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:59:25,993 INFO L480 AbstractCegarLoop]: Abstraction has 4891 states and 11544 transitions. [2018-11-28 19:59:25,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 19:59:25,993 INFO L276 IsEmpty]: Start isEmpty. Operand 4891 states and 11544 transitions. [2018-11-28 19:59:25,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-28 19:59:25,999 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:59:25,999 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:59:26,000 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:59:26,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:59:26,000 INFO L82 PathProgramCache]: Analyzing trace with hash 912313909, now seen corresponding path program 1 times [2018-11-28 19:59:26,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:59:26,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:59:26,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:26,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:59:26,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:26,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:59:26,280 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 19:59:26,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:59:26,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 19:59:26,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 19:59:26,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 19:59:26,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-28 19:59:26,283 INFO L87 Difference]: Start difference. First operand 4891 states and 11544 transitions. Second operand 7 states. [2018-11-28 19:59:27,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:59:27,027 INFO L93 Difference]: Finished difference Result 6133 states and 14405 transitions. [2018-11-28 19:59:27,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 19:59:27,028 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2018-11-28 19:59:27,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:59:27,034 INFO L225 Difference]: With dead ends: 6133 [2018-11-28 19:59:27,034 INFO L226 Difference]: Without dead ends: 6133 [2018-11-28 19:59:27,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-28 19:59:27,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6133 states. [2018-11-28 19:59:27,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6133 to 5041. [2018-11-28 19:59:27,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5041 states. [2018-11-28 19:59:27,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5041 states to 5041 states and 11934 transitions. [2018-11-28 19:59:27,103 INFO L78 Accepts]: Start accepts. Automaton has 5041 states and 11934 transitions. Word has length 85 [2018-11-28 19:59:27,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:59:27,103 INFO L480 AbstractCegarLoop]: Abstraction has 5041 states and 11934 transitions. [2018-11-28 19:59:27,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 19:59:27,103 INFO L276 IsEmpty]: Start isEmpty. Operand 5041 states and 11934 transitions. [2018-11-28 19:59:27,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-28 19:59:27,109 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:59:27,109 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:59:27,109 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:59:27,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:59:27,110 INFO L82 PathProgramCache]: Analyzing trace with hash 581741880, now seen corresponding path program 1 times [2018-11-28 19:59:27,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:59:27,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:59:27,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:27,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:59:27,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:27,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:59:27,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 19:59:27,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:59:27,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 19:59:27,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 19:59:27,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 19:59:27,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 19:59:27,449 INFO L87 Difference]: Start difference. First operand 5041 states and 11934 transitions. Second operand 5 states. [2018-11-28 19:59:28,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:59:28,244 INFO L93 Difference]: Finished difference Result 5883 states and 13764 transitions. [2018-11-28 19:59:28,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 19:59:28,245 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2018-11-28 19:59:28,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:59:28,252 INFO L225 Difference]: With dead ends: 5883 [2018-11-28 19:59:28,252 INFO L226 Difference]: Without dead ends: 5849 [2018-11-28 19:59:28,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 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 19:59:28,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5849 states. [2018-11-28 19:59:28,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5849 to 5197. [2018-11-28 19:59:28,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5197 states. [2018-11-28 19:59:28,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5197 states to 5197 states and 12242 transitions. [2018-11-28 19:59:28,310 INFO L78 Accepts]: Start accepts. Automaton has 5197 states and 12242 transitions. Word has length 85 [2018-11-28 19:59:28,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:59:28,310 INFO L480 AbstractCegarLoop]: Abstraction has 5197 states and 12242 transitions. [2018-11-28 19:59:28,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 19:59:28,310 INFO L276 IsEmpty]: Start isEmpty. Operand 5197 states and 12242 transitions. [2018-11-28 19:59:28,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-28 19:59:28,316 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:59:28,317 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:59:28,317 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:59:28,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:59:28,317 INFO L82 PathProgramCache]: Analyzing trace with hash -221645014, now seen corresponding path program 2 times [2018-11-28 19:59:28,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:59:28,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:59:28,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:28,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:59:28,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:28,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:59:28,666 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-11-28 19:59:28,718 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 19:59:28,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:59:28,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 19:59:28,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 19:59:28,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 19:59:28,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 19:59:28,719 INFO L87 Difference]: Start difference. First operand 5197 states and 12242 transitions. Second operand 6 states. [2018-11-28 19:59:28,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:59:28,820 INFO L93 Difference]: Finished difference Result 4941 states and 11426 transitions. [2018-11-28 19:59:28,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 19:59:28,821 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2018-11-28 19:59:28,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:59:28,828 INFO L225 Difference]: With dead ends: 4941 [2018-11-28 19:59:28,829 INFO L226 Difference]: Without dead ends: 4941 [2018-11-28 19:59:28,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-28 19:59:28,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4941 states. [2018-11-28 19:59:28,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4941 to 3289. [2018-11-28 19:59:28,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3289 states. [2018-11-28 19:59:28,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3289 states to 3289 states and 7670 transitions. [2018-11-28 19:59:28,871 INFO L78 Accepts]: Start accepts. Automaton has 3289 states and 7670 transitions. Word has length 85 [2018-11-28 19:59:28,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:59:28,871 INFO L480 AbstractCegarLoop]: Abstraction has 3289 states and 7670 transitions. [2018-11-28 19:59:28,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 19:59:28,871 INFO L276 IsEmpty]: Start isEmpty. Operand 3289 states and 7670 transitions. [2018-11-28 19:59:28,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-28 19:59:28,875 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:59:28,875 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 19:59:28,875 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:59:28,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:59:28,876 INFO L82 PathProgramCache]: Analyzing trace with hash 358607745, now seen corresponding path program 1 times [2018-11-28 19:59:28,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:59:28,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:59:28,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:28,878 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 19:59:28,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:28,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:59:29,131 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-28 19:59:29,210 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 19:59:29,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:59:29,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 19:59:29,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 19:59:29,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 19:59:29,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-28 19:59:29,211 INFO L87 Difference]: Start difference. First operand 3289 states and 7670 transitions. Second operand 10 states. [2018-11-28 19:59:29,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:59:29,996 INFO L93 Difference]: Finished difference Result 6298 states and 14804 transitions. [2018-11-28 19:59:29,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 19:59:29,997 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 87 [2018-11-28 19:59:29,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:59:30,001 INFO L225 Difference]: With dead ends: 6298 [2018-11-28 19:59:30,001 INFO L226 Difference]: Without dead ends: 2478 [2018-11-28 19:59:30,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-11-28 19:59:30,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2478 states. [2018-11-28 19:59:30,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2478 to 2478. [2018-11-28 19:59:30,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2478 states. [2018-11-28 19:59:30,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2478 states to 2478 states and 5845 transitions. [2018-11-28 19:59:30,025 INFO L78 Accepts]: Start accepts. Automaton has 2478 states and 5845 transitions. Word has length 87 [2018-11-28 19:59:30,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:59:30,026 INFO L480 AbstractCegarLoop]: Abstraction has 2478 states and 5845 transitions. [2018-11-28 19:59:30,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 19:59:30,026 INFO L276 IsEmpty]: Start isEmpty. Operand 2478 states and 5845 transitions. [2018-11-28 19:59:30,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-28 19:59:30,029 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:59:30,029 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] [2018-11-28 19:59:30,029 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:59:30,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:59:30,030 INFO L82 PathProgramCache]: Analyzing trace with hash 792045687, now seen corresponding path program 2 times [2018-11-28 19:59:30,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:59:30,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:59:30,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:30,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:59:30,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:30,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:59:30,304 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-28 19:59:30,472 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-28 19:59:30,694 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 19:59:30,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:59:30,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 19:59:30,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 19:59:30,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 19:59:30,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-28 19:59:30,696 INFO L87 Difference]: Start difference. First operand 2478 states and 5845 transitions. Second operand 11 states. [2018-11-28 19:59:31,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:59:31,745 INFO L93 Difference]: Finished difference Result 4068 states and 9576 transitions. [2018-11-28 19:59:31,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 19:59:31,746 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 87 [2018-11-28 19:59:31,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:59:31,750 INFO L225 Difference]: With dead ends: 4068 [2018-11-28 19:59:31,750 INFO L226 Difference]: Without dead ends: 2719 [2018-11-28 19:59:31,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2018-11-28 19:59:31,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2719 states. [2018-11-28 19:59:31,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2719 to 2513. [2018-11-28 19:59:31,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2513 states. [2018-11-28 19:59:31,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2513 states to 2513 states and 5872 transitions. [2018-11-28 19:59:31,780 INFO L78 Accepts]: Start accepts. Automaton has 2513 states and 5872 transitions. Word has length 87 [2018-11-28 19:59:31,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:59:31,781 INFO L480 AbstractCegarLoop]: Abstraction has 2513 states and 5872 transitions. [2018-11-28 19:59:31,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 19:59:31,781 INFO L276 IsEmpty]: Start isEmpty. Operand 2513 states and 5872 transitions. [2018-11-28 19:59:31,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-28 19:59:31,785 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:59:31,785 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] [2018-11-28 19:59:31,786 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:59:31,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:59:31,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1869156796, now seen corresponding path program 1 times [2018-11-28 19:59:31,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:59:31,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:59:31,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:31,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 19:59:31,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:31,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 19:59:32,099 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 19:59:32,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 19:59:32,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 19:59:32,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 19:59:32,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 19:59:32,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 19:59:32,100 INFO L87 Difference]: Start difference. First operand 2513 states and 5872 transitions. Second operand 6 states. [2018-11-28 19:59:32,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 19:59:32,304 INFO L93 Difference]: Finished difference Result 2692 states and 6176 transitions. [2018-11-28 19:59:32,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 19:59:32,306 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2018-11-28 19:59:32,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 19:59:32,310 INFO L225 Difference]: With dead ends: 2692 [2018-11-28 19:59:32,310 INFO L226 Difference]: Without dead ends: 2634 [2018-11-28 19:59:32,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-28 19:59:32,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2634 states. [2018-11-28 19:59:32,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2634 to 2280. [2018-11-28 19:59:32,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2280 states. [2018-11-28 19:59:32,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2280 states to 2280 states and 5231 transitions. [2018-11-28 19:59:32,336 INFO L78 Accepts]: Start accepts. Automaton has 2280 states and 5231 transitions. Word has length 87 [2018-11-28 19:59:32,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 19:59:32,336 INFO L480 AbstractCegarLoop]: Abstraction has 2280 states and 5231 transitions. [2018-11-28 19:59:32,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 19:59:32,336 INFO L276 IsEmpty]: Start isEmpty. Operand 2280 states and 5231 transitions. [2018-11-28 19:59:32,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-28 19:59:32,339 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 19:59:32,339 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] [2018-11-28 19:59:32,340 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 19:59:32,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 19:59:32,341 INFO L82 PathProgramCache]: Analyzing trace with hash -208052547, now seen corresponding path program 3 times [2018-11-28 19:59:32,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 19:59:32,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 19:59:32,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:32,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 19:59:32,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 19:59:32,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 19:59:32,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 19:59:32,428 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 19:59:32,603 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-11-28 19:59:32,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 07:59:32 BasicIcfg [2018-11-28 19:59:32,606 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 19:59:32,606 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 19:59:32,606 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 19:59:32,610 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 19:59:32,610 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 07:59:01" (3/4) ... [2018-11-28 19:59:32,615 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 19:59:32,855 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 19:59:32,856 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 19:59:32,857 INFO L168 Benchmark]: Toolchain (without parser) took 33368.95 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.2 GB). Free memory was 947.3 MB in the beginning and 1.2 GB in the end (delta: -281.0 MB). Peak memory consumption was 893.9 MB. Max. memory is 11.5 GB. [2018-11-28 19:59:32,858 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 19:59:32,859 INFO L168 Benchmark]: CACSL2BoogieTranslator took 880.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -164.9 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2018-11-28 19:59:32,859 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.47 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-11-28 19:59:32,859 INFO L168 Benchmark]: Boogie Preprocessor took 40.16 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 19:59:32,859 INFO L168 Benchmark]: RCFGBuilder took 1133.64 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: 40.1 MB). Peak memory consumption was 40.1 MB. Max. memory is 11.5 GB. [2018-11-28 19:59:32,860 INFO L168 Benchmark]: TraceAbstraction took 30982.22 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.0 GB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -200.1 MB). Peak memory consumption was 834.3 MB. Max. memory is 11.5 GB. [2018-11-28 19:59:32,860 INFO L168 Benchmark]: Witness Printer took 249.70 ms. Allocated memory is still 2.2 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-11-28 19:59:32,865 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 880.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -164.9 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 76.47 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.16 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 1133.64 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: 40.1 MB). Peak memory consumption was 40.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 30982.22 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.0 GB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -200.1 MB). Peak memory consumption was 834.3 MB. Max. memory is 11.5 GB. * Witness Printer took 249.70 ms. Allocated memory is still 2.2 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L678] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L680] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L682] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0] [L683] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0] [L684] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L686] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L688] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L689] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L690] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L691] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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] [L692] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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] [L693] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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] [L694] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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] [L695] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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] [L696] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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] [L697] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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] [L698] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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}] [L699] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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] [L700] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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] [L701] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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] [L702] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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] [L704] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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, z=0] [L705] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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, z=0] [L706] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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, z=0] [L786] -1 pthread_t t841; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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, z=0] [L787] FCALL, FORK -1 pthread_create(&t841, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0: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, z=0] [L788] -1 pthread_t t842; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0: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, z=0] [L789] FCALL, FORK -1 pthread_create(&t842, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0: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, z=0] [L744] 0 y$w_buff1 = y$w_buff0 [L745] 0 y$w_buff0 = 1 [L746] 0 y$w_buff1_used = y$w_buff0_used [L747] 0 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0: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, z=0] [L749] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L750] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L751] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L752] 0 y$r_buff0_thd2 = (_Bool)1 [L755] 0 z = 1 [L758] 0 __unbuffered_p1_EAX = z [L761] 0 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, arg={0: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=1, 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, z=1] [L764] EXPR 0 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=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, arg={0: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=1, 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, z=1] [L710] 1 a = 1 [L713] 1 x = 1 [L716] 1 __unbuffered_p0_EAX = x [L719] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L720] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L721] 1 y$flush_delayed = weak$$choice2 [L722] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L723] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L723] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L724] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L724] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L725] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L725] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L726] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L726] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L727] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L727] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L728] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L728] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L729] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L729] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L730] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L731] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, 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=0, y$r_buff0_thd2=1, 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, z=1] [L764] 0 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L731] 1 y = y$flush_delayed ? y$mem_tmp : y [L732] 1 y$flush_delayed = (_Bool)0 [L737] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L765] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L765] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L766] EXPR 0 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_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L766] 0 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 [L767] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L767] 0 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L768] EXPR 0 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_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L768] 0 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 [L771] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L791] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L795] 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_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L795] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L795] 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_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L795] -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) [L796] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L796] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L797] 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_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L797] -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 [L798] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L798] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L799] 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_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L799] -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 [L802] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L5] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L5] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 202 locations, 3 error locations. UNSAFE Result, 30.8s OverallTime, 22 OverallIterations, 1 TraceHistogramMax, 15.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5596 SDtfs, 6293 SDslu, 11822 SDs, 0 SdLazy, 4758 SolverSat, 271 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 188 GetRequests, 49 SyntacticMatches, 14 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27858occurred 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: 6.0s AutomataMinimizationTime, 21 MinimizatonAttempts, 52732 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 1539 NumberOfCodeBlocks, 1539 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1431 ConstructedInterpolants, 0 QuantifiedInterpolants, 256560 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...