./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix031_tso.oepc.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_ea891ab3-3e52-4014-bad0-baeccdb047e1/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ea891ab3-3e52-4014-bad0-baeccdb047e1/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ea891ab3-3e52-4014-bad0-baeccdb047e1/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ea891ab3-3e52-4014-bad0-baeccdb047e1/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix031_tso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_ea891ab3-3e52-4014-bad0-baeccdb047e1/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ea891ab3-3e52-4014-bad0-baeccdb047e1/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 7b5d7369926368b2e5be55a7d8f704223c826e06 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-15 20:12:32,356 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:12:32,357 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:12:32,368 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:12:32,368 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:12:32,369 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:12:32,371 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:12:32,373 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:12:32,375 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:12:32,376 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:12:32,376 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:12:32,378 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:12:32,378 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:12:32,379 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:12:32,380 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:12:32,381 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:12:32,381 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:12:32,382 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:12:32,384 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:12:32,386 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:12:32,388 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:12:32,389 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:12:32,391 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:12:32,391 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:12:32,394 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:12:32,395 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:12:32,395 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:12:32,396 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:12:32,396 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:12:32,397 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:12:32,398 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:12:32,398 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:12:32,399 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:12:32,400 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:12:32,401 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:12:32,401 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:12:32,402 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:12:32,402 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:12:32,402 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:12:32,403 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:12:32,404 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:12:32,404 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ea891ab3-3e52-4014-bad0-baeccdb047e1/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 20:12:32,418 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:12:32,419 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:12:32,420 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:12:32,420 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:12:32,420 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:12:32,421 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:12:32,421 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:12:32,421 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:12:32,421 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:12:32,421 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:12:32,422 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 20:12:32,422 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 20:12:32,422 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 20:12:32,422 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:12:32,423 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:12:32,423 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:12:32,423 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 20:12:32,423 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:12:32,424 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:12:32,424 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 20:12:32,424 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 20:12:32,424 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:12:32,425 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:12:32,425 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 20:12:32,425 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 20:12:32,425 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:12:32,426 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 20:12:32,426 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 20:12:32,426 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_ea891ab3-3e52-4014-bad0-baeccdb047e1/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 -> 7b5d7369926368b2e5be55a7d8f704223c826e06 [2019-11-15 20:12:32,453 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:12:32,464 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:12:32,467 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:12:32,468 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:12:32,469 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:12:32,469 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ea891ab3-3e52-4014-bad0-baeccdb047e1/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix031_tso.oepc.i [2019-11-15 20:12:32,528 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ea891ab3-3e52-4014-bad0-baeccdb047e1/bin/uautomizer/data/95d6efa6d/380205d83ac644c6b502bdadcbc0bc44/FLAG0f11e3563 [2019-11-15 20:12:32,970 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:12:32,971 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ea891ab3-3e52-4014-bad0-baeccdb047e1/sv-benchmarks/c/pthread-wmm/mix031_tso.oepc.i [2019-11-15 20:12:32,990 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ea891ab3-3e52-4014-bad0-baeccdb047e1/bin/uautomizer/data/95d6efa6d/380205d83ac644c6b502bdadcbc0bc44/FLAG0f11e3563 [2019-11-15 20:12:33,271 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ea891ab3-3e52-4014-bad0-baeccdb047e1/bin/uautomizer/data/95d6efa6d/380205d83ac644c6b502bdadcbc0bc44 [2019-11-15 20:12:33,274 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:12:33,275 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:12:33,276 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:12:33,276 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:12:33,280 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:12:33,280 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:12:33" (1/1) ... [2019-11-15 20:12:33,283 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e5ba24a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:12:33, skipping insertion in model container [2019-11-15 20:12:33,283 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:12:33" (1/1) ... [2019-11-15 20:12:33,290 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:12:33,347 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:12:33,807 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:12:33,821 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:12:33,934 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:12:34,021 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:12:34,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:12:34 WrapperNode [2019-11-15 20:12:34,022 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:12:34,023 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:12:34,023 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:12:34,023 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:12:34,032 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:12:34" (1/1) ... [2019-11-15 20:12:34,071 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:12:34" (1/1) ... [2019-11-15 20:12:34,095 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:12:34,096 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:12:34,096 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:12:34,096 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:12:34,106 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:12:34" (1/1) ... [2019-11-15 20:12:34,106 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:12:34" (1/1) ... [2019-11-15 20:12:34,110 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:12:34" (1/1) ... [2019-11-15 20:12:34,110 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:12:34" (1/1) ... [2019-11-15 20:12:34,123 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:12:34" (1/1) ... [2019-11-15 20:12:34,128 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:12:34" (1/1) ... [2019-11-15 20:12:34,132 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:12:34" (1/1) ... [2019-11-15 20:12:34,137 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:12:34,146 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:12:34,146 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:12:34,146 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:12:34,147 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:12:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea891ab3-3e52-4014-bad0-baeccdb047e1/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-15 20:12:34,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 20:12:34,228 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-15 20:12:34,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 20:12:34,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 20:12:34,230 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-15 20:12:34,230 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-15 20:12:34,231 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-15 20:12:34,231 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-15 20:12:34,231 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-15 20:12:34,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:12:34,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:12:34,238 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-15 20:12:34,938 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:12:34,939 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 20:12:34,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:12:34 BoogieIcfgContainer [2019-11-15 20:12:34,940 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:12:34,941 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 20:12:34,941 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 20:12:34,944 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 20:12:34,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 08:12:33" (1/3) ... [2019-11-15 20:12:34,945 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e1b7e50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:12:34, skipping insertion in model container [2019-11-15 20:12:34,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:12:34" (2/3) ... [2019-11-15 20:12:34,945 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e1b7e50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:12:34, skipping insertion in model container [2019-11-15 20:12:34,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:12:34" (3/3) ... [2019-11-15 20:12:34,949 INFO L109 eAbstractionObserver]: Analyzing ICFG mix031_tso.oepc.i [2019-11-15 20:12:35,000 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,000 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,000 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,001 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,001 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,001 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,001 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,002 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,002 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,002 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,002 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,003 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,003 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,003 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,003 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,004 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,004 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,004 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,004 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,004 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,004 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,005 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,005 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,005 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,005 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,005 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,006 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,006 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,006 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,006 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,007 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,007 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,007 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,007 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,008 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,008 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,008 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,009 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,009 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,009 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,009 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,009 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,010 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,010 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,010 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,010 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,010 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,011 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,011 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,015 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,015 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,016 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,016 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,016 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,016 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,016 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,017 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,018 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,018 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,018 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,018 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,018 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,019 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,019 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,019 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,019 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,019 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,020 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,020 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,020 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,020 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,021 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,021 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,021 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,022 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,022 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,022 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,022 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,022 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,023 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,023 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,023 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,023 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,023 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,024 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,024 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,024 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,024 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,024 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,024 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,025 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,025 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,025 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,026 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,026 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,026 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,026 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,026 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,027 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,027 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,027 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,031 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,032 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,032 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,033 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,034 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,034 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,035 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,035 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,035 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,036 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,036 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,037 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,044 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,045 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,045 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,045 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,045 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,045 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,045 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,046 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,046 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,046 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,046 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,046 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,046 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,047 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,047 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,047 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,047 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,047 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,048 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,048 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,048 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,049 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,049 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,049 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,050 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,050 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,050 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,050 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,050 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,051 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,051 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,051 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,051 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,051 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,051 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,052 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,052 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,052 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,052 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:12:35,060 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-15 20:12:35,061 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 20:12:35,072 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-15 20:12:35,083 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-15 20:12:35,102 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 20:12:35,102 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 20:12:35,102 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 20:12:35,103 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:12:35,103 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:12:35,103 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 20:12:35,103 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:12:35,103 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 20:12:35,126 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 144 places, 182 transitions [2019-11-15 20:12:37,941 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32594 states. [2019-11-15 20:12:37,943 INFO L276 IsEmpty]: Start isEmpty. Operand 32594 states. [2019-11-15 20:12:37,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-15 20:12:37,954 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:12:37,955 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] [2019-11-15 20:12:37,959 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:12:37,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:12:37,965 INFO L82 PathProgramCache]: Analyzing trace with hash -867481609, now seen corresponding path program 1 times [2019-11-15 20:12:37,973 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:12:37,974 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958122481] [2019-11-15 20:12:37,975 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:12:37,975 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:12:37,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:12:38,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:12:38,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:12:38,325 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958122481] [2019-11-15 20:12:38,326 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:12:38,327 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:12:38,327 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315761759] [2019-11-15 20:12:38,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:12:38,332 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:12:38,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:12:38,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:12:38,348 INFO L87 Difference]: Start difference. First operand 32594 states. Second operand 4 states. [2019-11-15 20:12:39,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:12:39,242 INFO L93 Difference]: Finished difference Result 33594 states and 129571 transitions. [2019-11-15 20:12:39,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:12:39,244 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-11-15 20:12:39,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:12:39,498 INFO L225 Difference]: With dead ends: 33594 [2019-11-15 20:12:39,498 INFO L226 Difference]: Without dead ends: 25706 [2019-11-15 20:12:39,501 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-15 20:12:39,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25706 states. [2019-11-15 20:12:40,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25706 to 25706. [2019-11-15 20:12:40,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25706 states. [2019-11-15 20:12:41,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25706 states to 25706 states and 99587 transitions. [2019-11-15 20:12:41,080 INFO L78 Accepts]: Start accepts. Automaton has 25706 states and 99587 transitions. Word has length 37 [2019-11-15 20:12:41,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:12:41,081 INFO L462 AbstractCegarLoop]: Abstraction has 25706 states and 99587 transitions. [2019-11-15 20:12:41,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:12:41,081 INFO L276 IsEmpty]: Start isEmpty. Operand 25706 states and 99587 transitions. [2019-11-15 20:12:41,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 20:12:41,090 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:12:41,090 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-15 20:12:41,091 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:12:41,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:12:41,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1683273565, now seen corresponding path program 1 times [2019-11-15 20:12:41,092 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:12:41,092 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951965901] [2019-11-15 20:12:41,092 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:12:41,092 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:12:41,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:12:41,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:12:41,221 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-15 20:12:41,221 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951965901] [2019-11-15 20:12:41,221 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:12:41,222 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:12:41,222 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353304759] [2019-11-15 20:12:41,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:12:41,223 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:12:41,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:12:41,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:12:41,224 INFO L87 Difference]: Start difference. First operand 25706 states and 99587 transitions. Second operand 5 states. [2019-11-15 20:12:42,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:12:42,126 INFO L93 Difference]: Finished difference Result 41084 states and 150434 transitions. [2019-11-15 20:12:42,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:12:42,127 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-11-15 20:12:42,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:12:42,287 INFO L225 Difference]: With dead ends: 41084 [2019-11-15 20:12:42,288 INFO L226 Difference]: Without dead ends: 40548 [2019-11-15 20:12:42,289 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-15 20:12:42,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40548 states. [2019-11-15 20:12:43,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40548 to 38928. [2019-11-15 20:12:43,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38928 states. [2019-11-15 20:12:43,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38928 states to 38928 states and 143584 transitions. [2019-11-15 20:12:43,947 INFO L78 Accepts]: Start accepts. Automaton has 38928 states and 143584 transitions. Word has length 49 [2019-11-15 20:12:43,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:12:43,949 INFO L462 AbstractCegarLoop]: Abstraction has 38928 states and 143584 transitions. [2019-11-15 20:12:43,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:12:43,949 INFO L276 IsEmpty]: Start isEmpty. Operand 38928 states and 143584 transitions. [2019-11-15 20:12:43,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-15 20:12:43,956 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:12:43,956 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] [2019-11-15 20:12:43,957 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:12:43,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:12:43,957 INFO L82 PathProgramCache]: Analyzing trace with hash -506632681, now seen corresponding path program 1 times [2019-11-15 20:12:43,957 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:12:43,958 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516716844] [2019-11-15 20:12:43,958 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:12:43,958 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:12:43,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:12:43,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:12:44,039 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-15 20:12:44,040 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516716844] [2019-11-15 20:12:44,040 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:12:44,040 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:12:44,041 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900554328] [2019-11-15 20:12:44,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:12:44,043 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:12:44,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:12:44,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:12:44,044 INFO L87 Difference]: Start difference. First operand 38928 states and 143584 transitions. Second operand 5 states. [2019-11-15 20:12:44,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:12:44,693 INFO L93 Difference]: Finished difference Result 49781 states and 180636 transitions. [2019-11-15 20:12:44,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:12:44,693 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-11-15 20:12:44,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:12:45,535 INFO L225 Difference]: With dead ends: 49781 [2019-11-15 20:12:45,535 INFO L226 Difference]: Without dead ends: 49277 [2019-11-15 20:12:45,536 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-15 20:12:45,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49277 states. [2019-11-15 20:12:46,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49277 to 42680. [2019-11-15 20:12:46,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42680 states. [2019-11-15 20:12:46,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42680 states to 42680 states and 156595 transitions. [2019-11-15 20:12:46,664 INFO L78 Accepts]: Start accepts. Automaton has 42680 states and 156595 transitions. Word has length 50 [2019-11-15 20:12:46,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:12:46,664 INFO L462 AbstractCegarLoop]: Abstraction has 42680 states and 156595 transitions. [2019-11-15 20:12:46,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:12:46,665 INFO L276 IsEmpty]: Start isEmpty. Operand 42680 states and 156595 transitions. [2019-11-15 20:12:46,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 20:12:46,674 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:12:46,675 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] [2019-11-15 20:12:46,675 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:12:46,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:12:46,676 INFO L82 PathProgramCache]: Analyzing trace with hash -571471363, now seen corresponding path program 1 times [2019-11-15 20:12:46,676 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:12:46,676 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514826625] [2019-11-15 20:12:46,676 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:12:46,676 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:12:46,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:12:46,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:12:46,727 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-15 20:12:46,727 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514826625] [2019-11-15 20:12:46,728 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:12:46,728 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:12:46,728 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182364715] [2019-11-15 20:12:46,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:12:46,729 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:12:46,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:12:46,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:12:46,729 INFO L87 Difference]: Start difference. First operand 42680 states and 156595 transitions. Second operand 3 states. [2019-11-15 20:12:47,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:12:47,008 INFO L93 Difference]: Finished difference Result 61090 states and 221433 transitions. [2019-11-15 20:12:47,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:12:47,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-15 20:12:47,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:12:47,187 INFO L225 Difference]: With dead ends: 61090 [2019-11-15 20:12:47,187 INFO L226 Difference]: Without dead ends: 61090 [2019-11-15 20:12:47,188 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-15 20:12:48,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61090 states. [2019-11-15 20:12:48,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61090 to 48019. [2019-11-15 20:12:48,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48019 states. [2019-11-15 20:12:49,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48019 states to 48019 states and 174182 transitions. [2019-11-15 20:12:49,075 INFO L78 Accepts]: Start accepts. Automaton has 48019 states and 174182 transitions. Word has length 52 [2019-11-15 20:12:49,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:12:49,076 INFO L462 AbstractCegarLoop]: Abstraction has 48019 states and 174182 transitions. [2019-11-15 20:12:49,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:12:49,076 INFO L276 IsEmpty]: Start isEmpty. Operand 48019 states and 174182 transitions. [2019-11-15 20:12:49,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-15 20:12:49,096 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:12:49,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] [2019-11-15 20:12:49,097 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:12:49,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:12:49,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1136591846, now seen corresponding path program 1 times [2019-11-15 20:12:49,098 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:12:49,098 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27186667] [2019-11-15 20:12:49,098 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:12:49,098 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:12:49,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:12:49,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:12:49,261 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-15 20:12:49,261 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27186667] [2019-11-15 20:12:49,261 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:12:49,262 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:12:49,262 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034083572] [2019-11-15 20:12:49,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:12:49,262 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:12:49,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:12:49,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:12:49,263 INFO L87 Difference]: Start difference. First operand 48019 states and 174182 transitions. Second operand 6 states. [2019-11-15 20:12:53,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:12:53,027 INFO L93 Difference]: Finished difference Result 63759 states and 229382 transitions. [2019-11-15 20:12:53,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:12:53,028 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-11-15 20:12:53,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:12:53,184 INFO L225 Difference]: With dead ends: 63759 [2019-11-15 20:12:53,185 INFO L226 Difference]: Without dead ends: 63759 [2019-11-15 20:12:53,185 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-15 20:12:53,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63759 states. [2019-11-15 20:12:54,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63759 to 59952. [2019-11-15 20:12:54,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59952 states. [2019-11-15 20:12:54,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59952 states to 59952 states and 215675 transitions. [2019-11-15 20:12:54,395 INFO L78 Accepts]: Start accepts. Automaton has 59952 states and 215675 transitions. Word has length 56 [2019-11-15 20:12:54,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:12:54,396 INFO L462 AbstractCegarLoop]: Abstraction has 59952 states and 215675 transitions. [2019-11-15 20:12:54,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:12:54,396 INFO L276 IsEmpty]: Start isEmpty. Operand 59952 states and 215675 transitions. [2019-11-15 20:12:54,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-15 20:12:54,415 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:12:54,415 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] [2019-11-15 20:12:54,415 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:12:54,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:12:54,416 INFO L82 PathProgramCache]: Analyzing trace with hash -660359513, now seen corresponding path program 1 times [2019-11-15 20:12:54,416 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:12:54,416 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779936236] [2019-11-15 20:12:54,416 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:12:54,417 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:12:54,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:12:54,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:12:54,560 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-15 20:12:54,561 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779936236] [2019-11-15 20:12:54,561 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:12:54,561 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 20:12:54,561 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314543980] [2019-11-15 20:12:54,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:12:54,562 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:12:54,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:12:54,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:12:54,562 INFO L87 Difference]: Start difference. First operand 59952 states and 215675 transitions. Second operand 7 states. [2019-11-15 20:12:55,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:12:55,860 INFO L93 Difference]: Finished difference Result 83688 states and 290100 transitions. [2019-11-15 20:12:55,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 20:12:55,860 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-11-15 20:12:55,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:12:56,087 INFO L225 Difference]: With dead ends: 83688 [2019-11-15 20:12:56,088 INFO L226 Difference]: Without dead ends: 83688 [2019-11-15 20:12:56,088 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-15 20:12:57,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83688 states. [2019-11-15 20:12:58,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83688 to 71015. [2019-11-15 20:12:58,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71015 states. [2019-11-15 20:12:58,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71015 states to 71015 states and 249889 transitions. [2019-11-15 20:12:58,264 INFO L78 Accepts]: Start accepts. Automaton has 71015 states and 249889 transitions. Word has length 56 [2019-11-15 20:12:58,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:12:58,265 INFO L462 AbstractCegarLoop]: Abstraction has 71015 states and 249889 transitions. [2019-11-15 20:12:58,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:12:58,265 INFO L276 IsEmpty]: Start isEmpty. Operand 71015 states and 249889 transitions. [2019-11-15 20:12:58,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-15 20:12:58,278 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:12:58,278 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] [2019-11-15 20:12:58,278 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:12:58,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:12:58,279 INFO L82 PathProgramCache]: Analyzing trace with hash 227144168, now seen corresponding path program 1 times [2019-11-15 20:12:58,279 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:12:58,279 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360204325] [2019-11-15 20:12:58,279 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:12:58,279 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:12:58,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:12:58,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:12:58,379 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-15 20:12:58,379 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360204325] [2019-11-15 20:12:58,379 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:12:58,380 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:12:58,380 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816159562] [2019-11-15 20:12:58,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:12:58,380 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:12:58,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:12:58,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:12:58,381 INFO L87 Difference]: Start difference. First operand 71015 states and 249889 transitions. Second operand 4 states. [2019-11-15 20:12:58,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:12:58,464 INFO L93 Difference]: Finished difference Result 12162 states and 37832 transitions. [2019-11-15 20:12:58,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:12:58,465 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-11-15 20:12:58,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:12:58,484 INFO L225 Difference]: With dead ends: 12162 [2019-11-15 20:12:58,485 INFO L226 Difference]: Without dead ends: 10677 [2019-11-15 20:12:58,485 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-15 20:12:58,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10677 states. [2019-11-15 20:12:58,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10677 to 10628. [2019-11-15 20:12:58,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10628 states. [2019-11-15 20:12:58,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10628 states to 10628 states and 32594 transitions. [2019-11-15 20:12:58,688 INFO L78 Accepts]: Start accepts. Automaton has 10628 states and 32594 transitions. Word has length 56 [2019-11-15 20:12:58,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:12:58,689 INFO L462 AbstractCegarLoop]: Abstraction has 10628 states and 32594 transitions. [2019-11-15 20:12:58,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:12:58,689 INFO L276 IsEmpty]: Start isEmpty. Operand 10628 states and 32594 transitions. [2019-11-15 20:12:58,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-15 20:12:58,691 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:12:58,691 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] [2019-11-15 20:12:58,691 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:12:58,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:12:58,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1710341576, now seen corresponding path program 1 times [2019-11-15 20:12:58,692 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:12:58,692 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537169364] [2019-11-15 20:12:58,692 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:12:58,693 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:12:58,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:12:58,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:12:58,796 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-15 20:12:58,796 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537169364] [2019-11-15 20:12:58,796 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:12:58,797 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:12:58,797 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228637653] [2019-11-15 20:12:58,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:12:58,798 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:12:58,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:12:58,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:12:58,798 INFO L87 Difference]: Start difference. First operand 10628 states and 32594 transitions. Second operand 6 states. [2019-11-15 20:12:59,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:12:59,196 INFO L93 Difference]: Finished difference Result 13185 states and 39875 transitions. [2019-11-15 20:12:59,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 20:12:59,197 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-11-15 20:12:59,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:12:59,215 INFO L225 Difference]: With dead ends: 13185 [2019-11-15 20:12:59,215 INFO L226 Difference]: Without dead ends: 13122 [2019-11-15 20:12:59,216 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-11-15 20:12:59,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13122 states. [2019-11-15 20:12:59,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13122 to 11051. [2019-11-15 20:12:59,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11051 states. [2019-11-15 20:12:59,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11051 states to 11051 states and 33788 transitions. [2019-11-15 20:12:59,390 INFO L78 Accepts]: Start accepts. Automaton has 11051 states and 33788 transitions. Word has length 56 [2019-11-15 20:12:59,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:12:59,390 INFO L462 AbstractCegarLoop]: Abstraction has 11051 states and 33788 transitions. [2019-11-15 20:12:59,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:12:59,391 INFO L276 IsEmpty]: Start isEmpty. Operand 11051 states and 33788 transitions. [2019-11-15 20:12:59,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-15 20:12:59,562 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:12:59,562 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] [2019-11-15 20:12:59,562 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:12:59,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:12:59,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1211133860, now seen corresponding path program 1 times [2019-11-15 20:12:59,563 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:12:59,563 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058348215] [2019-11-15 20:12:59,563 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:12:59,563 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:12:59,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:12:59,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:12:59,636 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-15 20:12:59,637 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058348215] [2019-11-15 20:12:59,637 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:12:59,637 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:12:59,637 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405223092] [2019-11-15 20:12:59,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:12:59,638 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:12:59,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:12:59,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:12:59,639 INFO L87 Difference]: Start difference. First operand 11051 states and 33788 transitions. Second operand 4 states. [2019-11-15 20:12:59,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:12:59,829 INFO L93 Difference]: Finished difference Result 12865 states and 39394 transitions. [2019-11-15 20:12:59,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:12:59,830 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-11-15 20:12:59,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:12:59,851 INFO L225 Difference]: With dead ends: 12865 [2019-11-15 20:12:59,851 INFO L226 Difference]: Without dead ends: 12865 [2019-11-15 20:12:59,852 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-15 20:12:59,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12865 states. [2019-11-15 20:12:59,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12865 to 11696. [2019-11-15 20:12:59,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11696 states. [2019-11-15 20:13:00,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11696 states to 11696 states and 35765 transitions. [2019-11-15 20:13:00,021 INFO L78 Accepts]: Start accepts. Automaton has 11696 states and 35765 transitions. Word has length 64 [2019-11-15 20:13:00,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:13:00,021 INFO L462 AbstractCegarLoop]: Abstraction has 11696 states and 35765 transitions. [2019-11-15 20:13:00,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:13:00,021 INFO L276 IsEmpty]: Start isEmpty. Operand 11696 states and 35765 transitions. [2019-11-15 20:13:00,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-15 20:13:00,025 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:13:00,025 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] [2019-11-15 20:13:00,025 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:13:00,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:13:00,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1341023101, now seen corresponding path program 1 times [2019-11-15 20:13:00,026 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:13:00,026 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53729595] [2019-11-15 20:13:00,026 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:00,026 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:00,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:13:00,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:13:00,120 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-15 20:13:00,120 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53729595] [2019-11-15 20:13:00,121 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:13:00,121 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:13:00,121 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635020625] [2019-11-15 20:13:00,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:13:00,122 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:13:00,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:13:00,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:13:00,123 INFO L87 Difference]: Start difference. First operand 11696 states and 35765 transitions. Second operand 6 states. [2019-11-15 20:13:00,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:13:00,652 INFO L93 Difference]: Finished difference Result 14222 states and 42863 transitions. [2019-11-15 20:13:00,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 20:13:00,653 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-11-15 20:13:00,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:13:00,678 INFO L225 Difference]: With dead ends: 14222 [2019-11-15 20:13:00,679 INFO L226 Difference]: Without dead ends: 14161 [2019-11-15 20:13:00,683 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-15 20:13:00,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14161 states. [2019-11-15 20:13:00,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14161 to 13464. [2019-11-15 20:13:00,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13464 states. [2019-11-15 20:13:00,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13464 states to 13464 states and 40782 transitions. [2019-11-15 20:13:00,878 INFO L78 Accepts]: Start accepts. Automaton has 13464 states and 40782 transitions. Word has length 64 [2019-11-15 20:13:00,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:13:00,879 INFO L462 AbstractCegarLoop]: Abstraction has 13464 states and 40782 transitions. [2019-11-15 20:13:00,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:13:00,879 INFO L276 IsEmpty]: Start isEmpty. Operand 13464 states and 40782 transitions. [2019-11-15 20:13:00,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 20:13:00,885 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:13:00,885 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] [2019-11-15 20:13:00,885 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:13:00,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:13:00,885 INFO L82 PathProgramCache]: Analyzing trace with hash -847939956, now seen corresponding path program 1 times [2019-11-15 20:13:00,885 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:13:00,886 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820468188] [2019-11-15 20:13:00,886 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:00,886 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:00,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:13:00,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:13:00,948 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-15 20:13:00,948 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820468188] [2019-11-15 20:13:00,948 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:13:00,948 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:13:00,948 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872685743] [2019-11-15 20:13:00,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:13:00,949 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:13:00,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:13:00,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:13:00,949 INFO L87 Difference]: Start difference. First operand 13464 states and 40782 transitions. Second operand 4 states. [2019-11-15 20:13:01,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:13:01,273 INFO L93 Difference]: Finished difference Result 16506 states and 49374 transitions. [2019-11-15 20:13:01,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:13:01,273 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-11-15 20:13:01,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:13:01,295 INFO L225 Difference]: With dead ends: 16506 [2019-11-15 20:13:01,295 INFO L226 Difference]: Without dead ends: 16506 [2019-11-15 20:13:01,296 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-15 20:13:01,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16506 states. [2019-11-15 20:13:01,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16506 to 14985. [2019-11-15 20:13:01,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14985 states. [2019-11-15 20:13:01,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14985 states to 14985 states and 44963 transitions. [2019-11-15 20:13:01,511 INFO L78 Accepts]: Start accepts. Automaton has 14985 states and 44963 transitions. Word has length 68 [2019-11-15 20:13:01,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:13:01,511 INFO L462 AbstractCegarLoop]: Abstraction has 14985 states and 44963 transitions. [2019-11-15 20:13:01,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:13:01,511 INFO L276 IsEmpty]: Start isEmpty. Operand 14985 states and 44963 transitions. [2019-11-15 20:13:01,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 20:13:01,518 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:13:01,518 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] [2019-11-15 20:13:01,518 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:13:01,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:13:01,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1369817997, now seen corresponding path program 1 times [2019-11-15 20:13:01,519 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:13:01,519 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071726418] [2019-11-15 20:13:01,519 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:01,519 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:01,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:13:01,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:13:01,572 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-15 20:13:01,573 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071726418] [2019-11-15 20:13:01,573 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:13:01,573 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:13:01,573 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724398640] [2019-11-15 20:13:01,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:13:01,574 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:13:01,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:13:01,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:13:01,574 INFO L87 Difference]: Start difference. First operand 14985 states and 44963 transitions. Second operand 3 states. [2019-11-15 20:13:01,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:13:01,801 INFO L93 Difference]: Finished difference Result 15533 states and 46406 transitions. [2019-11-15 20:13:01,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:13:01,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-11-15 20:13:01,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:13:01,822 INFO L225 Difference]: With dead ends: 15533 [2019-11-15 20:13:01,822 INFO L226 Difference]: Without dead ends: 15533 [2019-11-15 20:13:01,823 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-15 20:13:01,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15533 states. [2019-11-15 20:13:02,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15533 to 15279. [2019-11-15 20:13:02,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15279 states. [2019-11-15 20:13:02,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15279 states to 15279 states and 45731 transitions. [2019-11-15 20:13:02,031 INFO L78 Accepts]: Start accepts. Automaton has 15279 states and 45731 transitions. Word has length 68 [2019-11-15 20:13:02,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:13:02,031 INFO L462 AbstractCegarLoop]: Abstraction has 15279 states and 45731 transitions. [2019-11-15 20:13:02,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:13:02,032 INFO L276 IsEmpty]: Start isEmpty. Operand 15279 states and 45731 transitions. [2019-11-15 20:13:02,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-15 20:13:02,040 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:13:02,040 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] [2019-11-15 20:13:02,040 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:13:02,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:13:02,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1189902446, now seen corresponding path program 1 times [2019-11-15 20:13:02,041 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:13:02,041 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297126382] [2019-11-15 20:13:02,041 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:02,041 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:02,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:13:02,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:13:02,163 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-15 20:13:02,164 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297126382] [2019-11-15 20:13:02,164 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:13:02,164 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 20:13:02,164 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429733393] [2019-11-15 20:13:02,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 20:13:02,165 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:13:02,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 20:13:02,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:13:02,166 INFO L87 Difference]: Start difference. First operand 15279 states and 45731 transitions. Second operand 8 states. [2019-11-15 20:13:04,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:13:04,453 INFO L93 Difference]: Finished difference Result 48056 states and 141062 transitions. [2019-11-15 20:13:04,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-15 20:13:04,454 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 70 [2019-11-15 20:13:04,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:13:04,521 INFO L225 Difference]: With dead ends: 48056 [2019-11-15 20:13:04,522 INFO L226 Difference]: Without dead ends: 47906 [2019-11-15 20:13:04,522 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2019-11-15 20:13:04,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47906 states. [2019-11-15 20:13:04,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47906 to 21960. [2019-11-15 20:13:04,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21960 states. [2019-11-15 20:13:04,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21960 states to 21960 states and 65743 transitions. [2019-11-15 20:13:04,996 INFO L78 Accepts]: Start accepts. Automaton has 21960 states and 65743 transitions. Word has length 70 [2019-11-15 20:13:04,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:13:04,996 INFO L462 AbstractCegarLoop]: Abstraction has 21960 states and 65743 transitions. [2019-11-15 20:13:04,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 20:13:04,996 INFO L276 IsEmpty]: Start isEmpty. Operand 21960 states and 65743 transitions. [2019-11-15 20:13:05,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-15 20:13:05,010 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:13:05,011 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] [2019-11-15 20:13:05,011 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:13:05,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:13:05,011 INFO L82 PathProgramCache]: Analyzing trace with hash 617552017, now seen corresponding path program 1 times [2019-11-15 20:13:05,011 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:13:05,011 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683095416] [2019-11-15 20:13:05,012 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:05,012 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:05,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:13:05,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:13:05,128 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-15 20:13:05,128 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683095416] [2019-11-15 20:13:05,129 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:13:05,129 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:13:05,129 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252164815] [2019-11-15 20:13:05,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:13:05,130 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:13:05,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:13:05,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:13:05,130 INFO L87 Difference]: Start difference. First operand 21960 states and 65743 transitions. Second operand 6 states. [2019-11-15 20:13:05,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:13:05,674 INFO L93 Difference]: Finished difference Result 22857 states and 67869 transitions. [2019-11-15 20:13:05,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:13:05,675 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-11-15 20:13:05,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:13:05,705 INFO L225 Difference]: With dead ends: 22857 [2019-11-15 20:13:05,705 INFO L226 Difference]: Without dead ends: 22857 [2019-11-15 20:13:05,705 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-15 20:13:05,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22857 states. [2019-11-15 20:13:06,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22857 to 22415. [2019-11-15 20:13:06,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22415 states. [2019-11-15 20:13:06,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22415 states to 22415 states and 66697 transitions. [2019-11-15 20:13:06,138 INFO L78 Accepts]: Start accepts. Automaton has 22415 states and 66697 transitions. Word has length 70 [2019-11-15 20:13:06,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:13:06,139 INFO L462 AbstractCegarLoop]: Abstraction has 22415 states and 66697 transitions. [2019-11-15 20:13:06,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:13:06,139 INFO L276 IsEmpty]: Start isEmpty. Operand 22415 states and 66697 transitions. [2019-11-15 20:13:06,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-15 20:13:06,153 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:13:06,153 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] [2019-11-15 20:13:06,153 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:13:06,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:13:06,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1459657326, now seen corresponding path program 1 times [2019-11-15 20:13:06,154 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:13:06,154 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700338856] [2019-11-15 20:13:06,154 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:06,155 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:06,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:13:06,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:13:06,252 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-15 20:13:06,252 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700338856] [2019-11-15 20:13:06,252 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:13:06,253 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:13:06,253 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568253955] [2019-11-15 20:13:06,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:13:06,254 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:13:06,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:13:06,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:13:06,254 INFO L87 Difference]: Start difference. First operand 22415 states and 66697 transitions. Second operand 6 states. [2019-11-15 20:13:06,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:13:06,752 INFO L93 Difference]: Finished difference Result 20201 states and 58714 transitions. [2019-11-15 20:13:06,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 20:13:06,752 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-11-15 20:13:06,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:13:06,778 INFO L225 Difference]: With dead ends: 20201 [2019-11-15 20:13:06,778 INFO L226 Difference]: Without dead ends: 20201 [2019-11-15 20:13:06,779 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-15 20:13:06,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20201 states. [2019-11-15 20:13:07,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20201 to 19005. [2019-11-15 20:13:07,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19005 states. [2019-11-15 20:13:07,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19005 states to 19005 states and 55678 transitions. [2019-11-15 20:13:07,048 INFO L78 Accepts]: Start accepts. Automaton has 19005 states and 55678 transitions. Word has length 70 [2019-11-15 20:13:07,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:13:07,049 INFO L462 AbstractCegarLoop]: Abstraction has 19005 states and 55678 transitions. [2019-11-15 20:13:07,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:13:07,049 INFO L276 IsEmpty]: Start isEmpty. Operand 19005 states and 55678 transitions. [2019-11-15 20:13:07,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-15 20:13:07,060 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:13:07,061 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] [2019-11-15 20:13:07,061 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:13:07,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:13:07,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1239206420, now seen corresponding path program 1 times [2019-11-15 20:13:07,062 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:13:07,062 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297794967] [2019-11-15 20:13:07,062 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:07,062 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:07,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:13:07,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:13:07,128 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-15 20:13:07,130 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297794967] [2019-11-15 20:13:07,130 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:13:07,130 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:13:07,130 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480142721] [2019-11-15 20:13:07,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:13:07,131 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:13:07,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:13:07,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:13:07,131 INFO L87 Difference]: Start difference. First operand 19005 states and 55678 transitions. Second operand 4 states. [2019-11-15 20:13:07,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:13:07,722 INFO L93 Difference]: Finished difference Result 25536 states and 75191 transitions. [2019-11-15 20:13:07,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:13:07,723 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2019-11-15 20:13:07,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:13:07,760 INFO L225 Difference]: With dead ends: 25536 [2019-11-15 20:13:07,760 INFO L226 Difference]: Without dead ends: 25401 [2019-11-15 20:13:07,760 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-15 20:13:07,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25401 states. [2019-11-15 20:13:08,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25401 to 22554. [2019-11-15 20:13:08,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22554 states. [2019-11-15 20:13:08,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22554 states to 22554 states and 66526 transitions. [2019-11-15 20:13:08,091 INFO L78 Accepts]: Start accepts. Automaton has 22554 states and 66526 transitions. Word has length 70 [2019-11-15 20:13:08,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:13:08,092 INFO L462 AbstractCegarLoop]: Abstraction has 22554 states and 66526 transitions. [2019-11-15 20:13:08,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:13:08,092 INFO L276 IsEmpty]: Start isEmpty. Operand 22554 states and 66526 transitions. [2019-11-15 20:13:08,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-15 20:13:08,100 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:13:08,100 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] [2019-11-15 20:13:08,101 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:13:08,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:13:08,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1248306413, now seen corresponding path program 1 times [2019-11-15 20:13:08,101 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:13:08,101 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47815539] [2019-11-15 20:13:08,101 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:08,101 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:08,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:13:08,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:13:08,165 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-15 20:13:08,165 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47815539] [2019-11-15 20:13:08,165 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:13:08,166 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:13:08,166 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59311057] [2019-11-15 20:13:08,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:13:08,166 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:13:08,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:13:08,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:13:08,167 INFO L87 Difference]: Start difference. First operand 22554 states and 66526 transitions. Second operand 5 states. [2019-11-15 20:13:08,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:13:08,736 INFO L93 Difference]: Finished difference Result 32545 states and 94756 transitions. [2019-11-15 20:13:08,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:13:08,737 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-11-15 20:13:08,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:13:08,782 INFO L225 Difference]: With dead ends: 32545 [2019-11-15 20:13:08,783 INFO L226 Difference]: Without dead ends: 32443 [2019-11-15 20:13:08,783 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:13:08,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32443 states. [2019-11-15 20:13:09,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32443 to 26202. [2019-11-15 20:13:09,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26202 states. [2019-11-15 20:13:09,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26202 states to 26202 states and 76700 transitions. [2019-11-15 20:13:09,192 INFO L78 Accepts]: Start accepts. Automaton has 26202 states and 76700 transitions. Word has length 70 [2019-11-15 20:13:09,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:13:09,193 INFO L462 AbstractCegarLoop]: Abstraction has 26202 states and 76700 transitions. [2019-11-15 20:13:09,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:13:09,193 INFO L276 IsEmpty]: Start isEmpty. Operand 26202 states and 76700 transitions. [2019-11-15 20:13:09,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-15 20:13:09,202 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:13:09,202 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] [2019-11-15 20:13:09,202 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:13:09,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:13:09,202 INFO L82 PathProgramCache]: Analyzing trace with hash -557744939, now seen corresponding path program 1 times [2019-11-15 20:13:09,202 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:13:09,203 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665488042] [2019-11-15 20:13:09,203 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:09,203 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:09,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:13:09,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:13:09,329 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-15 20:13:09,329 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665488042] [2019-11-15 20:13:09,329 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:13:09,329 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 20:13:09,330 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928991455] [2019-11-15 20:13:09,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:13:09,330 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:13:09,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:13:09,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:13:09,331 INFO L87 Difference]: Start difference. First operand 26202 states and 76700 transitions. Second operand 7 states. [2019-11-15 20:13:09,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:13:09,912 INFO L93 Difference]: Finished difference Result 21955 states and 61128 transitions. [2019-11-15 20:13:09,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 20:13:09,913 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2019-11-15 20:13:09,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:13:09,938 INFO L225 Difference]: With dead ends: 21955 [2019-11-15 20:13:09,938 INFO L226 Difference]: Without dead ends: 21955 [2019-11-15 20:13:09,939 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-11-15 20:13:09,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21955 states. [2019-11-15 20:13:10,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21955 to 17956. [2019-11-15 20:13:10,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17956 states. [2019-11-15 20:13:10,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17956 states to 17956 states and 49940 transitions. [2019-11-15 20:13:10,200 INFO L78 Accepts]: Start accepts. Automaton has 17956 states and 49940 transitions. Word has length 70 [2019-11-15 20:13:10,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:13:10,201 INFO L462 AbstractCegarLoop]: Abstraction has 17956 states and 49940 transitions. [2019-11-15 20:13:10,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:13:10,201 INFO L276 IsEmpty]: Start isEmpty. Operand 17956 states and 49940 transitions. [2019-11-15 20:13:10,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-15 20:13:10,207 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:13:10,208 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] [2019-11-15 20:13:10,208 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:13:10,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:13:10,208 INFO L82 PathProgramCache]: Analyzing trace with hash 329758742, now seen corresponding path program 1 times [2019-11-15 20:13:10,208 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:13:10,208 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63964020] [2019-11-15 20:13:10,208 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:10,208 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:10,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:13:10,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:13:10,282 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-15 20:13:10,282 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63964020] [2019-11-15 20:13:10,282 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:13:10,282 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:13:10,283 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773449288] [2019-11-15 20:13:10,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:13:10,283 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:13:10,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:13:10,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:13:10,284 INFO L87 Difference]: Start difference. First operand 17956 states and 49940 transitions. Second operand 5 states. [2019-11-15 20:13:10,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:13:10,334 INFO L93 Difference]: Finished difference Result 5509 states and 13001 transitions. [2019-11-15 20:13:10,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 20:13:10,335 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-11-15 20:13:10,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:13:10,339 INFO L225 Difference]: With dead ends: 5509 [2019-11-15 20:13:10,339 INFO L226 Difference]: Without dead ends: 4699 [2019-11-15 20:13:10,339 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-15 20:13:10,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4699 states. [2019-11-15 20:13:10,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4699 to 4015. [2019-11-15 20:13:10,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4015 states. [2019-11-15 20:13:10,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4015 states to 4015 states and 9282 transitions. [2019-11-15 20:13:10,382 INFO L78 Accepts]: Start accepts. Automaton has 4015 states and 9282 transitions. Word has length 70 [2019-11-15 20:13:10,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:13:10,382 INFO L462 AbstractCegarLoop]: Abstraction has 4015 states and 9282 transitions. [2019-11-15 20:13:10,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:13:10,382 INFO L276 IsEmpty]: Start isEmpty. Operand 4015 states and 9282 transitions. [2019-11-15 20:13:10,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-15 20:13:10,385 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:13:10,385 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] [2019-11-15 20:13:10,388 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:13:10,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:13:10,388 INFO L82 PathProgramCache]: Analyzing trace with hash -687461772, now seen corresponding path program 1 times [2019-11-15 20:13:10,389 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:13:10,389 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916829099] [2019-11-15 20:13:10,389 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:10,389 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:10,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:13:10,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:13:10,436 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-15 20:13:10,437 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916829099] [2019-11-15 20:13:10,437 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:13:10,437 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:13:10,437 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157437578] [2019-11-15 20:13:10,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:13:10,439 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:13:10,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:13:10,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:13:10,440 INFO L87 Difference]: Start difference. First operand 4015 states and 9282 transitions. Second operand 3 states. [2019-11-15 20:13:10,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:13:10,480 INFO L93 Difference]: Finished difference Result 4980 states and 11347 transitions. [2019-11-15 20:13:10,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:13:10,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-11-15 20:13:10,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:13:10,486 INFO L225 Difference]: With dead ends: 4980 [2019-11-15 20:13:10,486 INFO L226 Difference]: Without dead ends: 4980 [2019-11-15 20:13:10,487 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-15 20:13:10,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4980 states. [2019-11-15 20:13:10,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4980 to 3950. [2019-11-15 20:13:10,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3950 states. [2019-11-15 20:13:10,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3950 states to 3950 states and 8915 transitions. [2019-11-15 20:13:10,551 INFO L78 Accepts]: Start accepts. Automaton has 3950 states and 8915 transitions. Word has length 70 [2019-11-15 20:13:10,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:13:10,551 INFO L462 AbstractCegarLoop]: Abstraction has 3950 states and 8915 transitions. [2019-11-15 20:13:10,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:13:10,551 INFO L276 IsEmpty]: Start isEmpty. Operand 3950 states and 8915 transitions. [2019-11-15 20:13:10,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-15 20:13:10,555 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:13:10,556 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] [2019-11-15 20:13:10,556 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:13:10,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:13:10,557 INFO L82 PathProgramCache]: Analyzing trace with hash -61024697, now seen corresponding path program 1 times [2019-11-15 20:13:10,557 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:13:10,557 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801102208] [2019-11-15 20:13:10,557 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:10,557 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:10,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:13:10,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:13:10,638 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-15 20:13:10,638 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801102208] [2019-11-15 20:13:10,638 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:13:10,638 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:13:10,639 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127613221] [2019-11-15 20:13:10,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:13:10,640 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:13:10,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:13:10,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:13:10,640 INFO L87 Difference]: Start difference. First operand 3950 states and 8915 transitions. Second operand 5 states. [2019-11-15 20:13:10,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:13:10,822 INFO L93 Difference]: Finished difference Result 4879 states and 11065 transitions. [2019-11-15 20:13:10,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 20:13:10,823 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-11-15 20:13:10,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:13:10,827 INFO L225 Difference]: With dead ends: 4879 [2019-11-15 20:13:10,827 INFO L226 Difference]: Without dead ends: 4879 [2019-11-15 20:13:10,827 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-15 20:13:10,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4879 states. [2019-11-15 20:13:10,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4879 to 4516. [2019-11-15 20:13:10,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4516 states. [2019-11-15 20:13:10,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4516 states to 4516 states and 10194 transitions. [2019-11-15 20:13:10,874 INFO L78 Accepts]: Start accepts. Automaton has 4516 states and 10194 transitions. Word has length 76 [2019-11-15 20:13:10,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:13:10,874 INFO L462 AbstractCegarLoop]: Abstraction has 4516 states and 10194 transitions. [2019-11-15 20:13:10,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:13:10,875 INFO L276 IsEmpty]: Start isEmpty. Operand 4516 states and 10194 transitions. [2019-11-15 20:13:10,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-15 20:13:10,914 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:13:10,914 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] [2019-11-15 20:13:10,914 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:13:10,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:13:10,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1681785638, now seen corresponding path program 1 times [2019-11-15 20:13:10,915 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:13:10,915 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249634579] [2019-11-15 20:13:10,915 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:10,915 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:10,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:13:10,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:13:10,995 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-15 20:13:10,995 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249634579] [2019-11-15 20:13:10,995 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:13:10,995 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 20:13:10,996 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614526895] [2019-11-15 20:13:10,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:13:10,996 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:13:10,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:13:10,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:13:10,997 INFO L87 Difference]: Start difference. First operand 4516 states and 10194 transitions. Second operand 7 states. [2019-11-15 20:13:11,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:13:11,508 INFO L93 Difference]: Finished difference Result 5157 states and 11533 transitions. [2019-11-15 20:13:11,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 20:13:11,508 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 76 [2019-11-15 20:13:11,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:13:11,514 INFO L225 Difference]: With dead ends: 5157 [2019-11-15 20:13:11,514 INFO L226 Difference]: Without dead ends: 5104 [2019-11-15 20:13:11,515 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-11-15 20:13:11,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5104 states. [2019-11-15 20:13:11,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5104 to 4540. [2019-11-15 20:13:11,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4540 states. [2019-11-15 20:13:11,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4540 states to 4540 states and 10171 transitions. [2019-11-15 20:13:11,577 INFO L78 Accepts]: Start accepts. Automaton has 4540 states and 10171 transitions. Word has length 76 [2019-11-15 20:13:11,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:13:11,578 INFO L462 AbstractCegarLoop]: Abstraction has 4540 states and 10171 transitions. [2019-11-15 20:13:11,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:13:11,578 INFO L276 IsEmpty]: Start isEmpty. Operand 4540 states and 10171 transitions. [2019-11-15 20:13:11,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-15 20:13:11,582 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:13:11,583 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:13:11,583 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:13:11,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:13:11,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1856752212, now seen corresponding path program 1 times [2019-11-15 20:13:11,584 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:13:11,584 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538579164] [2019-11-15 20:13:11,584 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:11,584 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:11,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:13:11,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:13:11,668 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-15 20:13:11,669 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538579164] [2019-11-15 20:13:11,669 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:13:11,669 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:13:11,669 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985843357] [2019-11-15 20:13:11,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:13:11,672 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:13:11,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:13:11,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:13:11,672 INFO L87 Difference]: Start difference. First operand 4540 states and 10171 transitions. Second operand 4 states. [2019-11-15 20:13:11,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:13:11,804 INFO L93 Difference]: Finished difference Result 5402 states and 12006 transitions. [2019-11-15 20:13:11,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:13:11,805 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-15 20:13:11,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:13:11,810 INFO L225 Difference]: With dead ends: 5402 [2019-11-15 20:13:11,811 INFO L226 Difference]: Without dead ends: 5402 [2019-11-15 20:13:11,811 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:13:11,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5402 states. [2019-11-15 20:13:11,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5402 to 4927. [2019-11-15 20:13:11,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4927 states. [2019-11-15 20:13:11,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4927 states to 4927 states and 10984 transitions. [2019-11-15 20:13:11,884 INFO L78 Accepts]: Start accepts. Automaton has 4927 states and 10984 transitions. Word has length 97 [2019-11-15 20:13:11,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:13:11,885 INFO L462 AbstractCegarLoop]: Abstraction has 4927 states and 10984 transitions. [2019-11-15 20:13:11,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:13:11,885 INFO L276 IsEmpty]: Start isEmpty. Operand 4927 states and 10984 transitions. [2019-11-15 20:13:11,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 20:13:11,890 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:13:11,890 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:13:11,891 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:13:11,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:13:11,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1130065090, now seen corresponding path program 1 times [2019-11-15 20:13:11,892 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:13:11,892 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880785838] [2019-11-15 20:13:11,892 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:11,892 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:11,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:13:11,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:13:11,992 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-15 20:13:11,993 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880785838] [2019-11-15 20:13:11,993 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:13:11,993 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:13:11,993 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388579400] [2019-11-15 20:13:11,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:13:11,994 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:13:11,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:13:11,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:13:11,995 INFO L87 Difference]: Start difference. First operand 4927 states and 10984 transitions. Second operand 6 states. [2019-11-15 20:13:12,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:13:12,567 INFO L93 Difference]: Finished difference Result 7374 states and 16549 transitions. [2019-11-15 20:13:12,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 20:13:12,568 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-11-15 20:13:12,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:13:12,573 INFO L225 Difference]: With dead ends: 7374 [2019-11-15 20:13:12,574 INFO L226 Difference]: Without dead ends: 7374 [2019-11-15 20:13:12,574 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:13:12,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7374 states. [2019-11-15 20:13:12,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7374 to 5610. [2019-11-15 20:13:12,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5610 states. [2019-11-15 20:13:12,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5610 states to 5610 states and 12651 transitions. [2019-11-15 20:13:12,642 INFO L78 Accepts]: Start accepts. Automaton has 5610 states and 12651 transitions. Word has length 99 [2019-11-15 20:13:12,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:13:12,642 INFO L462 AbstractCegarLoop]: Abstraction has 5610 states and 12651 transitions. [2019-11-15 20:13:12,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:13:12,642 INFO L276 IsEmpty]: Start isEmpty. Operand 5610 states and 12651 transitions. [2019-11-15 20:13:12,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 20:13:12,647 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:13:12,647 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:13:12,648 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:13:12,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:13:12,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1118748963, now seen corresponding path program 1 times [2019-11-15 20:13:12,648 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:13:12,649 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181575576] [2019-11-15 20:13:12,649 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:12,649 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:12,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:13:12,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:13:12,757 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-15 20:13:12,758 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181575576] [2019-11-15 20:13:12,758 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:13:12,758 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 20:13:12,758 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314479251] [2019-11-15 20:13:12,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:13:12,759 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:13:12,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:13:12,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:13:12,760 INFO L87 Difference]: Start difference. First operand 5610 states and 12651 transitions. Second operand 7 states. [2019-11-15 20:13:13,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:13:13,668 INFO L93 Difference]: Finished difference Result 8011 states and 17855 transitions. [2019-11-15 20:13:13,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-15 20:13:13,668 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2019-11-15 20:13:13,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:13:13,674 INFO L225 Difference]: With dead ends: 8011 [2019-11-15 20:13:13,675 INFO L226 Difference]: Without dead ends: 7938 [2019-11-15 20:13:13,675 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-11-15 20:13:13,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7938 states. [2019-11-15 20:13:13,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7938 to 6560. [2019-11-15 20:13:13,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6560 states. [2019-11-15 20:13:13,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6560 states to 6560 states and 14734 transitions. [2019-11-15 20:13:13,749 INFO L78 Accepts]: Start accepts. Automaton has 6560 states and 14734 transitions. Word has length 99 [2019-11-15 20:13:13,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:13:13,749 INFO L462 AbstractCegarLoop]: Abstraction has 6560 states and 14734 transitions. [2019-11-15 20:13:13,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:13:13,749 INFO L276 IsEmpty]: Start isEmpty. Operand 6560 states and 14734 transitions. [2019-11-15 20:13:13,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 20:13:13,754 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:13:13,755 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:13:13,755 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:13:13,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:13:13,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1099008990, now seen corresponding path program 1 times [2019-11-15 20:13:13,755 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:13:13,755 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952042151] [2019-11-15 20:13:13,756 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:13,756 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:13,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:13:13,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:13:13,885 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-15 20:13:13,886 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952042151] [2019-11-15 20:13:13,886 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:13:13,886 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:13:13,886 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502547023] [2019-11-15 20:13:13,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:13:13,887 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:13:13,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:13:13,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:13:13,888 INFO L87 Difference]: Start difference. First operand 6560 states and 14734 transitions. Second operand 6 states. [2019-11-15 20:13:14,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:13:14,059 INFO L93 Difference]: Finished difference Result 5896 states and 12970 transitions. [2019-11-15 20:13:14,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:13:14,060 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-11-15 20:13:14,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:13:14,064 INFO L225 Difference]: With dead ends: 5896 [2019-11-15 20:13:14,064 INFO L226 Difference]: Without dead ends: 5860 [2019-11-15 20:13:14,064 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-15 20:13:14,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5860 states. [2019-11-15 20:13:14,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5860 to 5095. [2019-11-15 20:13:14,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5095 states. [2019-11-15 20:13:14,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5095 states to 5095 states and 11251 transitions. [2019-11-15 20:13:14,117 INFO L78 Accepts]: Start accepts. Automaton has 5095 states and 11251 transitions. Word has length 99 [2019-11-15 20:13:14,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:13:14,118 INFO L462 AbstractCegarLoop]: Abstraction has 5095 states and 11251 transitions. [2019-11-15 20:13:14,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:13:14,118 INFO L276 IsEmpty]: Start isEmpty. Operand 5095 states and 11251 transitions. [2019-11-15 20:13:14,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 20:13:14,124 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:13:14,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:13:14,124 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:13:14,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:13:14,125 INFO L82 PathProgramCache]: Analyzing trace with hash -772119014, now seen corresponding path program 1 times [2019-11-15 20:13:14,125 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:13:14,125 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213863605] [2019-11-15 20:13:14,126 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:14,126 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:14,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:13:14,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:13:14,207 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-15 20:13:14,208 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213863605] [2019-11-15 20:13:14,208 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:13:14,208 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:13:14,208 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769858460] [2019-11-15 20:13:14,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:13:14,209 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:13:14,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:13:14,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:13:14,209 INFO L87 Difference]: Start difference. First operand 5095 states and 11251 transitions. Second operand 5 states. [2019-11-15 20:13:14,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:13:14,336 INFO L93 Difference]: Finished difference Result 5603 states and 12349 transitions. [2019-11-15 20:13:14,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:13:14,337 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-11-15 20:13:14,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:13:14,343 INFO L225 Difference]: With dead ends: 5603 [2019-11-15 20:13:14,343 INFO L226 Difference]: Without dead ends: 5603 [2019-11-15 20:13:14,343 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:13:14,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5603 states. [2019-11-15 20:13:14,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5603 to 4471. [2019-11-15 20:13:14,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4471 states. [2019-11-15 20:13:14,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4471 states to 4471 states and 9854 transitions. [2019-11-15 20:13:14,396 INFO L78 Accepts]: Start accepts. Automaton has 4471 states and 9854 transitions. Word has length 99 [2019-11-15 20:13:14,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:13:14,396 INFO L462 AbstractCegarLoop]: Abstraction has 4471 states and 9854 transitions. [2019-11-15 20:13:14,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:13:14,397 INFO L276 IsEmpty]: Start isEmpty. Operand 4471 states and 9854 transitions. [2019-11-15 20:13:14,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 20:13:14,400 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:13:14,400 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:13:14,400 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:13:14,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:13:14,401 INFO L82 PathProgramCache]: Analyzing trace with hash 253372985, now seen corresponding path program 1 times [2019-11-15 20:13:14,401 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:13:14,401 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528847022] [2019-11-15 20:13:14,401 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:14,401 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:14,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:13:14,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:13:14,500 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-15 20:13:14,500 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528847022] [2019-11-15 20:13:14,500 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:13:14,500 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:13:14,501 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785324640] [2019-11-15 20:13:14,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:13:14,502 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:13:14,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:13:14,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:13:14,502 INFO L87 Difference]: Start difference. First operand 4471 states and 9854 transitions. Second operand 5 states. [2019-11-15 20:13:14,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:13:14,973 INFO L93 Difference]: Finished difference Result 5359 states and 11752 transitions. [2019-11-15 20:13:14,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 20:13:14,974 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-11-15 20:13:14,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:13:14,979 INFO L225 Difference]: With dead ends: 5359 [2019-11-15 20:13:14,979 INFO L226 Difference]: Without dead ends: 5299 [2019-11-15 20:13:14,980 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:13:14,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5299 states. [2019-11-15 20:13:15,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5299 to 4997. [2019-11-15 20:13:15,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4997 states. [2019-11-15 20:13:15,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4997 states to 4997 states and 10993 transitions. [2019-11-15 20:13:15,052 INFO L78 Accepts]: Start accepts. Automaton has 4997 states and 10993 transitions. Word has length 99 [2019-11-15 20:13:15,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:13:15,052 INFO L462 AbstractCegarLoop]: Abstraction has 4997 states and 10993 transitions. [2019-11-15 20:13:15,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:13:15,052 INFO L276 IsEmpty]: Start isEmpty. Operand 4997 states and 10993 transitions. [2019-11-15 20:13:15,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 20:13:15,058 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:13:15,058 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:13:15,058 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:13:15,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:13:15,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1477566408, now seen corresponding path program 1 times [2019-11-15 20:13:15,059 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:13:15,059 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120570339] [2019-11-15 20:13:15,059 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:15,060 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:15,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:13:15,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:13:15,133 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-15 20:13:15,134 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120570339] [2019-11-15 20:13:15,134 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:13:15,134 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:13:15,134 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122331413] [2019-11-15 20:13:15,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:13:15,135 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:13:15,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:13:15,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:13:15,136 INFO L87 Difference]: Start difference. First operand 4997 states and 10993 transitions. Second operand 5 states. [2019-11-15 20:13:15,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:13:15,413 INFO L93 Difference]: Finished difference Result 6202 states and 13442 transitions. [2019-11-15 20:13:15,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:13:15,413 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-11-15 20:13:15,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:13:15,419 INFO L225 Difference]: With dead ends: 6202 [2019-11-15 20:13:15,420 INFO L226 Difference]: Without dead ends: 6158 [2019-11-15 20:13:15,421 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:13:15,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6158 states. [2019-11-15 20:13:15,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6158 to 5044. [2019-11-15 20:13:15,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5044 states. [2019-11-15 20:13:15,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5044 states to 5044 states and 11069 transitions. [2019-11-15 20:13:15,501 INFO L78 Accepts]: Start accepts. Automaton has 5044 states and 11069 transitions. Word has length 99 [2019-11-15 20:13:15,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:13:15,501 INFO L462 AbstractCegarLoop]: Abstraction has 5044 states and 11069 transitions. [2019-11-15 20:13:15,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:13:15,501 INFO L276 IsEmpty]: Start isEmpty. Operand 5044 states and 11069 transitions. [2019-11-15 20:13:15,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 20:13:15,507 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:13:15,507 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:13:15,508 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:13:15,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:13:15,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1433293242, now seen corresponding path program 2 times [2019-11-15 20:13:15,508 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:13:15,508 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536907809] [2019-11-15 20:13:15,509 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:15,509 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:15,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:13:15,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:13:15,602 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-15 20:13:15,603 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536907809] [2019-11-15 20:13:15,603 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:13:15,603 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:13:15,603 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217555877] [2019-11-15 20:13:15,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:13:15,604 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:13:15,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:13:15,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:13:15,605 INFO L87 Difference]: Start difference. First operand 5044 states and 11069 transitions. Second operand 6 states. [2019-11-15 20:13:15,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:13:15,836 INFO L93 Difference]: Finished difference Result 5300 states and 11591 transitions. [2019-11-15 20:13:15,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:13:15,836 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-11-15 20:13:15,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:13:15,842 INFO L225 Difference]: With dead ends: 5300 [2019-11-15 20:13:15,842 INFO L226 Difference]: Without dead ends: 5300 [2019-11-15 20:13:15,843 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:13:15,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5300 states. [2019-11-15 20:13:15,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5300 to 4986. [2019-11-15 20:13:15,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4986 states. [2019-11-15 20:13:15,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4986 states to 4986 states and 10943 transitions. [2019-11-15 20:13:15,912 INFO L78 Accepts]: Start accepts. Automaton has 4986 states and 10943 transitions. Word has length 99 [2019-11-15 20:13:15,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:13:15,913 INFO L462 AbstractCegarLoop]: Abstraction has 4986 states and 10943 transitions. [2019-11-15 20:13:15,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:13:15,913 INFO L276 IsEmpty]: Start isEmpty. Operand 4986 states and 10943 transitions. [2019-11-15 20:13:15,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 20:13:15,919 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:13:15,919 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:13:15,920 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:13:15,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:13:15,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1563154307, now seen corresponding path program 1 times [2019-11-15 20:13:15,920 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:13:15,921 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122194776] [2019-11-15 20:13:15,921 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:15,921 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:15,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:13:15,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:13:16,083 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-15 20:13:16,084 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122194776] [2019-11-15 20:13:16,085 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:13:16,085 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 20:13:16,085 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269307848] [2019-11-15 20:13:16,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 20:13:16,086 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:13:16,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 20:13:16,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:13:16,086 INFO L87 Difference]: Start difference. First operand 4986 states and 10943 transitions. Second operand 8 states. [2019-11-15 20:13:16,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:13:16,385 INFO L93 Difference]: Finished difference Result 5774 states and 12551 transitions. [2019-11-15 20:13:16,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 20:13:16,386 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 99 [2019-11-15 20:13:16,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:13:16,390 INFO L225 Difference]: With dead ends: 5774 [2019-11-15 20:13:16,390 INFO L226 Difference]: Without dead ends: 5774 [2019-11-15 20:13:16,391 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-11-15 20:13:16,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5774 states. [2019-11-15 20:13:16,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5774 to 5294. [2019-11-15 20:13:16,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5294 states. [2019-11-15 20:13:16,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5294 states to 5294 states and 11562 transitions. [2019-11-15 20:13:16,454 INFO L78 Accepts]: Start accepts. Automaton has 5294 states and 11562 transitions. Word has length 99 [2019-11-15 20:13:16,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:13:16,455 INFO L462 AbstractCegarLoop]: Abstraction has 5294 states and 11562 transitions. [2019-11-15 20:13:16,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 20:13:16,455 INFO L276 IsEmpty]: Start isEmpty. Operand 5294 states and 11562 transitions. [2019-11-15 20:13:16,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 20:13:16,458 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:13:16,459 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:13:16,459 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:13:16,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:13:16,459 INFO L82 PathProgramCache]: Analyzing trace with hash -675650626, now seen corresponding path program 1 times [2019-11-15 20:13:16,460 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:13:16,460 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17983301] [2019-11-15 20:13:16,460 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:16,460 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:16,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:13:16,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:13:16,584 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-15 20:13:16,584 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17983301] [2019-11-15 20:13:16,584 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:13:16,584 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 20:13:16,585 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125098241] [2019-11-15 20:13:16,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:13:16,585 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:13:16,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:13:16,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:13:16,586 INFO L87 Difference]: Start difference. First operand 5294 states and 11562 transitions. Second operand 7 states. [2019-11-15 20:13:16,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:13:16,718 INFO L93 Difference]: Finished difference Result 8425 states and 18500 transitions. [2019-11-15 20:13:16,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:13:16,718 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2019-11-15 20:13:16,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:13:16,722 INFO L225 Difference]: With dead ends: 8425 [2019-11-15 20:13:16,722 INFO L226 Difference]: Without dead ends: 3313 [2019-11-15 20:13:16,723 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-15 20:13:16,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3313 states. [2019-11-15 20:13:16,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3313 to 3313. [2019-11-15 20:13:16,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3313 states. [2019-11-15 20:13:16,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3313 states to 3313 states and 7281 transitions. [2019-11-15 20:13:16,768 INFO L78 Accepts]: Start accepts. Automaton has 3313 states and 7281 transitions. Word has length 99 [2019-11-15 20:13:16,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:13:16,768 INFO L462 AbstractCegarLoop]: Abstraction has 3313 states and 7281 transitions. [2019-11-15 20:13:16,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:13:16,768 INFO L276 IsEmpty]: Start isEmpty. Operand 3313 states and 7281 transitions. [2019-11-15 20:13:16,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 20:13:16,772 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:13:16,772 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:13:16,773 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:13:16,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:13:16,773 INFO L82 PathProgramCache]: Analyzing trace with hash 810831114, now seen corresponding path program 2 times [2019-11-15 20:13:16,773 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:13:16,774 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132431469] [2019-11-15 20:13:16,774 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:16,774 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:16,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:13:16,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:13:16,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:13:16,887 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:13:16,888 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 20:13:17,098 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-15 20:13:17,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 08:13:17 BasicIcfg [2019-11-15 20:13:17,100 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 20:13:17,100 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:13:17,100 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:13:17,101 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:13:17,101 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:12:34" (3/4) ... [2019-11-15 20:13:17,103 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 20:13:17,263 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_ea891ab3-3e52-4014-bad0-baeccdb047e1/bin/uautomizer/witness.graphml [2019-11-15 20:13:17,263 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:13:17,266 INFO L168 Benchmark]: Toolchain (without parser) took 43990.21 ms. Allocated memory was 1.0 GB in the beginning and 4.6 GB in the end (delta: 3.5 GB). Free memory was 944.8 MB in the beginning and 2.6 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2019-11-15 20:13:17,266 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:13:17,266 INFO L168 Benchmark]: CACSL2BoogieTranslator took 746.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -164.5 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2019-11-15 20:13:17,267 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.85 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-15 20:13:17,269 INFO L168 Benchmark]: Boogie Preprocessor took 49.46 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-15 20:13:17,269 INFO L168 Benchmark]: RCFGBuilder took 794.45 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: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. [2019-11-15 20:13:17,269 INFO L168 Benchmark]: TraceAbstraction took 42159.06 ms. Allocated memory was 1.2 GB in the beginning and 4.6 GB in the end (delta: 3.4 GB). Free memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2019-11-15 20:13:17,270 INFO L168 Benchmark]: Witness Printer took 163.16 ms. Allocated memory is still 4.6 GB. Free memory was 2.6 GB in the beginning and 2.6 GB in the end (delta: 70.7 MB). Peak memory consumption was 70.7 MB. Max. memory is 11.5 GB. [2019-11-15 20:13:17,272 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 746.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -164.5 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 72.85 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 49.46 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 794.45 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: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 42159.06 ms. Allocated memory was 1.2 GB in the beginning and 4.6 GB in the end (delta: 3.4 GB). Free memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. * Witness Printer took 163.16 ms. Allocated memory is still 4.6 GB. Free memory was 2.6 GB in the beginning and 2.6 GB in the end (delta: 70.7 MB). Peak memory consumption was 70.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L698] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L700] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L702] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L704] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0] [L705] 0 _Bool a$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0] [L706] 0 int a$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0] [L707] 0 _Bool a$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0] [L708] 0 _Bool a$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0] [L709] 0 _Bool a$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0] [L710] 0 _Bool a$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0] [L711] 0 _Bool a$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0] [L712] 0 _Bool a$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0] [L713] 0 _Bool a$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0] [L714] 0 int *a$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}] [L715] 0 int a$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0] [L716] 0 _Bool a$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0] [L717] 0 int a$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0] [L718] 0 _Bool a$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0] [L719] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0] [L720] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0] [L722] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L724] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L726] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L727] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0] [L728] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L813] 0 pthread_t t845; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t845, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L732] 1 a$w_buff1 = a$w_buff0 [L733] 1 a$w_buff0 = 1 [L734] 1 a$w_buff1_used = a$w_buff0_used [L735] 1 a$w_buff0_used = (_Bool)1 [L815] 0 pthread_t t846; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t846, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L737] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L738] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L739] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L740] 1 a$r_buff0_thd1 = (_Bool)1 [L743] 1 x = 1 [L746] 1 __unbuffered_p0_EAX = x [L749] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L766] 2 y = 1 [L769] 2 z = 1 [L772] 2 __unbuffered_p1_EAX = z [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 a$flush_delayed = weak$$choice2 [L778] 2 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L779] EXPR 2 !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L779] 2 a = !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) [L780] EXPR 2 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L780] 2 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) [L781] EXPR 2 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L781] 2 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) [L782] EXPR 2 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used))=1, x=1, y=1, z=1] [L782] 2 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) [L752] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L783] EXPR 2 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L783] 2 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] EXPR 2 weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2))=0, x=1, y=1, z=1] [L784] 2 a$r_buff0_thd2 = weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2)) [L785] EXPR 2 weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L785] 2 a$r_buff1_thd2 = weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L787] EXPR 2 a$flush_delayed ? a$mem_tmp : a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$flush_delayed ? a$mem_tmp : a=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L752] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L753] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=1, a$flush_delayed ? a$mem_tmp : a=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L753] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L754] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=1, a$flush_delayed ? a$mem_tmp : a=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L754] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L755] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=1, a$flush_delayed ? a$mem_tmp : a=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L755] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L756] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=1, a$flush_delayed ? a$mem_tmp : a=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L756] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=1, a$flush_delayed ? a$mem_tmp : a=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L787] 2 a = a$flush_delayed ? a$mem_tmp : a [L788] 2 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L791] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a)=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L791] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L792] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L792] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L793] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L793] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L794] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L794] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L795] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L795] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L822] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L822] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L822] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L822] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L823] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L823] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L824] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L824] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L825] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L825] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L826] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L826] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L829] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 222 locations, 3 error locations. Result: UNSAFE, OverallTime: 41.9s, OverallIterations: 33, TraceHistogramMax: 1, AutomataDifference: 21.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9561 SDtfs, 11789 SDslu, 19576 SDs, 0 SdLazy, 9209 SolverSat, 578 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 329 GetRequests, 93 SyntacticMatches, 17 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71015occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 13.8s AutomataMinimizationTime, 32 MinimizatonAttempts, 94565 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 2475 NumberOfCodeBlocks, 2475 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2344 ConstructedInterpolants, 0 QuantifiedInterpolants, 459113 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 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...