./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix034_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_8faf7fe7-af5a-4df0-b1af-48322a9d2800/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8faf7fe7-af5a-4df0-b1af-48322a9d2800/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8faf7fe7-af5a-4df0-b1af-48322a9d2800/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8faf7fe7-af5a-4df0-b1af-48322a9d2800/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix034_tso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_8faf7fe7-af5a-4df0-b1af-48322a9d2800/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8faf7fe7-af5a-4df0-b1af-48322a9d2800/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 30ea70b89721eac5ed4f63275a9abaeb19932fd3 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 23:34:40,204 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:34:40,205 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:34:40,215 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:34:40,215 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:34:40,216 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:34:40,217 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:34:40,219 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:34:40,221 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:34:40,222 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:34:40,222 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:34:40,223 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:34:40,224 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:34:40,224 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:34:40,225 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:34:40,226 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:34:40,227 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:34:40,227 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:34:40,229 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:34:40,231 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:34:40,232 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:34:40,233 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:34:40,234 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:34:40,234 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:34:40,236 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:34:40,236 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:34:40,237 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:34:40,237 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:34:40,237 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:34:40,238 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:34:40,238 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:34:40,239 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:34:40,239 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:34:40,240 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:34:40,241 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:34:40,241 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:34:40,242 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:34:40,242 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:34:40,242 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:34:40,243 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:34:40,243 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:34:40,244 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8faf7fe7-af5a-4df0-b1af-48322a9d2800/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:34:40,255 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:34:40,256 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:34:40,257 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:34:40,257 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:34:40,257 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:34:40,257 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:34:40,258 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:34:40,258 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:34:40,258 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:34:40,258 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:34:40,258 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:34:40,258 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:34:40,259 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:34:40,259 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:34:40,259 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:34:40,259 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:34:40,260 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:34:40,260 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:34:40,260 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:34:40,260 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:34:40,260 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:34:40,261 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:34:40,261 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:34:40,261 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:34:40,261 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:34:40,261 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:34:40,262 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:34:40,262 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:34:40,262 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_8faf7fe7-af5a-4df0-b1af-48322a9d2800/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 -> 30ea70b89721eac5ed4f63275a9abaeb19932fd3 [2019-11-15 23:34:40,287 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:34:40,296 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:34:40,299 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:34:40,300 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:34:40,300 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:34:40,301 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8faf7fe7-af5a-4df0-b1af-48322a9d2800/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix034_tso.oepc.i [2019-11-15 23:34:40,347 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8faf7fe7-af5a-4df0-b1af-48322a9d2800/bin/uautomizer/data/392de5ee5/41b0b4cb82364075b06a567045b7abb2/FLAG597cbc1e0 [2019-11-15 23:34:40,862 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:34:40,863 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8faf7fe7-af5a-4df0-b1af-48322a9d2800/sv-benchmarks/c/pthread-wmm/mix034_tso.oepc.i [2019-11-15 23:34:40,882 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8faf7fe7-af5a-4df0-b1af-48322a9d2800/bin/uautomizer/data/392de5ee5/41b0b4cb82364075b06a567045b7abb2/FLAG597cbc1e0 [2019-11-15 23:34:41,369 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8faf7fe7-af5a-4df0-b1af-48322a9d2800/bin/uautomizer/data/392de5ee5/41b0b4cb82364075b06a567045b7abb2 [2019-11-15 23:34:41,372 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:34:41,373 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:34:41,375 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:34:41,375 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:34:41,379 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:34:41,380 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:34:41" (1/1) ... [2019-11-15 23:34:41,383 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24a3561c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:34:41, skipping insertion in model container [2019-11-15 23:34:41,383 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:34:41" (1/1) ... [2019-11-15 23:34:41,390 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:34:41,435 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:34:41,871 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:34:41,885 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:34:41,964 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:34:42,045 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:34:42,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:34:42 WrapperNode [2019-11-15 23:34:42,046 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:34:42,047 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:34:42,047 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:34:42,047 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:34:42,055 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:34:42" (1/1) ... [2019-11-15 23:34:42,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 11:34:42" (1/1) ... [2019-11-15 23:34:42,102 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:34:42,103 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:34:42,103 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:34:42,103 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:34:42,110 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:34:42" (1/1) ... [2019-11-15 23:34:42,110 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:34:42" (1/1) ... [2019-11-15 23:34:42,114 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:34:42" (1/1) ... [2019-11-15 23:34:42,114 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:34:42" (1/1) ... [2019-11-15 23:34:42,123 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:34:42" (1/1) ... [2019-11-15 23:34:42,126 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:34:42" (1/1) ... [2019-11-15 23:34:42,130 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:34:42" (1/1) ... [2019-11-15 23:34:42,134 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:34:42,135 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:34:42,135 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:34:42,135 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:34:42,136 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:34:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8faf7fe7-af5a-4df0-b1af-48322a9d2800/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 23:34:42,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:34:42,216 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-15 23:34:42,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:34:42,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:34:42,218 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-15 23:34:42,218 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-15 23:34:42,219 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-15 23:34:42,219 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-15 23:34:42,219 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-15 23:34:42,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:34:42,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:34:42,221 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 23:34:42,826 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:34:42,826 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 23:34:42,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:34:42 BoogieIcfgContainer [2019-11-15 23:34:42,827 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:34:42,828 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:34:42,828 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:34:42,830 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:34:42,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:34:41" (1/3) ... [2019-11-15 23:34:42,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d036396 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:34:42, skipping insertion in model container [2019-11-15 23:34:42,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:34:42" (2/3) ... [2019-11-15 23:34:42,832 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d036396 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:34:42, skipping insertion in model container [2019-11-15 23:34:42,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:34:42" (3/3) ... [2019-11-15 23:34:42,834 INFO L109 eAbstractionObserver]: Analyzing ICFG mix034_tso.oepc.i [2019-11-15 23:34:42,877 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,878 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,878 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,878 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,878 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,878 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,879 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,879 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,880 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,880 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,880 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,880 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,881 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,881 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,881 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,881 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,881 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,882 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,882 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,882 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,882 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,883 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,883 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,883 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,883 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,883 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,884 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,884 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,884 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,884 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,885 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,885 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,885 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,885 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,889 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,889 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,889 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,890 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,890 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,890 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,890 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,891 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,891 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,892 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,892 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,892 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,893 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,893 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,893 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,894 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,894 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,894 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,894 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,894 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,894 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,895 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,895 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,896 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,896 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,896 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,896 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,896 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,897 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,897 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,897 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,897 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,897 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,897 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,898 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,898 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,898 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,898 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,899 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,899 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,899 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,899 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,899 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,900 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,900 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,900 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,900 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,900 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,900 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,901 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,901 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,901 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,901 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,901 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,901 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,902 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,902 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,902 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,903 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,903 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,903 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,903 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,904 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,904 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,904 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,904 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,905 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,908 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,908 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,908 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,908 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,909 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,910 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,910 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,911 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,911 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,911 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,911 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,912 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,918 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,919 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,919 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,919 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,919 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,919 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,920 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,920 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,920 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,920 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,920 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,920 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,921 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,921 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,921 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,921 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,921 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,921 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,922 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,922 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,922 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,922 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,922 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,922 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,923 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,923 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,923 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,923 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,923 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,923 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,924 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,924 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,924 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,924 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,924 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,924 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,925 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,925 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,925 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:34:42,934 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-15 23:34:42,935 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:34:42,942 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-15 23:34:42,952 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-15 23:34:42,967 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:34:42,967 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:34:42,967 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:34:42,967 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:34:42,967 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:34:42,967 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:34:42,967 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:34:42,968 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:34:42,978 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 142 places, 180 transitions [2019-11-15 23:34:45,125 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32592 states. [2019-11-15 23:34:45,127 INFO L276 IsEmpty]: Start isEmpty. Operand 32592 states. [2019-11-15 23:34:45,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 23:34:45,134 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:34:45,134 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] [2019-11-15 23:34:45,136 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:34:45,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:34:45,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1615524494, now seen corresponding path program 1 times [2019-11-15 23:34:45,148 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:34:45,149 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322277213] [2019-11-15 23:34:45,149 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:45,149 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:45,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:34:45,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:34:45,376 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 23:34:45,377 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322277213] [2019-11-15 23:34:45,377 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:34:45,378 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:34:45,378 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320139166] [2019-11-15 23:34:45,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:34:45,382 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:34:45,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:34:45,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:34:45,395 INFO L87 Difference]: Start difference. First operand 32592 states. Second operand 4 states. [2019-11-15 23:34:46,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:34:46,127 INFO L93 Difference]: Finished difference Result 33592 states and 129569 transitions. [2019-11-15 23:34:46,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:34:46,129 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-15 23:34:46,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:34:46,368 INFO L225 Difference]: With dead ends: 33592 [2019-11-15 23:34:46,368 INFO L226 Difference]: Without dead ends: 25704 [2019-11-15 23:34:46,370 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 23:34:46,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25704 states. [2019-11-15 23:34:47,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25704 to 25704. [2019-11-15 23:34:47,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25704 states. [2019-11-15 23:34:47,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25704 states to 25704 states and 99585 transitions. [2019-11-15 23:34:47,956 INFO L78 Accepts]: Start accepts. Automaton has 25704 states and 99585 transitions. Word has length 35 [2019-11-15 23:34:47,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:34:47,958 INFO L462 AbstractCegarLoop]: Abstraction has 25704 states and 99585 transitions. [2019-11-15 23:34:47,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:34:47,958 INFO L276 IsEmpty]: Start isEmpty. Operand 25704 states and 99585 transitions. [2019-11-15 23:34:47,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-15 23:34:47,975 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:34:47,975 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:34:47,976 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:34:47,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:34:47,976 INFO L82 PathProgramCache]: Analyzing trace with hash -815760078, now seen corresponding path program 1 times [2019-11-15 23:34:47,976 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:34:47,976 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668803887] [2019-11-15 23:34:47,977 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:47,977 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:47,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:34:48,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:34:48,143 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 23:34:48,144 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668803887] [2019-11-15 23:34:48,144 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:34:48,144 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:34:48,144 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227161055] [2019-11-15 23:34:48,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:34:48,146 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:34:48,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:34:48,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:34:48,146 INFO L87 Difference]: Start difference. First operand 25704 states and 99585 transitions. Second operand 5 states. [2019-11-15 23:34:49,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:34:49,305 INFO L93 Difference]: Finished difference Result 41082 states and 150432 transitions. [2019-11-15 23:34:49,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:34:49,306 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-11-15 23:34:49,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:34:49,438 INFO L225 Difference]: With dead ends: 41082 [2019-11-15 23:34:49,439 INFO L226 Difference]: Without dead ends: 40546 [2019-11-15 23:34:49,439 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 23:34:49,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40546 states. [2019-11-15 23:34:51,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40546 to 38926. [2019-11-15 23:34:51,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38926 states. [2019-11-15 23:34:51,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38926 states to 38926 states and 143582 transitions. [2019-11-15 23:34:51,226 INFO L78 Accepts]: Start accepts. Automaton has 38926 states and 143582 transitions. Word has length 47 [2019-11-15 23:34:51,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:34:51,229 INFO L462 AbstractCegarLoop]: Abstraction has 38926 states and 143582 transitions. [2019-11-15 23:34:51,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:34:51,230 INFO L276 IsEmpty]: Start isEmpty. Operand 38926 states and 143582 transitions. [2019-11-15 23:34:51,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-15 23:34:51,237 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:34:51,237 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] [2019-11-15 23:34:51,238 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:34:51,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:34:51,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1217511206, now seen corresponding path program 1 times [2019-11-15 23:34:51,239 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:34:51,239 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172856640] [2019-11-15 23:34:51,239 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:51,239 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:51,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:34:51,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:34:51,309 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 23:34:51,309 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172856640] [2019-11-15 23:34:51,309 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:34:51,310 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:34:51,310 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700702531] [2019-11-15 23:34:51,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:34:51,310 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:34:51,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:34:51,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:34:51,311 INFO L87 Difference]: Start difference. First operand 38926 states and 143582 transitions. Second operand 5 states. [2019-11-15 23:34:52,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:34:52,050 INFO L93 Difference]: Finished difference Result 49779 states and 180634 transitions. [2019-11-15 23:34:52,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:34:52,050 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-11-15 23:34:52,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:34:52,269 INFO L225 Difference]: With dead ends: 49779 [2019-11-15 23:34:52,269 INFO L226 Difference]: Without dead ends: 49275 [2019-11-15 23:34:52,270 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 23:34:52,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49275 states. [2019-11-15 23:34:53,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49275 to 42678. [2019-11-15 23:34:53,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42678 states. [2019-11-15 23:34:54,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42678 states to 42678 states and 156593 transitions. [2019-11-15 23:34:54,067 INFO L78 Accepts]: Start accepts. Automaton has 42678 states and 156593 transitions. Word has length 48 [2019-11-15 23:34:54,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:34:54,068 INFO L462 AbstractCegarLoop]: Abstraction has 42678 states and 156593 transitions. [2019-11-15 23:34:54,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:34:54,068 INFO L276 IsEmpty]: Start isEmpty. Operand 42678 states and 156593 transitions. [2019-11-15 23:34:54,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-15 23:34:54,077 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:34:54,077 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 23:34:54,077 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:34:54,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:34:54,078 INFO L82 PathProgramCache]: Analyzing trace with hash -825933952, now seen corresponding path program 1 times [2019-11-15 23:34:54,078 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:34:54,078 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613213246] [2019-11-15 23:34:54,078 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:54,079 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:54,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:34:54,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:34:54,122 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 23:34:54,123 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613213246] [2019-11-15 23:34:54,123 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:34:54,123 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:34:54,123 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600509168] [2019-11-15 23:34:54,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:34:54,124 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:34:54,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:34:54,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:34:54,124 INFO L87 Difference]: Start difference. First operand 42678 states and 156593 transitions. Second operand 3 states. [2019-11-15 23:34:54,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:34:54,462 INFO L93 Difference]: Finished difference Result 61088 states and 221431 transitions. [2019-11-15 23:34:54,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:34:54,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-15 23:34:54,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:34:54,626 INFO L225 Difference]: With dead ends: 61088 [2019-11-15 23:34:54,626 INFO L226 Difference]: Without dead ends: 61088 [2019-11-15 23:34:54,627 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 23:34:54,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61088 states. [2019-11-15 23:34:56,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61088 to 48017. [2019-11-15 23:34:56,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48017 states. [2019-11-15 23:34:56,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48017 states to 48017 states and 174180 transitions. [2019-11-15 23:34:56,499 INFO L78 Accepts]: Start accepts. Automaton has 48017 states and 174180 transitions. Word has length 50 [2019-11-15 23:34:56,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:34:56,499 INFO L462 AbstractCegarLoop]: Abstraction has 48017 states and 174180 transitions. [2019-11-15 23:34:56,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:34:56,500 INFO L276 IsEmpty]: Start isEmpty. Operand 48017 states and 174180 transitions. [2019-11-15 23:34:56,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-15 23:34:56,513 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:34:56,513 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:34:56,514 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:34:56,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:34:56,514 INFO L82 PathProgramCache]: Analyzing trace with hash 810527103, now seen corresponding path program 1 times [2019-11-15 23:34:56,514 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:34:56,514 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794072022] [2019-11-15 23:34:56,515 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:56,515 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:56,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:34:56,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:34:56,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:34:56,643 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794072022] [2019-11-15 23:34:56,643 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:34:56,643 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:34:56,643 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104372112] [2019-11-15 23:34:56,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:34:56,644 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:34:56,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:34:56,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:34:56,645 INFO L87 Difference]: Start difference. First operand 48017 states and 174180 transitions. Second operand 6 states. [2019-11-15 23:34:57,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:34:57,535 INFO L93 Difference]: Finished difference Result 63757 states and 229380 transitions. [2019-11-15 23:34:57,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:34:57,536 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-11-15 23:34:57,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:34:57,679 INFO L225 Difference]: With dead ends: 63757 [2019-11-15 23:34:57,679 INFO L226 Difference]: Without dead ends: 63757 [2019-11-15 23:34:57,680 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 23:34:57,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63757 states. [2019-11-15 23:35:02,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63757 to 59950. [2019-11-15 23:35:02,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59950 states. [2019-11-15 23:35:02,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59950 states to 59950 states and 215673 transitions. [2019-11-15 23:35:02,179 INFO L78 Accepts]: Start accepts. Automaton has 59950 states and 215673 transitions. Word has length 54 [2019-11-15 23:35:02,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:35:02,180 INFO L462 AbstractCegarLoop]: Abstraction has 59950 states and 215673 transitions. [2019-11-15 23:35:02,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:35:02,180 INFO L276 IsEmpty]: Start isEmpty. Operand 59950 states and 215673 transitions. [2019-11-15 23:35:02,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-15 23:35:02,197 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:35:02,199 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:35:02,199 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:35:02,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:35:02,200 INFO L82 PathProgramCache]: Analyzing trace with hash -986424256, now seen corresponding path program 1 times [2019-11-15 23:35:02,201 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:35:02,201 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477201698] [2019-11-15 23:35:02,201 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:02,201 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:02,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:35:02,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:35:02,307 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 23:35:02,308 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477201698] [2019-11-15 23:35:02,309 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:35:02,309 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:35:02,309 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621534897] [2019-11-15 23:35:02,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:35:02,310 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:35:02,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:35:02,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:35:02,311 INFO L87 Difference]: Start difference. First operand 59950 states and 215673 transitions. Second operand 7 states. [2019-11-15 23:35:03,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:35:03,585 INFO L93 Difference]: Finished difference Result 83686 states and 290098 transitions. [2019-11-15 23:35:03,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:35:03,586 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-11-15 23:35:03,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:35:03,771 INFO L225 Difference]: With dead ends: 83686 [2019-11-15 23:35:03,771 INFO L226 Difference]: Without dead ends: 83686 [2019-11-15 23:35:03,772 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 23:35:04,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83686 states. [2019-11-15 23:35:05,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83686 to 71013. [2019-11-15 23:35:05,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71013 states. [2019-11-15 23:35:05,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71013 states to 71013 states and 249887 transitions. [2019-11-15 23:35:05,649 INFO L78 Accepts]: Start accepts. Automaton has 71013 states and 249887 transitions. Word has length 54 [2019-11-15 23:35:05,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:35:05,649 INFO L462 AbstractCegarLoop]: Abstraction has 71013 states and 249887 transitions. [2019-11-15 23:35:05,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:35:05,649 INFO L276 IsEmpty]: Start isEmpty. Operand 71013 states and 249887 transitions. [2019-11-15 23:35:05,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-15 23:35:05,663 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:35:05,663 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:35:05,663 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:35:05,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:35:05,664 INFO L82 PathProgramCache]: Analyzing trace with hash -98920575, now seen corresponding path program 1 times [2019-11-15 23:35:05,664 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:35:05,664 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403864880] [2019-11-15 23:35:05,664 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:05,664 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:05,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:35:05,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:35:05,718 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 23:35:05,718 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403864880] [2019-11-15 23:35:05,718 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:35:05,719 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:35:05,719 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013121370] [2019-11-15 23:35:05,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:35:05,719 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:35:05,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:35:05,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:35:05,719 INFO L87 Difference]: Start difference. First operand 71013 states and 249887 transitions. Second operand 3 states. [2019-11-15 23:35:05,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:35:05,962 INFO L93 Difference]: Finished difference Result 54022 states and 188919 transitions. [2019-11-15 23:35:05,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:35:05,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-11-15 23:35:05,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:35:06,067 INFO L225 Difference]: With dead ends: 54022 [2019-11-15 23:35:06,067 INFO L226 Difference]: Without dead ends: 54022 [2019-11-15 23:35:06,068 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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 23:35:06,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54022 states. [2019-11-15 23:35:06,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54022 to 53407. [2019-11-15 23:35:06,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53407 states. [2019-11-15 23:35:06,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53407 states to 53407 states and 187038 transitions. [2019-11-15 23:35:06,994 INFO L78 Accepts]: Start accepts. Automaton has 53407 states and 187038 transitions. Word has length 54 [2019-11-15 23:35:06,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:35:06,995 INFO L462 AbstractCegarLoop]: Abstraction has 53407 states and 187038 transitions. [2019-11-15 23:35:06,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:35:06,995 INFO L276 IsEmpty]: Start isEmpty. Operand 53407 states and 187038 transitions. [2019-11-15 23:35:07,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-15 23:35:07,003 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:35:07,003 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:35:07,003 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:35:07,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:35:07,004 INFO L82 PathProgramCache]: Analyzing trace with hash -698836789, now seen corresponding path program 1 times [2019-11-15 23:35:07,004 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:35:07,004 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121754110] [2019-11-15 23:35:07,004 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:07,004 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:07,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:35:07,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:35:07,072 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 23:35:07,072 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121754110] [2019-11-15 23:35:07,072 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:35:07,072 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:35:07,073 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825203581] [2019-11-15 23:35:07,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:35:07,073 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:35:07,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:35:07,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:35:07,073 INFO L87 Difference]: Start difference. First operand 53407 states and 187038 transitions. Second operand 6 states. [2019-11-15 23:35:07,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:35:07,879 INFO L93 Difference]: Finished difference Result 68647 states and 237302 transitions. [2019-11-15 23:35:07,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 23:35:07,880 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-11-15 23:35:07,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:35:08,044 INFO L225 Difference]: With dead ends: 68647 [2019-11-15 23:35:08,045 INFO L226 Difference]: Without dead ends: 68079 [2019-11-15 23:35:08,045 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:35:08,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68079 states. [2019-11-15 23:35:09,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68079 to 53491. [2019-11-15 23:35:09,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53491 states. [2019-11-15 23:35:09,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53491 states to 53491 states and 187735 transitions. [2019-11-15 23:35:09,695 INFO L78 Accepts]: Start accepts. Automaton has 53491 states and 187735 transitions. Word has length 54 [2019-11-15 23:35:09,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:35:09,696 INFO L462 AbstractCegarLoop]: Abstraction has 53491 states and 187735 transitions. [2019-11-15 23:35:09,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:35:09,696 INFO L276 IsEmpty]: Start isEmpty. Operand 53491 states and 187735 transitions. [2019-11-15 23:35:09,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-15 23:35:09,707 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:35:09,707 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] [2019-11-15 23:35:09,707 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:35:09,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:35:09,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1459554400, now seen corresponding path program 1 times [2019-11-15 23:35:09,707 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:35:09,707 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204118274] [2019-11-15 23:35:09,708 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:09,708 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:09,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:35:09,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:35:09,790 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 23:35:09,790 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204118274] [2019-11-15 23:35:09,790 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:35:09,790 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:35:09,790 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812619230] [2019-11-15 23:35:09,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:35:09,791 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:35:09,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:35:09,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:35:09,791 INFO L87 Difference]: Start difference. First operand 53491 states and 187735 transitions. Second operand 6 states. [2019-11-15 23:35:10,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:35:10,590 INFO L93 Difference]: Finished difference Result 67850 states and 231361 transitions. [2019-11-15 23:35:10,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:35:10,590 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-11-15 23:35:10,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:35:10,718 INFO L225 Difference]: With dead ends: 67850 [2019-11-15 23:35:10,719 INFO L226 Difference]: Without dead ends: 67850 [2019-11-15 23:35:10,719 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:35:10,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67850 states. [2019-11-15 23:35:11,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67850 to 59082. [2019-11-15 23:35:11,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59082 states. [2019-11-15 23:35:11,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59082 states to 59082 states and 204131 transitions. [2019-11-15 23:35:11,796 INFO L78 Accepts]: Start accepts. Automaton has 59082 states and 204131 transitions. Word has length 55 [2019-11-15 23:35:11,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:35:11,796 INFO L462 AbstractCegarLoop]: Abstraction has 59082 states and 204131 transitions. [2019-11-15 23:35:11,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:35:11,797 INFO L276 IsEmpty]: Start isEmpty. Operand 59082 states and 204131 transitions. [2019-11-15 23:35:11,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-15 23:35:11,806 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:35:11,806 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] [2019-11-15 23:35:11,806 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:35:11,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:35:11,807 INFO L82 PathProgramCache]: Analyzing trace with hash -572050719, now seen corresponding path program 1 times [2019-11-15 23:35:11,807 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:35:11,807 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600240388] [2019-11-15 23:35:11,807 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:11,807 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:11,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:35:11,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:35:11,876 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 23:35:11,876 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600240388] [2019-11-15 23:35:11,876 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:35:11,876 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:35:11,877 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064452248] [2019-11-15 23:35:11,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:35:11,877 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:35:11,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:35:11,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:35:11,878 INFO L87 Difference]: Start difference. First operand 59082 states and 204131 transitions. Second operand 4 states. [2019-11-15 23:35:11,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:35:11,933 INFO L93 Difference]: Finished difference Result 10213 states and 31247 transitions. [2019-11-15 23:35:11,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:35:11,933 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-11-15 23:35:11,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:35:11,943 INFO L225 Difference]: With dead ends: 10213 [2019-11-15 23:35:11,943 INFO L226 Difference]: Without dead ends: 8508 [2019-11-15 23:35:11,943 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 23:35:11,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8508 states. [2019-11-15 23:35:12,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8508 to 8460. [2019-11-15 23:35:12,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8460 states. [2019-11-15 23:35:12,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8460 states to 8460 states and 25326 transitions. [2019-11-15 23:35:12,042 INFO L78 Accepts]: Start accepts. Automaton has 8460 states and 25326 transitions. Word has length 55 [2019-11-15 23:35:12,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:35:12,043 INFO L462 AbstractCegarLoop]: Abstraction has 8460 states and 25326 transitions. [2019-11-15 23:35:12,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:35:12,043 INFO L276 IsEmpty]: Start isEmpty. Operand 8460 states and 25326 transitions. [2019-11-15 23:35:12,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-15 23:35:12,045 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:35:12,045 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] [2019-11-15 23:35:12,046 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:35:12,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:35:12,046 INFO L82 PathProgramCache]: Analyzing trace with hash 672105094, now seen corresponding path program 1 times [2019-11-15 23:35:12,046 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:35:12,046 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753005402] [2019-11-15 23:35:12,046 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:12,046 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:12,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:35:12,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:35:12,117 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 23:35:12,117 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753005402] [2019-11-15 23:35:12,118 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:35:12,118 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:35:12,118 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303870985] [2019-11-15 23:35:12,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:35:12,118 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:35:12,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:35:12,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:35:12,119 INFO L87 Difference]: Start difference. First operand 8460 states and 25326 transitions. Second operand 6 states. [2019-11-15 23:35:12,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:35:12,480 INFO L93 Difference]: Finished difference Result 10741 states and 31734 transitions. [2019-11-15 23:35:12,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:35:12,480 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-11-15 23:35:12,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:35:12,496 INFO L225 Difference]: With dead ends: 10741 [2019-11-15 23:35:12,496 INFO L226 Difference]: Without dead ends: 10680 [2019-11-15 23:35:12,497 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 23:35:12,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10680 states. [2019-11-15 23:35:12,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10680 to 9961. [2019-11-15 23:35:12,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9961 states. [2019-11-15 23:35:12,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9961 states to 9961 states and 29612 transitions. [2019-11-15 23:35:12,663 INFO L78 Accepts]: Start accepts. Automaton has 9961 states and 29612 transitions. Word has length 62 [2019-11-15 23:35:12,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:35:12,663 INFO L462 AbstractCegarLoop]: Abstraction has 9961 states and 29612 transitions. [2019-11-15 23:35:12,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:35:12,663 INFO L276 IsEmpty]: Start isEmpty. Operand 9961 states and 29612 transitions. [2019-11-15 23:35:12,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 23:35:12,674 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:35:12,674 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 23:35:12,675 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:35:12,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:35:12,675 INFO L82 PathProgramCache]: Analyzing trace with hash -727186746, now seen corresponding path program 1 times [2019-11-15 23:35:12,675 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:35:12,675 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984538794] [2019-11-15 23:35:12,676 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:12,676 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:12,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:35:12,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:35:12,753 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 23:35:12,753 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984538794] [2019-11-15 23:35:12,753 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:35:12,753 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:35:12,753 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163101285] [2019-11-15 23:35:12,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:35:12,754 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:35:12,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:35:12,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:35:12,754 INFO L87 Difference]: Start difference. First operand 9961 states and 29612 transitions. Second operand 4 states. [2019-11-15 23:35:13,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:35:13,118 INFO L93 Difference]: Finished difference Result 12779 states and 37556 transitions. [2019-11-15 23:35:13,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:35:13,118 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-11-15 23:35:13,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:35:13,137 INFO L225 Difference]: With dead ends: 12779 [2019-11-15 23:35:13,137 INFO L226 Difference]: Without dead ends: 12779 [2019-11-15 23:35:13,137 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 23:35:13,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12779 states. [2019-11-15 23:35:13,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12779 to 11120. [2019-11-15 23:35:13,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11120 states. [2019-11-15 23:35:13,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11120 states to 11120 states and 32800 transitions. [2019-11-15 23:35:13,272 INFO L78 Accepts]: Start accepts. Automaton has 11120 states and 32800 transitions. Word has length 68 [2019-11-15 23:35:13,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:35:13,272 INFO L462 AbstractCegarLoop]: Abstraction has 11120 states and 32800 transitions. [2019-11-15 23:35:13,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:35:13,273 INFO L276 IsEmpty]: Start isEmpty. Operand 11120 states and 32800 transitions. [2019-11-15 23:35:13,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 23:35:13,278 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:35:13,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:35:13,278 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:35:13,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:35:13,278 INFO L82 PathProgramCache]: Analyzing trace with hash 517577735, now seen corresponding path program 1 times [2019-11-15 23:35:13,278 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:35:13,279 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63945210] [2019-11-15 23:35:13,279 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:13,279 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:13,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:35:13,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:35:13,375 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 23:35:13,375 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63945210] [2019-11-15 23:35:13,376 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:35:13,376 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:35:13,376 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336837095] [2019-11-15 23:35:13,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:35:13,376 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:35:13,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:35:13,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:35:13,377 INFO L87 Difference]: Start difference. First operand 11120 states and 32800 transitions. Second operand 6 states. [2019-11-15 23:35:13,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:35:13,824 INFO L93 Difference]: Finished difference Result 12254 states and 35521 transitions. [2019-11-15 23:35:13,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:35:13,824 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-11-15 23:35:13,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:35:13,837 INFO L225 Difference]: With dead ends: 12254 [2019-11-15 23:35:13,837 INFO L226 Difference]: Without dead ends: 12254 [2019-11-15 23:35:13,837 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 23:35:13,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12254 states. [2019-11-15 23:35:13,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12254 to 11959. [2019-11-15 23:35:13,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11959 states. [2019-11-15 23:35:13,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11959 states to 11959 states and 34775 transitions. [2019-11-15 23:35:13,977 INFO L78 Accepts]: Start accepts. Automaton has 11959 states and 34775 transitions. Word has length 68 [2019-11-15 23:35:13,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:35:13,977 INFO L462 AbstractCegarLoop]: Abstraction has 11959 states and 34775 transitions. [2019-11-15 23:35:13,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:35:13,977 INFO L276 IsEmpty]: Start isEmpty. Operand 11959 states and 34775 transitions. [2019-11-15 23:35:13,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 23:35:13,984 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:35:13,985 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 23:35:13,985 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:35:13,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:35:13,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1559631608, now seen corresponding path program 1 times [2019-11-15 23:35:13,985 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:35:13,986 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154922261] [2019-11-15 23:35:13,986 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:13,986 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:13,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:35:13,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:35:14,063 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 23:35:14,063 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154922261] [2019-11-15 23:35:14,063 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:35:14,063 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:35:14,063 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082917501] [2019-11-15 23:35:14,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:35:14,063 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:35:14,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:35:14,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:35:14,064 INFO L87 Difference]: Start difference. First operand 11959 states and 34775 transitions. Second operand 6 states. [2019-11-15 23:35:14,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:35:14,430 INFO L93 Difference]: Finished difference Result 13808 states and 38964 transitions. [2019-11-15 23:35:14,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:35:14,430 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-11-15 23:35:14,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:35:14,446 INFO L225 Difference]: With dead ends: 13808 [2019-11-15 23:35:14,446 INFO L226 Difference]: Without dead ends: 13808 [2019-11-15 23:35:14,446 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 23:35:14,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13808 states. [2019-11-15 23:35:14,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13808 to 12522. [2019-11-15 23:35:14,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12522 states. [2019-11-15 23:35:14,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12522 states to 12522 states and 35774 transitions. [2019-11-15 23:35:14,609 INFO L78 Accepts]: Start accepts. Automaton has 12522 states and 35774 transitions. Word has length 68 [2019-11-15 23:35:14,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:35:14,610 INFO L462 AbstractCegarLoop]: Abstraction has 12522 states and 35774 transitions. [2019-11-15 23:35:14,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:35:14,610 INFO L276 IsEmpty]: Start isEmpty. Operand 12522 states and 35774 transitions. [2019-11-15 23:35:14,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 23:35:14,618 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:35:14,619 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 23:35:14,619 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:35:14,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:35:14,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1348280695, now seen corresponding path program 1 times [2019-11-15 23:35:14,619 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:35:14,619 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683371967] [2019-11-15 23:35:14,619 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:14,619 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:14,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:35:14,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:35:14,698 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 23:35:14,698 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683371967] [2019-11-15 23:35:14,699 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:35:14,699 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:35:14,699 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342815329] [2019-11-15 23:35:14,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:35:14,699 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:35:14,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:35:14,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:35:14,700 INFO L87 Difference]: Start difference. First operand 12522 states and 35774 transitions. Second operand 5 states. [2019-11-15 23:35:15,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:35:15,102 INFO L93 Difference]: Finished difference Result 16038 states and 45579 transitions. [2019-11-15 23:35:15,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:35:15,103 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-11-15 23:35:15,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:35:15,127 INFO L225 Difference]: With dead ends: 16038 [2019-11-15 23:35:15,127 INFO L226 Difference]: Without dead ends: 16038 [2019-11-15 23:35:15,129 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:35:15,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16038 states. [2019-11-15 23:35:15,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16038 to 14892. [2019-11-15 23:35:15,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14892 states. [2019-11-15 23:35:15,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14892 states to 14892 states and 42227 transitions. [2019-11-15 23:35:15,313 INFO L78 Accepts]: Start accepts. Automaton has 14892 states and 42227 transitions. Word has length 68 [2019-11-15 23:35:15,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:35:15,314 INFO L462 AbstractCegarLoop]: Abstraction has 14892 states and 42227 transitions. [2019-11-15 23:35:15,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:35:15,314 INFO L276 IsEmpty]: Start isEmpty. Operand 14892 states and 42227 transitions. [2019-11-15 23:35:15,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 23:35:15,322 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:35:15,323 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 23:35:15,323 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:35:15,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:35:15,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1858814872, now seen corresponding path program 1 times [2019-11-15 23:35:15,323 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:35:15,323 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192755255] [2019-11-15 23:35:15,323 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:15,323 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:15,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:35:15,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:35:15,387 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 23:35:15,389 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192755255] [2019-11-15 23:35:15,392 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:35:15,395 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:35:15,395 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937331090] [2019-11-15 23:35:15,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:35:15,396 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:35:15,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:35:15,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:35:15,396 INFO L87 Difference]: Start difference. First operand 14892 states and 42227 transitions. Second operand 4 states. [2019-11-15 23:35:15,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:35:15,891 INFO L93 Difference]: Finished difference Result 18321 states and 52088 transitions. [2019-11-15 23:35:15,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:35:15,892 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-11-15 23:35:15,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:35:15,917 INFO L225 Difference]: With dead ends: 18321 [2019-11-15 23:35:15,917 INFO L226 Difference]: Without dead ends: 18144 [2019-11-15 23:35:15,917 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 23:35:15,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18144 states. [2019-11-15 23:35:16,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18144 to 17301. [2019-11-15 23:35:16,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17301 states. [2019-11-15 23:35:16,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17301 states to 17301 states and 49086 transitions. [2019-11-15 23:35:16,138 INFO L78 Accepts]: Start accepts. Automaton has 17301 states and 49086 transitions. Word has length 68 [2019-11-15 23:35:16,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:35:16,138 INFO L462 AbstractCegarLoop]: Abstraction has 17301 states and 49086 transitions. [2019-11-15 23:35:16,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:35:16,138 INFO L276 IsEmpty]: Start isEmpty. Operand 17301 states and 49086 transitions. [2019-11-15 23:35:16,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 23:35:16,144 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:35:16,144 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:35:16,144 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:35:16,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:35:16,145 INFO L82 PathProgramCache]: Analyzing trace with hash 639201065, now seen corresponding path program 1 times [2019-11-15 23:35:16,145 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:35:16,145 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077323513] [2019-11-15 23:35:16,145 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:16,145 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:16,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:35:16,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:35:16,226 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 23:35:16,226 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077323513] [2019-11-15 23:35:16,227 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:35:16,227 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:35:16,227 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407381070] [2019-11-15 23:35:16,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:35:16,227 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:35:16,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:35:16,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:35:16,228 INFO L87 Difference]: Start difference. First operand 17301 states and 49086 transitions. Second operand 5 states. [2019-11-15 23:35:16,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:35:16,326 INFO L93 Difference]: Finished difference Result 16587 states and 45829 transitions. [2019-11-15 23:35:16,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:35:16,327 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-11-15 23:35:16,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:35:16,351 INFO L225 Difference]: With dead ends: 16587 [2019-11-15 23:35:16,351 INFO L226 Difference]: Without dead ends: 16587 [2019-11-15 23:35:16,351 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 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 23:35:16,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16587 states. [2019-11-15 23:35:16,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16587 to 14096. [2019-11-15 23:35:16,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14096 states. [2019-11-15 23:35:16,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14096 states to 14096 states and 38807 transitions. [2019-11-15 23:35:16,536 INFO L78 Accepts]: Start accepts. Automaton has 14096 states and 38807 transitions. Word has length 68 [2019-11-15 23:35:16,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:35:16,536 INFO L462 AbstractCegarLoop]: Abstraction has 14096 states and 38807 transitions. [2019-11-15 23:35:16,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:35:16,536 INFO L276 IsEmpty]: Start isEmpty. Operand 14096 states and 38807 transitions. [2019-11-15 23:35:16,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 23:35:16,541 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:35:16,541 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 23:35:16,541 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:35:16,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:35:16,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1526704746, now seen corresponding path program 1 times [2019-11-15 23:35:16,542 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:35:16,542 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936792271] [2019-11-15 23:35:16,542 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:16,542 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:16,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:35:16,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:35:16,618 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 23:35:16,618 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936792271] [2019-11-15 23:35:16,618 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:35:16,618 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:35:16,619 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790826615] [2019-11-15 23:35:16,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:35:16,620 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:35:16,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:35:16,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:35:16,620 INFO L87 Difference]: Start difference. First operand 14096 states and 38807 transitions. Second operand 5 states. [2019-11-15 23:35:16,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:35:16,673 INFO L93 Difference]: Finished difference Result 5057 states and 11952 transitions. [2019-11-15 23:35:16,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:35:16,674 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-11-15 23:35:16,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:35:16,678 INFO L225 Difference]: With dead ends: 5057 [2019-11-15 23:35:16,678 INFO L226 Difference]: Without dead ends: 4415 [2019-11-15 23:35:16,679 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 23:35:16,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4415 states. [2019-11-15 23:35:16,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4415 to 4403. [2019-11-15 23:35:16,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4403 states. [2019-11-15 23:35:16,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4403 states to 4403 states and 10064 transitions. [2019-11-15 23:35:16,730 INFO L78 Accepts]: Start accepts. Automaton has 4403 states and 10064 transitions. Word has length 68 [2019-11-15 23:35:16,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:35:16,730 INFO L462 AbstractCegarLoop]: Abstraction has 4403 states and 10064 transitions. [2019-11-15 23:35:16,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:35:16,731 INFO L276 IsEmpty]: Start isEmpty. Operand 4403 states and 10064 transitions. [2019-11-15 23:35:16,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 23:35:16,735 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:35:16,735 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 23:35:16,735 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:35:16,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:35:16,736 INFO L82 PathProgramCache]: Analyzing trace with hash 237281463, now seen corresponding path program 1 times [2019-11-15 23:35:16,736 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:35:16,736 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474583491] [2019-11-15 23:35:16,736 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:16,736 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:16,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:35:16,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:35:16,776 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 23:35:16,776 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474583491] [2019-11-15 23:35:16,777 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:35:16,777 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:35:16,777 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269187646] [2019-11-15 23:35:16,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:35:16,778 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:35:16,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:35:16,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:35:16,779 INFO L87 Difference]: Start difference. First operand 4403 states and 10064 transitions. Second operand 3 states. [2019-11-15 23:35:16,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:35:16,811 INFO L93 Difference]: Finished difference Result 5379 states and 12070 transitions. [2019-11-15 23:35:16,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:35:16,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-11-15 23:35:16,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:35:16,815 INFO L225 Difference]: With dead ends: 5379 [2019-11-15 23:35:16,815 INFO L226 Difference]: Without dead ends: 5379 [2019-11-15 23:35:16,816 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 23:35:16,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5379 states. [2019-11-15 23:35:16,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5379 to 4363. [2019-11-15 23:35:16,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4363 states. [2019-11-15 23:35:16,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4363 states to 4363 states and 9681 transitions. [2019-11-15 23:35:16,857 INFO L78 Accepts]: Start accepts. Automaton has 4363 states and 9681 transitions. Word has length 68 [2019-11-15 23:35:16,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:35:16,857 INFO L462 AbstractCegarLoop]: Abstraction has 4363 states and 9681 transitions. [2019-11-15 23:35:16,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:35:16,857 INFO L276 IsEmpty]: Start isEmpty. Operand 4363 states and 9681 transitions. [2019-11-15 23:35:16,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-15 23:35:16,860 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:35:16,860 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] [2019-11-15 23:35:16,861 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:35:16,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:35:16,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1029691817, now seen corresponding path program 1 times [2019-11-15 23:35:16,861 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:35:16,861 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261843289] [2019-11-15 23:35:16,861 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:16,861 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:16,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:35:16,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:35:16,934 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 23:35:16,935 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261843289] [2019-11-15 23:35:16,935 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:35:16,935 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:35:16,935 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239123934] [2019-11-15 23:35:16,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:35:16,936 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:35:16,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:35:16,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:35:16,937 INFO L87 Difference]: Start difference. First operand 4363 states and 9681 transitions. Second operand 7 states. [2019-11-15 23:35:17,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:35:17,320 INFO L93 Difference]: Finished difference Result 5136 states and 11285 transitions. [2019-11-15 23:35:17,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 23:35:17,320 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-11-15 23:35:17,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:35:17,324 INFO L225 Difference]: With dead ends: 5136 [2019-11-15 23:35:17,324 INFO L226 Difference]: Without dead ends: 5083 [2019-11-15 23:35:17,324 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 23:35:17,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5083 states. [2019-11-15 23:35:17,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5083 to 4435. [2019-11-15 23:35:17,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4435 states. [2019-11-15 23:35:17,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4435 states to 4435 states and 9733 transitions. [2019-11-15 23:35:17,366 INFO L78 Accepts]: Start accepts. Automaton has 4435 states and 9733 transitions. Word has length 74 [2019-11-15 23:35:17,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:35:17,366 INFO L462 AbstractCegarLoop]: Abstraction has 4435 states and 9733 transitions. [2019-11-15 23:35:17,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:35:17,366 INFO L276 IsEmpty]: Start isEmpty. Operand 4435 states and 9733 transitions. [2019-11-15 23:35:17,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 23:35:17,369 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:35:17,370 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] [2019-11-15 23:35:17,370 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:35:17,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:35:17,370 INFO L82 PathProgramCache]: Analyzing trace with hash 2110925138, now seen corresponding path program 1 times [2019-11-15 23:35:17,371 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:35:17,371 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037448939] [2019-11-15 23:35:17,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:17,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:17,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:35:17,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:35:17,426 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 23:35:17,426 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037448939] [2019-11-15 23:35:17,427 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:35:17,427 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:35:17,427 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703933728] [2019-11-15 23:35:17,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:35:17,428 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:35:17,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:35:17,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:35:17,428 INFO L87 Difference]: Start difference. First operand 4435 states and 9733 transitions. Second operand 5 states. [2019-11-15 23:35:17,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:35:17,670 INFO L93 Difference]: Finished difference Result 5310 states and 11604 transitions. [2019-11-15 23:35:17,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:35:17,670 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-11-15 23:35:17,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:35:17,674 INFO L225 Difference]: With dead ends: 5310 [2019-11-15 23:35:17,675 INFO L226 Difference]: Without dead ends: 5310 [2019-11-15 23:35:17,675 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 23:35:17,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5310 states. [2019-11-15 23:35:17,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5310 to 4567. [2019-11-15 23:35:17,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4567 states. [2019-11-15 23:35:17,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4567 states to 4567 states and 10023 transitions. [2019-11-15 23:35:17,727 INFO L78 Accepts]: Start accepts. Automaton has 4567 states and 10023 transitions. Word has length 95 [2019-11-15 23:35:17,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:35:17,728 INFO L462 AbstractCegarLoop]: Abstraction has 4567 states and 10023 transitions. [2019-11-15 23:35:17,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:35:17,728 INFO L276 IsEmpty]: Start isEmpty. Operand 4567 states and 10023 transitions. [2019-11-15 23:35:17,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 23:35:17,733 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:35:17,733 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] [2019-11-15 23:35:17,733 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:35:17,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:35:17,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1072928632, now seen corresponding path program 2 times [2019-11-15 23:35:17,734 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:35:17,734 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143667285] [2019-11-15 23:35:17,734 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:17,735 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:17,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:35:17,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:35:17,797 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 23:35:17,798 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143667285] [2019-11-15 23:35:17,798 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:35:17,798 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:35:17,798 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979037351] [2019-11-15 23:35:17,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:35:17,799 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:35:17,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:35:17,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:35:17,800 INFO L87 Difference]: Start difference. First operand 4567 states and 10023 transitions. Second operand 4 states. [2019-11-15 23:35:17,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:35:17,891 INFO L93 Difference]: Finished difference Result 5426 states and 11844 transitions. [2019-11-15 23:35:17,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:35:17,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-15 23:35:17,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:35:17,895 INFO L225 Difference]: With dead ends: 5426 [2019-11-15 23:35:17,895 INFO L226 Difference]: Without dead ends: 5426 [2019-11-15 23:35:17,895 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 23:35:17,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5426 states. [2019-11-15 23:35:17,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5426 to 4715. [2019-11-15 23:35:17,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4715 states. [2019-11-15 23:35:17,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4715 states to 4715 states and 10327 transitions. [2019-11-15 23:35:17,959 INFO L78 Accepts]: Start accepts. Automaton has 4715 states and 10327 transitions. Word has length 95 [2019-11-15 23:35:17,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:35:17,959 INFO L462 AbstractCegarLoop]: Abstraction has 4715 states and 10327 transitions. [2019-11-15 23:35:17,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:35:17,959 INFO L276 IsEmpty]: Start isEmpty. Operand 4715 states and 10327 transitions. [2019-11-15 23:35:17,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-15 23:35:17,964 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:35:17,965 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 23:35:17,965 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:35:17,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:35:17,965 INFO L82 PathProgramCache]: Analyzing trace with hash -96023015, now seen corresponding path program 1 times [2019-11-15 23:35:17,965 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:35:17,965 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200515975] [2019-11-15 23:35:17,965 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:17,966 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:17,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:35:17,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:35:18,048 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 23:35:18,048 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200515975] [2019-11-15 23:35:18,049 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:35:18,049 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:35:18,049 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390024061] [2019-11-15 23:35:18,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:35:18,049 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:35:18,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:35:18,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:35:18,050 INFO L87 Difference]: Start difference. First operand 4715 states and 10327 transitions. Second operand 6 states. [2019-11-15 23:35:18,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:35:18,270 INFO L93 Difference]: Finished difference Result 4815 states and 10551 transitions. [2019-11-15 23:35:18,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:35:18,270 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-11-15 23:35:18,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:35:18,275 INFO L225 Difference]: With dead ends: 4815 [2019-11-15 23:35:18,275 INFO L226 Difference]: Without dead ends: 4815 [2019-11-15 23:35:18,276 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 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 23:35:18,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4815 states. [2019-11-15 23:35:18,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4815 to 4602. [2019-11-15 23:35:18,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4602 states. [2019-11-15 23:35:18,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4602 states to 4602 states and 10104 transitions. [2019-11-15 23:35:18,320 INFO L78 Accepts]: Start accepts. Automaton has 4602 states and 10104 transitions. Word has length 97 [2019-11-15 23:35:18,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:35:18,321 INFO L462 AbstractCegarLoop]: Abstraction has 4602 states and 10104 transitions. [2019-11-15 23:35:18,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:35:18,321 INFO L276 IsEmpty]: Start isEmpty. Operand 4602 states and 10104 transitions. [2019-11-15 23:35:18,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-15 23:35:18,324 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:35:18,324 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 23:35:18,324 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:35:18,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:35:18,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1365627418, now seen corresponding path program 1 times [2019-11-15 23:35:18,325 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:35:18,325 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443426078] [2019-11-15 23:35:18,325 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:18,325 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:18,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:35:18,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:35:18,388 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 23:35:18,388 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443426078] [2019-11-15 23:35:18,388 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:35:18,389 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:35:18,389 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780739265] [2019-11-15 23:35:18,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:35:18,389 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:35:18,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:35:18,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:35:18,390 INFO L87 Difference]: Start difference. First operand 4602 states and 10104 transitions. Second operand 4 states. [2019-11-15 23:35:18,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:35:18,592 INFO L93 Difference]: Finished difference Result 5807 states and 12707 transitions. [2019-11-15 23:35:18,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:35:18,593 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-15 23:35:18,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:35:18,598 INFO L225 Difference]: With dead ends: 5807 [2019-11-15 23:35:18,599 INFO L226 Difference]: Without dead ends: 5767 [2019-11-15 23:35:18,599 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 23:35:18,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5767 states. [2019-11-15 23:35:18,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5767 to 5494. [2019-11-15 23:35:18,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5494 states. [2019-11-15 23:35:18,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5494 states to 5494 states and 12035 transitions. [2019-11-15 23:35:18,650 INFO L78 Accepts]: Start accepts. Automaton has 5494 states and 12035 transitions. Word has length 97 [2019-11-15 23:35:18,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:35:18,651 INFO L462 AbstractCegarLoop]: Abstraction has 5494 states and 12035 transitions. [2019-11-15 23:35:18,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:35:18,651 INFO L276 IsEmpty]: Start isEmpty. Operand 5494 states and 12035 transitions. [2019-11-15 23:35:18,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-15 23:35:18,656 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:35:18,657 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 23:35:18,657 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:35:18,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:35:18,657 INFO L82 PathProgramCache]: Analyzing trace with hash -711581925, now seen corresponding path program 1 times [2019-11-15 23:35:18,657 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:35:18,658 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565744684] [2019-11-15 23:35:18,658 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:18,658 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:18,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:35:18,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:35:18,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:35:18,822 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565744684] [2019-11-15 23:35:18,822 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:35:18,822 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 23:35:18,822 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628731892] [2019-11-15 23:35:18,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:35:18,823 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:35:18,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:35:18,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:35:18,823 INFO L87 Difference]: Start difference. First operand 5494 states and 12035 transitions. Second operand 9 states. [2019-11-15 23:35:19,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:35:19,537 INFO L93 Difference]: Finished difference Result 6169 states and 13359 transitions. [2019-11-15 23:35:19,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 23:35:19,537 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-11-15 23:35:19,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:35:19,542 INFO L225 Difference]: With dead ends: 6169 [2019-11-15 23:35:19,543 INFO L226 Difference]: Without dead ends: 6169 [2019-11-15 23:35:19,543 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-11-15 23:35:19,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6169 states. [2019-11-15 23:35:19,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6169 to 5161. [2019-11-15 23:35:19,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5161 states. [2019-11-15 23:35:19,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5161 states to 5161 states and 11249 transitions. [2019-11-15 23:35:19,613 INFO L78 Accepts]: Start accepts. Automaton has 5161 states and 11249 transitions. Word has length 97 [2019-11-15 23:35:19,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:35:19,613 INFO L462 AbstractCegarLoop]: Abstraction has 5161 states and 11249 transitions. [2019-11-15 23:35:19,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:35:19,613 INFO L276 IsEmpty]: Start isEmpty. Operand 5161 states and 11249 transitions. [2019-11-15 23:35:19,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-15 23:35:19,620 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:35:19,621 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 23:35:19,621 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:35:19,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:35:19,622 INFO L82 PathProgramCache]: Analyzing trace with hash -500231012, now seen corresponding path program 1 times [2019-11-15 23:35:19,622 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:35:19,622 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91791460] [2019-11-15 23:35:19,622 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:19,622 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:19,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:35:19,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:35:19,781 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 23:35:19,781 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91791460] [2019-11-15 23:35:19,781 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:35:19,782 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 23:35:19,782 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050406228] [2019-11-15 23:35:19,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 23:35:19,782 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:35:19,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:35:19,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:35:19,783 INFO L87 Difference]: Start difference. First operand 5161 states and 11249 transitions. Second operand 10 states. [2019-11-15 23:35:20,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:35:20,302 INFO L93 Difference]: Finished difference Result 16368 states and 36295 transitions. [2019-11-15 23:35:20,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-15 23:35:20,303 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-11-15 23:35:20,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:35:20,315 INFO L225 Difference]: With dead ends: 16368 [2019-11-15 23:35:20,316 INFO L226 Difference]: Without dead ends: 10730 [2019-11-15 23:35:20,316 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-11-15 23:35:20,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10730 states. [2019-11-15 23:35:20,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10730 to 5200. [2019-11-15 23:35:20,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5200 states. [2019-11-15 23:35:20,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5200 states to 5200 states and 11285 transitions. [2019-11-15 23:35:20,437 INFO L78 Accepts]: Start accepts. Automaton has 5200 states and 11285 transitions. Word has length 97 [2019-11-15 23:35:20,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:35:20,438 INFO L462 AbstractCegarLoop]: Abstraction has 5200 states and 11285 transitions. [2019-11-15 23:35:20,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 23:35:20,438 INFO L276 IsEmpty]: Start isEmpty. Operand 5200 states and 11285 transitions. [2019-11-15 23:35:20,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-15 23:35:20,445 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:35:20,445 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 23:35:20,445 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:35:20,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:35:20,446 INFO L82 PathProgramCache]: Analyzing trace with hash -307609594, now seen corresponding path program 2 times [2019-11-15 23:35:20,446 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:35:20,446 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255939721] [2019-11-15 23:35:20,446 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:20,447 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:35:20,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:35:20,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:35:20,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:35:20,559 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:35:20,560 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 23:35:20,733 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-15 23:35:20,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:35:20 BasicIcfg [2019-11-15 23:35:20,735 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:35:20,736 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:35:20,736 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:35:20,736 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:35:20,737 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:34:42" (3/4) ... [2019-11-15 23:35:20,739 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 23:35:20,865 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_8faf7fe7-af5a-4df0-b1af-48322a9d2800/bin/uautomizer/witness.graphml [2019-11-15 23:35:20,866 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:35:20,867 INFO L168 Benchmark]: Toolchain (without parser) took 39494.36 ms. Allocated memory was 1.0 GB in the beginning and 4.7 GB in the end (delta: 3.7 GB). Free memory was 939.4 MB in the beginning and 1.4 GB in the end (delta: -464.8 MB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. [2019-11-15 23:35:20,868 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:35:20,868 INFO L168 Benchmark]: CACSL2BoogieTranslator took 672.04 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -135.7 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:35:20,869 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.40 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:35:20,869 INFO L168 Benchmark]: Boogie Preprocessor took 31.91 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:35:20,869 INFO L168 Benchmark]: RCFGBuilder took 692.33 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. [2019-11-15 23:35:20,869 INFO L168 Benchmark]: TraceAbstraction took 37907.59 ms. Allocated memory was 1.1 GB in the beginning and 4.7 GB in the end (delta: 3.6 GB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -457.2 MB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. [2019-11-15 23:35:20,870 INFO L168 Benchmark]: Witness Printer took 130.13 ms. Allocated memory is still 4.7 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 71.9 MB). Peak memory consumption was 71.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:35:20,871 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 672.04 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -135.7 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 55.40 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.91 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 692.33 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 37907.59 ms. Allocated memory was 1.1 GB in the beginning and 4.7 GB in the end (delta: 3.6 GB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -457.2 MB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. * Witness Printer took 130.13 ms. Allocated memory is still 4.7 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 71.9 MB). Peak memory consumption was 71.9 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_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L700] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L701] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L702] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L704] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L706] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L708] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L709] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L710] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L711] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L712] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L713] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L714] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0] [L715] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L716] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L717] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0] [L718] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L719] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L720] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L721] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L722] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L723] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L724] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L803] 0 pthread_t t909; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L804] FCALL, FORK 0 pthread_create(&t909, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L805] 0 pthread_t t910; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L728] 1 z$w_buff1 = z$w_buff0 [L729] 1 z$w_buff0 = 1 [L730] 1 z$w_buff1_used = z$w_buff0_used [L731] 1 z$w_buff0_used = (_Bool)1 [L806] FCALL, FORK 0 pthread_create(&t910, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L733] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L734] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L735] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L736] 1 z$r_buff0_thd1 = (_Bool)1 [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 2 x = 1 [L759] 2 y = 1 [L762] 2 __unbuffered_p1_EAX = y [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 z$flush_delayed = weak$$choice2 [L768] 2 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L743] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L743] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L744] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L745] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L745] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L770] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L771] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L772] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L773] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L775] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L777] EXPR 2 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 z = z$flush_delayed ? z$mem_tmp : z [L778] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L781] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L781] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L782] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L782] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L783] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L783] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L784] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L784] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L785] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L785] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L788] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L808] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L812] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L812] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L812] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L812] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L813] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L813] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L814] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L814] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L815] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L815] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L816] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L816] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L819] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 220 locations, 3 error locations. Result: UNSAFE, OverallTime: 37.7s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 13.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7474 SDtfs, 8640 SDslu, 16431 SDs, 0 SdLazy, 6237 SolverSat, 400 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 254 GetRequests, 70 SyntacticMatches, 18 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71013occurred 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: 18.8s AutomataMinimizationTime, 26 MinimizatonAttempts, 80380 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1861 NumberOfCodeBlocks, 1861 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1738 ConstructedInterpolants, 0 QuantifiedInterpolants, 292488 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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...