./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi003_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ea09b320-aa58-4a6b-8aec-8ab08f1b4f1f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ea09b320-aa58-4a6b-8aec-8ab08f1b4f1f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ea09b320-aa58-4a6b-8aec-8ab08f1b4f1f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ea09b320-aa58-4a6b-8aec-8ab08f1b4f1f/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi003_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_ea09b320-aa58-4a6b-8aec-8ab08f1b4f1f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ea09b320-aa58-4a6b-8aec-8ab08f1b4f1f/bin/uautomizer --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 9cde79280316325d2d59345170ff2a64a15955ff ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-cad4683 [2019-11-16 00:22:56,453 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:22:56,454 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:22:56,469 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:22:56,469 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:22:56,471 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:22:56,473 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:22:56,482 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:22:56,487 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:22:56,491 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:22:56,492 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:22:56,494 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:22:56,494 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:22:56,496 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:22:56,497 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:22:56,498 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:22:56,499 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:22:56,500 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:22:56,502 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:22:56,506 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:22:56,509 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:22:56,511 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:22:56,514 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:22:56,515 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:22:56,517 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:22:56,517 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:22:56,517 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:22:56,519 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:22:56,520 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:22:56,520 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:22:56,521 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:22:56,521 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:22:56,522 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:22:56,523 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:22:56,524 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:22:56,525 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:22:56,525 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:22:56,526 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:22:56,526 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:22:56,527 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:22:56,527 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:22:56,528 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ea09b320-aa58-4a6b-8aec-8ab08f1b4f1f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:22:56,554 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:22:56,564 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:22:56,565 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:22:56,566 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:22:56,566 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:22:56,566 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:22:56,567 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:22:56,567 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:22:56,567 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:22:56,567 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:22:56,567 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:22:56,568 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:22:56,568 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:22:56,568 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:22:56,568 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:22:56,569 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:22:56,570 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:22:56,570 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:22:56,570 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:22:56,570 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:22:56,571 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:22:56,571 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:22:56,571 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:22:56,571 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:22:56,572 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:22:56,572 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:22:56,572 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:22:56,573 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:22:56,573 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_ea09b320-aa58-4a6b-8aec-8ab08f1b4f1f/bin/uautomizer 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 -> 9cde79280316325d2d59345170ff2a64a15955ff [2019-11-16 00:22:56,609 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:22:56,626 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:22:56,630 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:22:56,631 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:22:56,632 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:22:56,633 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ea09b320-aa58-4a6b-8aec-8ab08f1b4f1f/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/rfi003_pso.opt.i [2019-11-16 00:22:56,697 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ea09b320-aa58-4a6b-8aec-8ab08f1b4f1f/bin/uautomizer/data/8e752024e/33377f8fecd4490f9497c544fa9a8516/FLAG957447fce [2019-11-16 00:22:57,182 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:22:57,184 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ea09b320-aa58-4a6b-8aec-8ab08f1b4f1f/sv-benchmarks/c/pthread-wmm/rfi003_pso.opt.i [2019-11-16 00:22:57,211 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ea09b320-aa58-4a6b-8aec-8ab08f1b4f1f/bin/uautomizer/data/8e752024e/33377f8fecd4490f9497c544fa9a8516/FLAG957447fce [2019-11-16 00:22:57,499 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ea09b320-aa58-4a6b-8aec-8ab08f1b4f1f/bin/uautomizer/data/8e752024e/33377f8fecd4490f9497c544fa9a8516 [2019-11-16 00:22:57,501 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:22:57,503 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:22:57,504 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:22:57,504 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:22:57,507 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:22:57,508 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:22:57" (1/1) ... [2019-11-16 00:22:57,510 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7be40f23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:57, skipping insertion in model container [2019-11-16 00:22:57,511 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:22:57" (1/1) ... [2019-11-16 00:22:57,517 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:22:57,578 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:22:57,969 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:22:57,980 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:22:58,055 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:22:58,147 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:22:58,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:58 WrapperNode [2019-11-16 00:22:58,148 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:22:58,149 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:22:58,149 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:22:58,149 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:22:58,157 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:58" (1/1) ... [2019-11-16 00:22:58,191 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:58" (1/1) ... [2019-11-16 00:22:58,218 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:22:58,218 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:22:58,218 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:22:58,218 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:22:58,227 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:58" (1/1) ... [2019-11-16 00:22:58,228 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:58" (1/1) ... [2019-11-16 00:22:58,231 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:58" (1/1) ... [2019-11-16 00:22:58,232 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:58" (1/1) ... [2019-11-16 00:22:58,254 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:58" (1/1) ... [2019-11-16 00:22:58,257 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:58" (1/1) ... [2019-11-16 00:22:58,260 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:58" (1/1) ... [2019-11-16 00:22:58,277 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:22:58,277 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:22:58,277 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:22:58,277 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:22:58,278 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea09b320-aa58-4a6b-8aec-8ab08f1b4f1f/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:22:58,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:22:58,354 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-16 00:22:58,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:22:58,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:22:58,356 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-16 00:22:58,356 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-16 00:22:58,357 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-16 00:22:58,357 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-16 00:22:58,357 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-16 00:22:58,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:22:58,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:22:58,361 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-16 00:22:59,022 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:22:59,022 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-16 00:22:59,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:22:59 BoogieIcfgContainer [2019-11-16 00:22:59,024 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:22:59,025 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:22:59,025 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:22:59,028 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:22:59,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:22:57" (1/3) ... [2019-11-16 00:22:59,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43a42e90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:22:59, skipping insertion in model container [2019-11-16 00:22:59,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:58" (2/3) ... [2019-11-16 00:22:59,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43a42e90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:22:59, skipping insertion in model container [2019-11-16 00:22:59,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:22:59" (3/3) ... [2019-11-16 00:22:59,039 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi003_pso.opt.i [2019-11-16 00:22:59,092 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,092 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,092 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,092 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,093 WARN L315 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,093 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,093 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,093 WARN L315 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,094 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,094 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,095 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,095 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,095 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,095 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,096 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,096 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,096 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,096 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,097 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,097 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,097 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,097 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,098 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,098 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,098 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,098 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,099 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,099 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,099 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,100 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,100 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,100 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,100 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,101 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,101 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,101 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,101 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,102 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,102 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,102 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,102 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,103 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,104 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,104 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,104 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,104 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,105 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,106 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,106 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,106 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,107 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,107 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,107 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,107 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,107 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,108 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,109 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,109 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,109 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,110 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,110 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,110 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,110 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,111 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,111 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,111 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,111 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,112 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,113 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,113 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,114 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,114 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,115 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,115 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,115 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,115 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,116 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,116 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,116 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,116 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,116 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,117 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,117 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,117 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,117 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,118 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,118 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,118 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,118 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,119 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,119 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,120 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,122 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,122 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,123 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,123 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,123 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,123 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,124 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,124 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,125 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,128 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,128 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,129 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,129 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,129 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,130 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,130 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,130 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,131 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,131 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,131 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,132 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,140 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,140 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,141 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,141 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,141 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,142 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,142 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,142 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,142 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,142 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,143 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,143 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,143 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,143 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,143 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:22:59,152 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-16 00:22:59,153 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:22:59,162 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-16 00:22:59,174 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-16 00:22:59,195 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:22:59,195 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:22:59,195 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:22:59,195 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:22:59,195 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:22:59,195 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:22:59,196 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:22:59,196 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:22:59,213 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 129 places, 161 transitions [2019-11-16 00:23:01,099 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25975 states. [2019-11-16 00:23:01,101 INFO L276 IsEmpty]: Start isEmpty. Operand 25975 states. [2019-11-16 00:23:01,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-16 00:23:01,123 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:01,124 INFO L380 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] [2019-11-16 00:23:01,129 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:23:01,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:01,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1135396639, now seen corresponding path program 1 times [2019-11-16 00:23:01,143 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:01,143 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945344815] [2019-11-16 00:23:01,144 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:01,144 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:01,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:01,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:01,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:01,412 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945344815] [2019-11-16 00:23:01,413 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:01,414 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:23:01,414 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668587014] [2019-11-16 00:23:01,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:23:01,419 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:01,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:23:01,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:23:01,437 INFO L87 Difference]: Start difference. First operand 25975 states. Second operand 4 states. [2019-11-16 00:23:02,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:02,085 INFO L93 Difference]: Finished difference Result 26615 states and 102120 transitions. [2019-11-16 00:23:02,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:23:02,087 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-11-16 00:23:02,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:02,306 INFO L225 Difference]: With dead ends: 26615 [2019-11-16 00:23:02,306 INFO L226 Difference]: Without dead ends: 20359 [2019-11-16 00:23:02,308 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:23:02,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20359 states. [2019-11-16 00:23:03,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20359 to 20359. [2019-11-16 00:23:03,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20359 states. [2019-11-16 00:23:03,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20359 states to 20359 states and 78424 transitions. [2019-11-16 00:23:03,617 INFO L78 Accepts]: Start accepts. Automaton has 20359 states and 78424 transitions. Word has length 38 [2019-11-16 00:23:03,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:03,619 INFO L462 AbstractCegarLoop]: Abstraction has 20359 states and 78424 transitions. [2019-11-16 00:23:03,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:23:03,620 INFO L276 IsEmpty]: Start isEmpty. Operand 20359 states and 78424 transitions. [2019-11-16 00:23:03,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-16 00:23:03,638 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:03,638 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:03,639 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:23:03,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:03,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1334378173, now seen corresponding path program 1 times [2019-11-16 00:23:03,640 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:03,640 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209395107] [2019-11-16 00:23:03,641 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:03,641 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:03,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:03,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:03,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:03,829 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209395107] [2019-11-16 00:23:03,829 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:03,829 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:23:03,830 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431530463] [2019-11-16 00:23:03,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:23:03,831 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:03,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:23:03,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:23:03,832 INFO L87 Difference]: Start difference. First operand 20359 states and 78424 transitions. Second operand 5 states. [2019-11-16 00:23:04,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:04,636 INFO L93 Difference]: Finished difference Result 31837 states and 116041 transitions. [2019-11-16 00:23:04,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:23:04,636 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-11-16 00:23:04,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:04,791 INFO L225 Difference]: With dead ends: 31837 [2019-11-16 00:23:04,791 INFO L226 Difference]: Without dead ends: 31285 [2019-11-16 00:23:04,792 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:23:05,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31285 states. [2019-11-16 00:23:05,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31285 to 29704. [2019-11-16 00:23:05,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29704 states. [2019-11-16 00:23:06,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29704 states to 29704 states and 109518 transitions. [2019-11-16 00:23:06,084 INFO L78 Accepts]: Start accepts. Automaton has 29704 states and 109518 transitions. Word has length 46 [2019-11-16 00:23:06,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:06,085 INFO L462 AbstractCegarLoop]: Abstraction has 29704 states and 109518 transitions. [2019-11-16 00:23:06,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:23:06,086 INFO L276 IsEmpty]: Start isEmpty. Operand 29704 states and 109518 transitions. [2019-11-16 00:23:06,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-16 00:23:06,091 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:06,092 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:06,092 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:23:06,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:06,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1293014968, now seen corresponding path program 1 times [2019-11-16 00:23:06,093 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:06,093 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638049884] [2019-11-16 00:23:06,093 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:06,094 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:06,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:06,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:06,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:06,170 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638049884] [2019-11-16 00:23:06,170 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:06,170 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:23:06,170 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542162097] [2019-11-16 00:23:06,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:23:06,171 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:06,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:23:06,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:23:06,171 INFO L87 Difference]: Start difference. First operand 29704 states and 109518 transitions. Second operand 5 states. [2019-11-16 00:23:07,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:07,179 INFO L93 Difference]: Finished difference Result 38695 states and 139690 transitions. [2019-11-16 00:23:07,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:23:07,180 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-11-16 00:23:07,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:07,334 INFO L225 Difference]: With dead ends: 38695 [2019-11-16 00:23:07,334 INFO L226 Difference]: Without dead ends: 38247 [2019-11-16 00:23:07,335 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:23:07,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38247 states. [2019-11-16 00:23:08,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38247 to 32950. [2019-11-16 00:23:08,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32950 states. [2019-11-16 00:23:08,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32950 states to 32950 states and 120527 transitions. [2019-11-16 00:23:08,760 INFO L78 Accepts]: Start accepts. Automaton has 32950 states and 120527 transitions. Word has length 47 [2019-11-16 00:23:08,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:08,761 INFO L462 AbstractCegarLoop]: Abstraction has 32950 states and 120527 transitions. [2019-11-16 00:23:08,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:23:08,761 INFO L276 IsEmpty]: Start isEmpty. Operand 32950 states and 120527 transitions. [2019-11-16 00:23:08,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-16 00:23:08,770 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:08,771 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:08,771 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:23:08,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:08,772 INFO L82 PathProgramCache]: Analyzing trace with hash -458309778, now seen corresponding path program 1 times [2019-11-16 00:23:08,772 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:08,772 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19793449] [2019-11-16 00:23:08,772 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:08,772 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:08,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:08,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:08,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:08,821 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19793449] [2019-11-16 00:23:08,822 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:08,822 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:23:08,822 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409966015] [2019-11-16 00:23:08,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:23:08,823 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:08,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:23:08,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:23:08,823 INFO L87 Difference]: Start difference. First operand 32950 states and 120527 transitions. Second operand 3 states. [2019-11-16 00:23:08,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:08,999 INFO L93 Difference]: Finished difference Result 42411 states and 152018 transitions. [2019-11-16 00:23:09,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:23:09,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-16 00:23:09,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:09,110 INFO L225 Difference]: With dead ends: 42411 [2019-11-16 00:23:09,110 INFO L226 Difference]: Without dead ends: 42411 [2019-11-16 00:23:09,110 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:23:09,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42411 states. [2019-11-16 00:23:09,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42411 to 37664. [2019-11-16 00:23:09,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37664 states. [2019-11-16 00:23:09,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37664 states to 37664 states and 136331 transitions. [2019-11-16 00:23:09,924 INFO L78 Accepts]: Start accepts. Automaton has 37664 states and 136331 transitions. Word has length 49 [2019-11-16 00:23:09,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:09,925 INFO L462 AbstractCegarLoop]: Abstraction has 37664 states and 136331 transitions. [2019-11-16 00:23:09,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:23:09,925 INFO L276 IsEmpty]: Start isEmpty. Operand 37664 states and 136331 transitions. [2019-11-16 00:23:09,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-16 00:23:09,939 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:09,940 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:09,940 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:23:09,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:09,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1978906735, now seen corresponding path program 1 times [2019-11-16 00:23:09,941 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:09,941 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991885166] [2019-11-16 00:23:09,941 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:09,942 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:09,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:09,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:10,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:10,019 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991885166] [2019-11-16 00:23:10,019 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:10,019 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:23:10,019 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887541131] [2019-11-16 00:23:10,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:23:10,020 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:10,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:23:10,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:23:10,020 INFO L87 Difference]: Start difference. First operand 37664 states and 136331 transitions. Second operand 6 states. [2019-11-16 00:23:11,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:11,397 INFO L93 Difference]: Finished difference Result 48755 states and 172980 transitions. [2019-11-16 00:23:11,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:23:11,398 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-11-16 00:23:11,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:11,493 INFO L225 Difference]: With dead ends: 48755 [2019-11-16 00:23:11,493 INFO L226 Difference]: Without dead ends: 48235 [2019-11-16 00:23:11,494 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:23:11,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48235 states. [2019-11-16 00:23:12,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48235 to 38228. [2019-11-16 00:23:12,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38228 states. [2019-11-16 00:23:12,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38228 states to 38228 states and 138494 transitions. [2019-11-16 00:23:12,242 INFO L78 Accepts]: Start accepts. Automaton has 38228 states and 138494 transitions. Word has length 53 [2019-11-16 00:23:12,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:12,243 INFO L462 AbstractCegarLoop]: Abstraction has 38228 states and 138494 transitions. [2019-11-16 00:23:12,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:23:12,243 INFO L276 IsEmpty]: Start isEmpty. Operand 38228 states and 138494 transitions. [2019-11-16 00:23:12,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-16 00:23:12,260 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:12,260 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:12,261 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:23:12,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:12,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1933781412, now seen corresponding path program 1 times [2019-11-16 00:23:12,261 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:12,262 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624749830] [2019-11-16 00:23:12,262 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:12,262 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:12,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:12,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:12,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:12,370 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624749830] [2019-11-16 00:23:12,371 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:12,371 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:23:12,371 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045632052] [2019-11-16 00:23:12,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:23:12,372 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:12,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:23:12,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:23:12,372 INFO L87 Difference]: Start difference. First operand 38228 states and 138494 transitions. Second operand 6 states. [2019-11-16 00:23:13,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:13,657 INFO L93 Difference]: Finished difference Result 53004 states and 189570 transitions. [2019-11-16 00:23:13,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:23:13,658 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-11-16 00:23:13,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:13,771 INFO L225 Difference]: With dead ends: 53004 [2019-11-16 00:23:13,771 INFO L226 Difference]: Without dead ends: 52028 [2019-11-16 00:23:13,772 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:23:13,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52028 states. [2019-11-16 00:23:14,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52028 to 48781. [2019-11-16 00:23:14,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48781 states. [2019-11-16 00:23:14,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48781 states to 48781 states and 175225 transitions. [2019-11-16 00:23:14,647 INFO L78 Accepts]: Start accepts. Automaton has 48781 states and 175225 transitions. Word has length 53 [2019-11-16 00:23:14,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:14,647 INFO L462 AbstractCegarLoop]: Abstraction has 48781 states and 175225 transitions. [2019-11-16 00:23:14,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:23:14,647 INFO L276 IsEmpty]: Start isEmpty. Operand 48781 states and 175225 transitions. [2019-11-16 00:23:14,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-16 00:23:14,666 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:14,666 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:14,667 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:23:14,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:14,667 INFO L82 PathProgramCache]: Analyzing trace with hash 136830053, now seen corresponding path program 1 times [2019-11-16 00:23:14,667 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:14,667 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309089167] [2019-11-16 00:23:14,667 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:14,667 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:14,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:14,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:14,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:14,772 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309089167] [2019-11-16 00:23:14,772 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:14,773 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:23:14,773 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642980955] [2019-11-16 00:23:14,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:23:14,773 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:14,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:23:14,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:23:14,774 INFO L87 Difference]: Start difference. First operand 48781 states and 175225 transitions. Second operand 7 states. [2019-11-16 00:23:15,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:15,858 INFO L93 Difference]: Finished difference Result 70896 states and 244522 transitions. [2019-11-16 00:23:15,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:23:15,858 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-11-16 00:23:15,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:16,001 INFO L225 Difference]: With dead ends: 70896 [2019-11-16 00:23:16,001 INFO L226 Difference]: Without dead ends: 70896 [2019-11-16 00:23:16,002 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:23:16,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70896 states. [2019-11-16 00:23:17,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70896 to 57889. [2019-11-16 00:23:17,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57889 states. [2019-11-16 00:23:17,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57889 states to 57889 states and 203149 transitions. [2019-11-16 00:23:17,589 INFO L78 Accepts]: Start accepts. Automaton has 57889 states and 203149 transitions. Word has length 53 [2019-11-16 00:23:17,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:17,589 INFO L462 AbstractCegarLoop]: Abstraction has 57889 states and 203149 transitions. [2019-11-16 00:23:17,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:23:17,589 INFO L276 IsEmpty]: Start isEmpty. Operand 57889 states and 203149 transitions. [2019-11-16 00:23:17,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-16 00:23:17,603 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:17,603 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:17,604 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:23:17,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:17,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1024333734, now seen corresponding path program 1 times [2019-11-16 00:23:17,604 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:17,604 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899949743] [2019-11-16 00:23:17,604 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:17,604 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:17,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:17,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:17,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:17,658 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899949743] [2019-11-16 00:23:17,658 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:17,658 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:23:17,658 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938562506] [2019-11-16 00:23:17,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:23:17,659 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:17,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:23:17,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:23:17,659 INFO L87 Difference]: Start difference. First operand 57889 states and 203149 transitions. Second operand 3 states. [2019-11-16 00:23:17,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:17,860 INFO L93 Difference]: Finished difference Result 43855 states and 152832 transitions. [2019-11-16 00:23:17,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:23:17,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-16 00:23:17,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:17,953 INFO L225 Difference]: With dead ends: 43855 [2019-11-16 00:23:17,953 INFO L226 Difference]: Without dead ends: 43351 [2019-11-16 00:23:17,953 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:23:18,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43351 states. [2019-11-16 00:23:18,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43351 to 41885. [2019-11-16 00:23:18,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41885 states. [2019-11-16 00:23:18,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41885 states to 41885 states and 146703 transitions. [2019-11-16 00:23:18,735 INFO L78 Accepts]: Start accepts. Automaton has 41885 states and 146703 transitions. Word has length 53 [2019-11-16 00:23:18,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:18,735 INFO L462 AbstractCegarLoop]: Abstraction has 41885 states and 146703 transitions. [2019-11-16 00:23:18,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:23:18,735 INFO L276 IsEmpty]: Start isEmpty. Operand 41885 states and 146703 transitions. [2019-11-16 00:23:18,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-16 00:23:18,747 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:18,747 INFO L380 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] [2019-11-16 00:23:18,747 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:23:18,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:18,748 INFO L82 PathProgramCache]: Analyzing trace with hash 765117548, now seen corresponding path program 1 times [2019-11-16 00:23:18,748 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:18,748 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941407950] [2019-11-16 00:23:18,749 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:18,749 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:18,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:18,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:18,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:18,843 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941407950] [2019-11-16 00:23:19,385 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:19,386 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:23:19,386 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102845660] [2019-11-16 00:23:19,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:23:19,386 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:19,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:23:19,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:23:19,387 INFO L87 Difference]: Start difference. First operand 41885 states and 146703 transitions. Second operand 6 states. [2019-11-16 00:23:20,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:20,072 INFO L93 Difference]: Finished difference Result 54548 states and 184833 transitions. [2019-11-16 00:23:20,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:23:20,072 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-11-16 00:23:20,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:20,190 INFO L225 Difference]: With dead ends: 54548 [2019-11-16 00:23:20,190 INFO L226 Difference]: Without dead ends: 54548 [2019-11-16 00:23:20,190 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:23:20,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54548 states. [2019-11-16 00:23:21,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54548 to 45860. [2019-11-16 00:23:21,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45860 states. [2019-11-16 00:23:21,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45860 states to 45860 states and 158166 transitions. [2019-11-16 00:23:21,132 INFO L78 Accepts]: Start accepts. Automaton has 45860 states and 158166 transitions. Word has length 54 [2019-11-16 00:23:21,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:21,132 INFO L462 AbstractCegarLoop]: Abstraction has 45860 states and 158166 transitions. [2019-11-16 00:23:21,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:23:21,132 INFO L276 IsEmpty]: Start isEmpty. Operand 45860 states and 158166 transitions. [2019-11-16 00:23:21,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-16 00:23:21,144 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:21,144 INFO L380 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] [2019-11-16 00:23:21,144 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:23:21,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:21,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1652621229, now seen corresponding path program 1 times [2019-11-16 00:23:21,144 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:21,145 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380789976] [2019-11-16 00:23:21,145 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:21,145 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:21,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:21,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:21,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:21,242 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380789976] [2019-11-16 00:23:21,242 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:21,242 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:23:21,242 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863766205] [2019-11-16 00:23:21,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:23:21,243 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:21,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:23:21,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:23:21,244 INFO L87 Difference]: Start difference. First operand 45860 states and 158166 transitions. Second operand 4 states. [2019-11-16 00:23:21,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:21,307 INFO L93 Difference]: Finished difference Result 8162 states and 24870 transitions. [2019-11-16 00:23:21,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:23:21,307 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-11-16 00:23:21,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:21,318 INFO L225 Difference]: With dead ends: 8162 [2019-11-16 00:23:21,318 INFO L226 Difference]: Without dead ends: 6753 [2019-11-16 00:23:21,318 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:23:21,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6753 states. [2019-11-16 00:23:21,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6753 to 6705. [2019-11-16 00:23:21,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6705 states. [2019-11-16 00:23:21,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6705 states to 6705 states and 20039 transitions. [2019-11-16 00:23:21,415 INFO L78 Accepts]: Start accepts. Automaton has 6705 states and 20039 transitions. Word has length 54 [2019-11-16 00:23:21,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:21,416 INFO L462 AbstractCegarLoop]: Abstraction has 6705 states and 20039 transitions. [2019-11-16 00:23:21,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:23:21,416 INFO L276 IsEmpty]: Start isEmpty. Operand 6705 states and 20039 transitions. [2019-11-16 00:23:21,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-16 00:23:21,420 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:21,420 INFO L380 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] [2019-11-16 00:23:21,420 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:23:21,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:21,420 INFO L82 PathProgramCache]: Analyzing trace with hash 779185304, now seen corresponding path program 1 times [2019-11-16 00:23:21,421 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:21,421 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581791805] [2019-11-16 00:23:21,421 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:21,421 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:21,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:21,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:21,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:21,476 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581791805] [2019-11-16 00:23:21,476 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:21,476 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:23:21,476 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254679530] [2019-11-16 00:23:21,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:23:21,477 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:21,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:23:21,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:23:21,478 INFO L87 Difference]: Start difference. First operand 6705 states and 20039 transitions. Second operand 4 states. [2019-11-16 00:23:21,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:21,665 INFO L93 Difference]: Finished difference Result 7890 states and 23388 transitions. [2019-11-16 00:23:21,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:23:21,666 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-11-16 00:23:21,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:21,681 INFO L225 Difference]: With dead ends: 7890 [2019-11-16 00:23:21,681 INFO L226 Difference]: Without dead ends: 7890 [2019-11-16 00:23:21,682 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:23:21,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7890 states. [2019-11-16 00:23:21,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7890 to 7212. [2019-11-16 00:23:21,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7212 states. [2019-11-16 00:23:21,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7212 states to 7212 states and 21445 transitions. [2019-11-16 00:23:21,826 INFO L78 Accepts]: Start accepts. Automaton has 7212 states and 21445 transitions. Word has length 63 [2019-11-16 00:23:21,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:21,827 INFO L462 AbstractCegarLoop]: Abstraction has 7212 states and 21445 transitions. [2019-11-16 00:23:21,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:23:21,827 INFO L276 IsEmpty]: Start isEmpty. Operand 7212 states and 21445 transitions. [2019-11-16 00:23:21,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-16 00:23:21,833 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:21,834 INFO L380 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] [2019-11-16 00:23:21,834 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:23:21,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:21,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1772971657, now seen corresponding path program 1 times [2019-11-16 00:23:21,835 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:21,835 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406990818] [2019-11-16 00:23:21,835 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:21,835 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:21,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:21,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:21,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:21,908 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406990818] [2019-11-16 00:23:21,909 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:21,909 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:23:21,909 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209227553] [2019-11-16 00:23:21,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:23:21,909 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:21,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:23:21,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:23:21,910 INFO L87 Difference]: Start difference. First operand 7212 states and 21445 transitions. Second operand 6 states. [2019-11-16 00:23:22,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:22,382 INFO L93 Difference]: Finished difference Result 9267 states and 27194 transitions. [2019-11-16 00:23:22,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:23:22,382 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2019-11-16 00:23:22,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:22,395 INFO L225 Difference]: With dead ends: 9267 [2019-11-16 00:23:22,395 INFO L226 Difference]: Without dead ends: 9219 [2019-11-16 00:23:22,395 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:23:22,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9219 states. [2019-11-16 00:23:22,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9219 to 8051. [2019-11-16 00:23:22,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8051 states. [2019-11-16 00:23:22,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8051 states to 8051 states and 23825 transitions. [2019-11-16 00:23:22,523 INFO L78 Accepts]: Start accepts. Automaton has 8051 states and 23825 transitions. Word has length 63 [2019-11-16 00:23:22,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:22,523 INFO L462 AbstractCegarLoop]: Abstraction has 8051 states and 23825 transitions. [2019-11-16 00:23:22,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:23:22,524 INFO L276 IsEmpty]: Start isEmpty. Operand 8051 states and 23825 transitions. [2019-11-16 00:23:22,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-16 00:23:22,534 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:22,534 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:22,534 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:23:22,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:22,535 INFO L82 PathProgramCache]: Analyzing trace with hash 238487578, now seen corresponding path program 1 times [2019-11-16 00:23:22,535 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:22,535 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613754372] [2019-11-16 00:23:22,535 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:22,536 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:22,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:22,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:22,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:22,642 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613754372] [2019-11-16 00:23:22,643 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:22,643 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:23:22,643 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906479589] [2019-11-16 00:23:22,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:23:22,643 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:22,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:23:22,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:23:22,644 INFO L87 Difference]: Start difference. First operand 8051 states and 23825 transitions. Second operand 4 states. [2019-11-16 00:23:22,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:22,967 INFO L93 Difference]: Finished difference Result 10664 states and 31174 transitions. [2019-11-16 00:23:22,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:23:22,968 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-11-16 00:23:22,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:22,988 INFO L225 Difference]: With dead ends: 10664 [2019-11-16 00:23:22,988 INFO L226 Difference]: Without dead ends: 10664 [2019-11-16 00:23:22,989 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:23:23,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10664 states. [2019-11-16 00:23:23,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10664 to 9074. [2019-11-16 00:23:23,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9074 states. [2019-11-16 00:23:23,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9074 states to 9074 states and 26644 transitions. [2019-11-16 00:23:23,181 INFO L78 Accepts]: Start accepts. Automaton has 9074 states and 26644 transitions. Word has length 67 [2019-11-16 00:23:23,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:23,181 INFO L462 AbstractCegarLoop]: Abstraction has 9074 states and 26644 transitions. [2019-11-16 00:23:23,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:23:23,182 INFO L276 IsEmpty]: Start isEmpty. Operand 9074 states and 26644 transitions. [2019-11-16 00:23:23,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-16 00:23:23,195 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:23,195 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:23,196 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:23:23,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:23,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1483252059, now seen corresponding path program 1 times [2019-11-16 00:23:23,196 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:23,197 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908632810] [2019-11-16 00:23:23,197 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:23,197 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:23,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:23,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:23,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:23,353 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908632810] [2019-11-16 00:23:23,354 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:23,354 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:23:23,354 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24803076] [2019-11-16 00:23:23,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:23:23,355 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:23,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:23:23,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:23:23,355 INFO L87 Difference]: Start difference. First operand 9074 states and 26644 transitions. Second operand 6 states. [2019-11-16 00:23:24,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:24,082 INFO L93 Difference]: Finished difference Result 10384 states and 29895 transitions. [2019-11-16 00:23:24,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:23:24,083 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-11-16 00:23:24,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:24,101 INFO L225 Difference]: With dead ends: 10384 [2019-11-16 00:23:24,102 INFO L226 Difference]: Without dead ends: 10384 [2019-11-16 00:23:24,103 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:23:24,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10384 states. [2019-11-16 00:23:24,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10384 to 10081. [2019-11-16 00:23:24,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10081 states. [2019-11-16 00:23:24,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10081 states to 10081 states and 29118 transitions. [2019-11-16 00:23:24,296 INFO L78 Accepts]: Start accepts. Automaton has 10081 states and 29118 transitions. Word has length 67 [2019-11-16 00:23:24,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:24,297 INFO L462 AbstractCegarLoop]: Abstraction has 10081 states and 29118 transitions. [2019-11-16 00:23:24,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:23:24,297 INFO L276 IsEmpty]: Start isEmpty. Operand 10081 states and 29118 transitions. [2019-11-16 00:23:24,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-16 00:23:24,308 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:24,308 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:24,308 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:23:24,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:24,309 INFO L82 PathProgramCache]: Analyzing trace with hash -593957284, now seen corresponding path program 1 times [2019-11-16 00:23:24,309 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:24,309 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156972714] [2019-11-16 00:23:24,309 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:24,309 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:24,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:24,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:24,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:24,443 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156972714] [2019-11-16 00:23:24,444 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:24,444 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:23:24,444 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404108784] [2019-11-16 00:23:24,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:23:24,445 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:24,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:23:24,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:23:24,446 INFO L87 Difference]: Start difference. First operand 10081 states and 29118 transitions. Second operand 6 states. [2019-11-16 00:23:24,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:24,832 INFO L93 Difference]: Finished difference Result 11998 states and 33625 transitions. [2019-11-16 00:23:24,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:23:24,833 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-11-16 00:23:24,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:24,847 INFO L225 Difference]: With dead ends: 11998 [2019-11-16 00:23:24,847 INFO L226 Difference]: Without dead ends: 11998 [2019-11-16 00:23:24,847 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:23:24,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11998 states. [2019-11-16 00:23:24,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11998 to 10300. [2019-11-16 00:23:24,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10300 states. [2019-11-16 00:23:24,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10300 states to 10300 states and 29170 transitions. [2019-11-16 00:23:24,989 INFO L78 Accepts]: Start accepts. Automaton has 10300 states and 29170 transitions. Word has length 67 [2019-11-16 00:23:24,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:24,989 INFO L462 AbstractCegarLoop]: Abstraction has 10300 states and 29170 transitions. [2019-11-16 00:23:24,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:23:24,989 INFO L276 IsEmpty]: Start isEmpty. Operand 10300 states and 29170 transitions. [2019-11-16 00:23:24,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-16 00:23:24,999 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:24,999 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:24,999 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:23:24,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:25,000 INFO L82 PathProgramCache]: Analyzing trace with hash -382606371, now seen corresponding path program 1 times [2019-11-16 00:23:25,000 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:25,000 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192281039] [2019-11-16 00:23:25,000 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:25,000 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:25,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:25,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:25,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:25,071 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192281039] [2019-11-16 00:23:25,071 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:25,072 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:23:25,072 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532721647] [2019-11-16 00:23:25,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:23:25,073 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:25,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:23:25,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:23:25,073 INFO L87 Difference]: Start difference. First operand 10300 states and 29170 transitions. Second operand 5 states. [2019-11-16 00:23:25,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:25,481 INFO L93 Difference]: Finished difference Result 12575 states and 35463 transitions. [2019-11-16 00:23:25,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:23:25,481 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-11-16 00:23:25,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:25,501 INFO L225 Difference]: With dead ends: 12575 [2019-11-16 00:23:25,502 INFO L226 Difference]: Without dead ends: 12575 [2019-11-16 00:23:25,502 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:23:25,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12575 states. [2019-11-16 00:23:25,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12575 to 11075. [2019-11-16 00:23:25,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11075 states. [2019-11-16 00:23:25,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11075 states to 11075 states and 31104 transitions. [2019-11-16 00:23:25,676 INFO L78 Accepts]: Start accepts. Automaton has 11075 states and 31104 transitions. Word has length 67 [2019-11-16 00:23:25,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:25,676 INFO L462 AbstractCegarLoop]: Abstraction has 11075 states and 31104 transitions. [2019-11-16 00:23:25,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:23:25,677 INFO L276 IsEmpty]: Start isEmpty. Operand 11075 states and 31104 transitions. [2019-11-16 00:23:25,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-16 00:23:25,685 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:25,686 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:25,686 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:23:25,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:25,686 INFO L82 PathProgramCache]: Analyzing trace with hash -893140548, now seen corresponding path program 1 times [2019-11-16 00:23:25,686 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:25,686 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354634533] [2019-11-16 00:23:25,687 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:25,687 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:25,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:25,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:25,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:25,809 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354634533] [2019-11-16 00:23:25,809 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:25,810 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:23:25,810 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971896976] [2019-11-16 00:23:25,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:23:25,810 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:25,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:23:25,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:23:25,811 INFO L87 Difference]: Start difference. First operand 11075 states and 31104 transitions. Second operand 6 states. [2019-11-16 00:23:25,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:25,933 INFO L93 Difference]: Finished difference Result 11507 states and 31350 transitions. [2019-11-16 00:23:25,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:23:25,933 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-11-16 00:23:25,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:25,949 INFO L225 Difference]: With dead ends: 11507 [2019-11-16 00:23:25,949 INFO L226 Difference]: Without dead ends: 11507 [2019-11-16 00:23:25,950 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:23:25,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11507 states. [2019-11-16 00:23:26,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11507 to 9713. [2019-11-16 00:23:26,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9713 states. [2019-11-16 00:23:26,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9713 states to 9713 states and 26564 transitions. [2019-11-16 00:23:26,091 INFO L78 Accepts]: Start accepts. Automaton has 9713 states and 26564 transitions. Word has length 67 [2019-11-16 00:23:26,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:26,091 INFO L462 AbstractCegarLoop]: Abstraction has 9713 states and 26564 transitions. [2019-11-16 00:23:26,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:23:26,091 INFO L276 IsEmpty]: Start isEmpty. Operand 9713 states and 26564 transitions. [2019-11-16 00:23:26,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-16 00:23:26,097 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:26,097 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:26,098 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:23:26,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:26,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1802588226, now seen corresponding path program 1 times [2019-11-16 00:23:26,098 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:26,098 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880689826] [2019-11-16 00:23:26,098 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:26,098 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:26,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:26,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:26,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:26,184 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880689826] [2019-11-16 00:23:26,184 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:26,184 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:23:26,185 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051108692] [2019-11-16 00:23:26,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:23:26,185 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:26,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:23:26,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:23:26,186 INFO L87 Difference]: Start difference. First operand 9713 states and 26564 transitions. Second operand 5 states. [2019-11-16 00:23:26,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:26,247 INFO L93 Difference]: Finished difference Result 3464 states and 8115 transitions. [2019-11-16 00:23:26,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:23:26,248 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-11-16 00:23:26,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:26,252 INFO L225 Difference]: With dead ends: 3464 [2019-11-16 00:23:26,252 INFO L226 Difference]: Without dead ends: 2956 [2019-11-16 00:23:26,252 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:23:26,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2019-11-16 00:23:26,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 2777. [2019-11-16 00:23:26,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2777 states. [2019-11-16 00:23:26,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2777 states to 2777 states and 6375 transitions. [2019-11-16 00:23:26,298 INFO L78 Accepts]: Start accepts. Automaton has 2777 states and 6375 transitions. Word has length 67 [2019-11-16 00:23:26,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:26,299 INFO L462 AbstractCegarLoop]: Abstraction has 2777 states and 6375 transitions. [2019-11-16 00:23:26,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:23:26,299 INFO L276 IsEmpty]: Start isEmpty. Operand 2777 states and 6375 transitions. [2019-11-16 00:23:26,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-16 00:23:26,303 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:26,304 INFO L380 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] [2019-11-16 00:23:26,304 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:23:26,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:26,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1788146014, now seen corresponding path program 1 times [2019-11-16 00:23:26,305 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:26,305 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862528923] [2019-11-16 00:23:26,305 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:26,305 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:26,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:26,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:26,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:26,478 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862528923] [2019-11-16 00:23:26,478 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:26,478 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:23:26,478 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926995163] [2019-11-16 00:23:26,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:23:26,480 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:26,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:23:26,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:23:26,481 INFO L87 Difference]: Start difference. First operand 2777 states and 6375 transitions. Second operand 6 states. [2019-11-16 00:23:26,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:26,766 INFO L93 Difference]: Finished difference Result 3127 states and 7123 transitions. [2019-11-16 00:23:26,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:23:26,767 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2019-11-16 00:23:26,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:26,771 INFO L225 Difference]: With dead ends: 3127 [2019-11-16 00:23:26,771 INFO L226 Difference]: Without dead ends: 3071 [2019-11-16 00:23:26,771 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:23:26,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3071 states. [2019-11-16 00:23:26,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3071 to 2643. [2019-11-16 00:23:26,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2643 states. [2019-11-16 00:23:26,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2643 states to 2643 states and 6010 transitions. [2019-11-16 00:23:26,811 INFO L78 Accepts]: Start accepts. Automaton has 2643 states and 6010 transitions. Word has length 84 [2019-11-16 00:23:26,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:26,811 INFO L462 AbstractCegarLoop]: Abstraction has 2643 states and 6010 transitions. [2019-11-16 00:23:26,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:23:26,812 INFO L276 IsEmpty]: Start isEmpty. Operand 2643 states and 6010 transitions. [2019-11-16 00:23:26,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-16 00:23:26,815 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:26,815 INFO L380 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] [2019-11-16 00:23:26,816 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:23:26,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:26,816 INFO L82 PathProgramCache]: Analyzing trace with hash 429611939, now seen corresponding path program 1 times [2019-11-16 00:23:26,816 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:26,817 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305034207] [2019-11-16 00:23:26,817 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:26,817 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:26,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:26,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:27,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:27,022 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305034207] [2019-11-16 00:23:27,023 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:27,023 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:23:27,023 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575678553] [2019-11-16 00:23:27,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:23:27,024 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:27,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:23:27,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:23:27,025 INFO L87 Difference]: Start difference. First operand 2643 states and 6010 transitions. Second operand 7 states. [2019-11-16 00:23:27,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:27,108 INFO L93 Difference]: Finished difference Result 4586 states and 10507 transitions. [2019-11-16 00:23:27,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:23:27,109 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2019-11-16 00:23:27,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:27,111 INFO L225 Difference]: With dead ends: 4586 [2019-11-16 00:23:27,111 INFO L226 Difference]: Without dead ends: 2033 [2019-11-16 00:23:27,111 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:23:27,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2033 states. [2019-11-16 00:23:27,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2033 to 2033. [2019-11-16 00:23:27,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2033 states. [2019-11-16 00:23:27,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2033 states to 2033 states and 4646 transitions. [2019-11-16 00:23:27,130 INFO L78 Accepts]: Start accepts. Automaton has 2033 states and 4646 transitions. Word has length 84 [2019-11-16 00:23:27,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:27,131 INFO L462 AbstractCegarLoop]: Abstraction has 2033 states and 4646 transitions. [2019-11-16 00:23:27,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:23:27,131 INFO L276 IsEmpty]: Start isEmpty. Operand 2033 states and 4646 transitions. [2019-11-16 00:23:27,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-16 00:23:27,132 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:27,133 INFO L380 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] [2019-11-16 00:23:27,133 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:23:27,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:27,133 INFO L82 PathProgramCache]: Analyzing trace with hash 605039045, now seen corresponding path program 2 times [2019-11-16 00:23:27,133 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:27,133 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590512437] [2019-11-16 00:23:27,133 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:27,133 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:27,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:27,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:23:27,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:23:27,216 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:23:27,216 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-16 00:23:27,370 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-16 00:23:27,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:23:27 BasicIcfg [2019-11-16 00:23:27,372 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:23:27,372 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:23:27,372 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:23:27,372 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:23:27,373 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:22:59" (3/4) ... [2019-11-16 00:23:27,375 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-16 00:23:27,549 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_ea09b320-aa58-4a6b-8aec-8ab08f1b4f1f/bin/uautomizer/witness.graphml [2019-11-16 00:23:27,550 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:23:27,552 INFO L168 Benchmark]: Toolchain (without parser) took 30048.68 ms. Allocated memory was 1.0 GB in the beginning and 3.2 GB in the end (delta: 2.2 GB). Free memory was 946.1 MB in the beginning and 2.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-11-16 00:23:27,553 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:23:27,553 INFO L168 Benchmark]: CACSL2BoogieTranslator took 644.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -180.1 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:23:27,554 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.19 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:23:27,554 INFO L168 Benchmark]: Boogie Preprocessor took 58.65 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:23:27,554 INFO L168 Benchmark]: RCFGBuilder took 746.65 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: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:23:27,555 INFO L168 Benchmark]: TraceAbstraction took 28347.19 ms. Allocated memory was 1.2 GB in the beginning and 3.2 GB in the end (delta: 2.1 GB). Free memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: -979.5 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-11-16 00:23:27,555 INFO L168 Benchmark]: Witness Printer took 177.79 ms. Allocated memory is still 3.2 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:23:27,557 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 644.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -180.1 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 69.19 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 58.65 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 746.65 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: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 28347.19 ms. Allocated memory was 1.2 GB in the beginning and 3.2 GB in the end (delta: 2.1 GB). Free memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: -979.5 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 177.79 ms. Allocated memory is still 3.2 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 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: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L699] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L701] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L702] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L703] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L705] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L706] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L707] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L708] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L709] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L710] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L711] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L712] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L713] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L714] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L715] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L716] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L717] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L718] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L719] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L721] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L722] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L723] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L799] 0 pthread_t t1639; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L800] FCALL, FORK 0 pthread_create(&t1639, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L801] 0 pthread_t t1640; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L802] FCALL, FORK 0 pthread_create(&t1640, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L757] 2 x$w_buff1 = x$w_buff0 [L758] 2 x$w_buff0 = 1 [L759] 2 x$w_buff1_used = x$w_buff0_used [L760] 2 x$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L762] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L763] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L764] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L765] 2 x$r_buff0_thd2 = (_Bool)1 [L768] 2 y = 1 [L771] 2 __unbuffered_p1_EAX = y [L774] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L727] 1 y = 2 [L732] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L733] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L734] 1 x$flush_delayed = weak$$choice2 [L735] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L737] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L737] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L738] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L739] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L739] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L740] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L741] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L742] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L742] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] 1 x = x$flush_delayed ? x$mem_tmp : x [L745] 1 x$flush_delayed = (_Bool)0 [L750] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L777] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L779] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L780] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L781] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L784] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L804] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L809] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L809] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L810] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L810] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L811] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L811] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L812] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L812] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L815] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 195 locations, 3 error locations. Result: UNSAFE, OverallTime: 28.1s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 11.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5035 SDtfs, 6149 SDslu, 9653 SDs, 0 SdLazy, 3763 SolverSat, 318 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 163 GetRequests, 49 SyntacticMatches, 7 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57889occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 11.0s AutomataMinimizationTime, 20 MinimizatonAttempts, 57426 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1280 NumberOfCodeBlocks, 1280 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1176 ConstructedInterpolants, 0 QuantifiedInterpolants, 221999 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...