./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/podwr000_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_64136e03-9c65-4dd5-9dae-c7a42dca2f33/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_64136e03-9c65-4dd5-9dae-c7a42dca2f33/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_64136e03-9c65-4dd5-9dae-c7a42dca2f33/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_64136e03-9c65-4dd5-9dae-c7a42dca2f33/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/podwr000_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_64136e03-9c65-4dd5-9dae-c7a42dca2f33/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_64136e03-9c65-4dd5-9dae-c7a42dca2f33/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 71874428e67d87ba9df016e59e2bc80f9d4a611c ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 20:07:31,589 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:07:31,590 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:07:31,600 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:07:31,600 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:07:31,601 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:07:31,603 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:07:31,604 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:07:31,606 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:07:31,607 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:07:31,608 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:07:31,609 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:07:31,609 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:07:31,610 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:07:31,611 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:07:31,612 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:07:31,613 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:07:31,613 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:07:31,615 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:07:31,617 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:07:31,619 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:07:31,620 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:07:31,621 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:07:31,622 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:07:31,625 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:07:31,625 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:07:31,625 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:07:31,626 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:07:31,627 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:07:31,628 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:07:31,628 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:07:31,629 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:07:31,630 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:07:31,630 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:07:31,632 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:07:31,632 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:07:31,633 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:07:31,633 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:07:31,633 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:07:31,634 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:07:31,635 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:07:31,636 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_64136e03-9c65-4dd5-9dae-c7a42dca2f33/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 20:07:31,649 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:07:31,650 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:07:31,651 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:07:31,651 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:07:31,651 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:07:31,652 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:07:31,652 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:07:31,652 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:07:31,652 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:07:31,653 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:07:31,653 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 20:07:31,653 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 20:07:31,653 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 20:07:31,653 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:07:31,654 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:07:31,654 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:07:31,654 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 20:07:31,654 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:07:31,655 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:07:31,655 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 20:07:31,655 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 20:07:31,655 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:07:31,655 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:07:31,656 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 20:07:31,656 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 20:07:31,656 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:07:31,656 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 20:07:31,657 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 20:07:31,657 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_64136e03-9c65-4dd5-9dae-c7a42dca2f33/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 -> 71874428e67d87ba9df016e59e2bc80f9d4a611c [2019-11-15 20:07:31,682 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:07:31,692 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:07:31,695 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:07:31,696 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:07:31,697 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:07:31,698 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_64136e03-9c65-4dd5-9dae-c7a42dca2f33/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/podwr000_rmo.opt.i [2019-11-15 20:07:31,747 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_64136e03-9c65-4dd5-9dae-c7a42dca2f33/bin/uautomizer/data/a902fddd3/e07025c5da314492b8bf517c582e6245/FLAG58ea1d72b [2019-11-15 20:07:32,209 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:07:32,210 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_64136e03-9c65-4dd5-9dae-c7a42dca2f33/sv-benchmarks/c/pthread-wmm/podwr000_rmo.opt.i [2019-11-15 20:07:32,227 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_64136e03-9c65-4dd5-9dae-c7a42dca2f33/bin/uautomizer/data/a902fddd3/e07025c5da314492b8bf517c582e6245/FLAG58ea1d72b [2019-11-15 20:07:32,239 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_64136e03-9c65-4dd5-9dae-c7a42dca2f33/bin/uautomizer/data/a902fddd3/e07025c5da314492b8bf517c582e6245 [2019-11-15 20:07:32,241 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:07:32,243 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:07:32,244 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:07:32,244 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:07:32,247 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:07:32,247 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:07:32" (1/1) ... [2019-11-15 20:07:32,250 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31ec96e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:07:32, skipping insertion in model container [2019-11-15 20:07:32,250 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:07:32" (1/1) ... [2019-11-15 20:07:32,256 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:07:32,314 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:07:32,704 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:07:32,717 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:07:32,794 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:07:32,863 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:07:32,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:07:32 WrapperNode [2019-11-15 20:07:32,863 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:07:32,864 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:07:32,864 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:07:32,864 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:07:32,872 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:07:32" (1/1) ... [2019-11-15 20:07:32,889 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:07:32" (1/1) ... [2019-11-15 20:07:32,917 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:07:32,917 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:07:32,917 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:07:32,917 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:07:32,924 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:07:32" (1/1) ... [2019-11-15 20:07:32,924 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:07:32" (1/1) ... [2019-11-15 20:07:32,929 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:07:32" (1/1) ... [2019-11-15 20:07:32,929 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:07:32" (1/1) ... [2019-11-15 20:07:32,940 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:07:32" (1/1) ... [2019-11-15 20:07:32,945 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:07:32" (1/1) ... [2019-11-15 20:07:32,949 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:07:32" (1/1) ... [2019-11-15 20:07:32,953 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:07:32,954 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:07:32,965 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:07:32,965 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:07:32,966 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:07:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64136e03-9c65-4dd5-9dae-c7a42dca2f33/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:07:33,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 20:07:33,037 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-15 20:07:33,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 20:07:33,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 20:07:33,038 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-15 20:07:33,039 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-15 20:07:33,039 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-15 20:07:33,039 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-15 20:07:33,039 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-15 20:07:33,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:07:33,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:07:33,043 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-15 20:07:33,773 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:07:33,773 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 20:07:33,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:07:33 BoogieIcfgContainer [2019-11-15 20:07:33,774 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:07:33,775 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 20:07:33,775 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 20:07:33,778 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 20:07:33,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 08:07:32" (1/3) ... [2019-11-15 20:07:33,779 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@118c8a8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:07:33, skipping insertion in model container [2019-11-15 20:07:33,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:07:32" (2/3) ... [2019-11-15 20:07:33,780 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@118c8a8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:07:33, skipping insertion in model container [2019-11-15 20:07:33,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:07:33" (3/3) ... [2019-11-15 20:07:33,781 INFO L109 eAbstractionObserver]: Analyzing ICFG podwr000_rmo.opt.i [2019-11-15 20:07:33,819 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,819 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,819 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,820 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,820 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,820 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,820 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,820 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,821 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,821 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,821 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,821 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,821 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,822 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,822 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,822 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,822 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,823 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,823 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,823 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,823 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,823 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,824 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,824 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,824 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,824 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,824 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,824 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,825 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,825 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,825 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,825 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,825 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,826 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,827 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,827 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,827 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,827 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,827 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,827 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,827 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,828 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,828 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,828 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,828 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,828 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,829 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,829 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,829 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,829 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,829 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,829 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,830 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,830 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,830 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,830 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,830 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,831 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,831 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,831 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,831 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,831 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,831 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,832 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,832 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,832 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,832 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,832 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,833 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,833 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,833 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,833 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,833 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,834 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,834 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,834 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,834 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,834 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,835 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,835 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,835 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,835 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,835 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,835 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,836 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,836 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,836 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,836 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,836 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,836 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,837 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,837 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,837 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,837 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,837 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,837 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,838 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,838 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,838 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,838 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,838 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,839 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,839 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,839 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,839 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,839 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,839 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,840 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,840 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,840 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,840 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,840 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,840 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,841 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,841 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,841 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,841 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,842 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,842 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,842 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,842 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,842 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,842 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,843 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,843 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,843 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,843 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,843 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,843 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,844 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,844 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,844 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,844 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,844 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,845 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,845 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,845 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,845 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,845 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,845 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,846 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,846 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,846 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,846 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,846 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,847 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,847 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,847 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,847 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,847 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,847 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,848 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 20:07:33,861 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-15 20:07:33,862 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 20:07:33,870 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-15 20:07:33,879 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-15 20:07:33,896 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 20:07:33,896 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 20:07:33,896 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 20:07:33,896 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:07:33,897 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:07:33,897 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 20:07:33,897 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:07:33,897 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 20:07:33,908 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 140 places, 178 transitions [2019-11-15 20:07:36,091 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32590 states. [2019-11-15 20:07:36,093 INFO L276 IsEmpty]: Start isEmpty. Operand 32590 states. [2019-11-15 20:07:36,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-15 20:07:36,099 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:07:36,100 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:07:36,102 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:07:36,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:07:36,107 INFO L82 PathProgramCache]: Analyzing trace with hash -254800073, now seen corresponding path program 1 times [2019-11-15 20:07:36,114 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:07:36,115 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280456147] [2019-11-15 20:07:36,115 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:36,115 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:36,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:07:36,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:07:36,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:07:36,396 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280456147] [2019-11-15 20:07:36,397 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:07:36,397 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:07:36,397 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083725248] [2019-11-15 20:07:36,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:07:36,401 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:07:36,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:07:36,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:07:36,415 INFO L87 Difference]: Start difference. First operand 32590 states. Second operand 4 states. [2019-11-15 20:07:37,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:07:37,287 INFO L93 Difference]: Finished difference Result 33590 states and 129567 transitions. [2019-11-15 20:07:37,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:07:37,289 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-11-15 20:07:37,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:07:37,552 INFO L225 Difference]: With dead ends: 33590 [2019-11-15 20:07:37,552 INFO L226 Difference]: Without dead ends: 25702 [2019-11-15 20:07:37,553 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:07:37,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25702 states. [2019-11-15 20:07:38,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25702 to 25702. [2019-11-15 20:07:38,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25702 states. [2019-11-15 20:07:38,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25702 states to 25702 states and 99583 transitions. [2019-11-15 20:07:38,948 INFO L78 Accepts]: Start accepts. Automaton has 25702 states and 99583 transitions. Word has length 33 [2019-11-15 20:07:38,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:07:38,951 INFO L462 AbstractCegarLoop]: Abstraction has 25702 states and 99583 transitions. [2019-11-15 20:07:38,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:07:38,951 INFO L276 IsEmpty]: Start isEmpty. Operand 25702 states and 99583 transitions. [2019-11-15 20:07:38,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 20:07:38,968 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:07:38,968 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] [2019-11-15 20:07:38,968 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:07:38,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:07:38,969 INFO L82 PathProgramCache]: Analyzing trace with hash -250081261, now seen corresponding path program 1 times [2019-11-15 20:07:38,969 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:07:38,969 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561137229] [2019-11-15 20:07:38,970 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:38,970 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:38,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:07:39,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:07:39,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:07:39,127 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561137229] [2019-11-15 20:07:39,127 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:07:39,128 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:07:39,128 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723101151] [2019-11-15 20:07:39,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:07:39,129 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:07:39,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:07:39,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:07:39,130 INFO L87 Difference]: Start difference. First operand 25702 states and 99583 transitions. Second operand 5 states. [2019-11-15 20:07:40,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:07:40,121 INFO L93 Difference]: Finished difference Result 41080 states and 150430 transitions. [2019-11-15 20:07:40,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:07:40,122 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-15 20:07:40,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:07:40,282 INFO L225 Difference]: With dead ends: 41080 [2019-11-15 20:07:40,283 INFO L226 Difference]: Without dead ends: 40544 [2019-11-15 20:07:40,284 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:07:40,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40544 states. [2019-11-15 20:07:41,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40544 to 38924. [2019-11-15 20:07:41,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38924 states. [2019-11-15 20:07:41,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38924 states to 38924 states and 143580 transitions. [2019-11-15 20:07:41,826 INFO L78 Accepts]: Start accepts. Automaton has 38924 states and 143580 transitions. Word has length 45 [2019-11-15 20:07:41,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:07:41,835 INFO L462 AbstractCegarLoop]: Abstraction has 38924 states and 143580 transitions. [2019-11-15 20:07:41,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:07:41,835 INFO L276 IsEmpty]: Start isEmpty. Operand 38924 states and 143580 transitions. [2019-11-15 20:07:41,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-15 20:07:41,843 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:07:41,843 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:07:41,843 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:07:41,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:07:41,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1037182150, now seen corresponding path program 1 times [2019-11-15 20:07:41,844 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:07:41,844 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639705035] [2019-11-15 20:07:41,845 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:41,845 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:41,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:07:41,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:07:41,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:07:41,966 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639705035] [2019-11-15 20:07:41,966 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:07:41,966 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:07:41,966 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592399450] [2019-11-15 20:07:41,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:07:41,967 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:07:41,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:07:41,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:07:41,968 INFO L87 Difference]: Start difference. First operand 38924 states and 143580 transitions. Second operand 5 states. [2019-11-15 20:07:42,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:07:42,976 INFO L93 Difference]: Finished difference Result 49777 states and 180632 transitions. [2019-11-15 20:07:42,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:07:42,977 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-11-15 20:07:42,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:07:43,265 INFO L225 Difference]: With dead ends: 49777 [2019-11-15 20:07:43,265 INFO L226 Difference]: Without dead ends: 49273 [2019-11-15 20:07:43,266 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:07:43,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49273 states. [2019-11-15 20:07:44,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49273 to 42676. [2019-11-15 20:07:44,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42676 states. [2019-11-15 20:07:44,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42676 states to 42676 states and 156591 transitions. [2019-11-15 20:07:44,457 INFO L78 Accepts]: Start accepts. Automaton has 42676 states and 156591 transitions. Word has length 46 [2019-11-15 20:07:44,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:07:44,458 INFO L462 AbstractCegarLoop]: Abstraction has 42676 states and 156591 transitions. [2019-11-15 20:07:44,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:07:44,458 INFO L276 IsEmpty]: Start isEmpty. Operand 42676 states and 156591 transitions. [2019-11-15 20:07:44,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-15 20:07:44,466 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:07:44,466 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 20:07:44,467 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:07:44,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:07:44,467 INFO L82 PathProgramCache]: Analyzing trace with hash 671596896, now seen corresponding path program 1 times [2019-11-15 20:07:44,467 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:07:44,467 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856950054] [2019-11-15 20:07:44,468 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:44,468 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:44,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:07:44,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:07:44,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:07:44,506 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856950054] [2019-11-15 20:07:44,507 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:07:44,507 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:07:44,507 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480564299] [2019-11-15 20:07:44,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:07:44,508 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:07:44,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:07:44,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:07:44,508 INFO L87 Difference]: Start difference. First operand 42676 states and 156591 transitions. Second operand 3 states. [2019-11-15 20:07:45,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:07:45,310 INFO L93 Difference]: Finished difference Result 61086 states and 221429 transitions. [2019-11-15 20:07:45,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:07:45,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-11-15 20:07:45,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:07:45,459 INFO L225 Difference]: With dead ends: 61086 [2019-11-15 20:07:45,460 INFO L226 Difference]: Without dead ends: 61086 [2019-11-15 20:07:45,460 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:07:45,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61086 states. [2019-11-15 20:07:46,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61086 to 48015. [2019-11-15 20:07:46,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48015 states. [2019-11-15 20:07:46,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48015 states to 48015 states and 174178 transitions. [2019-11-15 20:07:46,494 INFO L78 Accepts]: Start accepts. Automaton has 48015 states and 174178 transitions. Word has length 48 [2019-11-15 20:07:46,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:07:46,494 INFO L462 AbstractCegarLoop]: Abstraction has 48015 states and 174178 transitions. [2019-11-15 20:07:46,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:07:46,494 INFO L276 IsEmpty]: Start isEmpty. Operand 48015 states and 174178 transitions. [2019-11-15 20:07:46,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 20:07:46,509 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:07:46,509 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:07:46,509 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:07:46,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:07:46,510 INFO L82 PathProgramCache]: Analyzing trace with hash -934557998, now seen corresponding path program 1 times [2019-11-15 20:07:46,510 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:07:46,510 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929263749] [2019-11-15 20:07:46,510 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:46,511 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:46,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:07:46,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:07:46,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:07:46,625 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929263749] [2019-11-15 20:07:46,625 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:07:46,626 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:07:46,626 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209086534] [2019-11-15 20:07:46,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:07:46,626 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:07:46,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:07:46,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:07:46,627 INFO L87 Difference]: Start difference. First operand 48015 states and 174178 transitions. Second operand 6 states. [2019-11-15 20:07:47,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:07:47,885 INFO L93 Difference]: Finished difference Result 63755 states and 229378 transitions. [2019-11-15 20:07:47,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:07:47,886 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-11-15 20:07:47,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:07:48,048 INFO L225 Difference]: With dead ends: 63755 [2019-11-15 20:07:48,048 INFO L226 Difference]: Without dead ends: 63755 [2019-11-15 20:07:48,049 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:07:48,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63755 states. [2019-11-15 20:07:49,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63755 to 59948. [2019-11-15 20:07:49,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59948 states. [2019-11-15 20:07:49,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59948 states to 59948 states and 215671 transitions. [2019-11-15 20:07:49,202 INFO L78 Accepts]: Start accepts. Automaton has 59948 states and 215671 transitions. Word has length 52 [2019-11-15 20:07:49,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:07:49,203 INFO L462 AbstractCegarLoop]: Abstraction has 59948 states and 215671 transitions. [2019-11-15 20:07:49,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:07:49,203 INFO L276 IsEmpty]: Start isEmpty. Operand 59948 states and 215671 transitions. [2019-11-15 20:07:49,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 20:07:49,219 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:07:49,219 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:07:49,220 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:07:49,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:07:49,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1563457939, now seen corresponding path program 1 times [2019-11-15 20:07:49,220 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:07:49,221 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769555135] [2019-11-15 20:07:49,221 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:49,221 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:49,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:07:49,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:07:49,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:07:49,352 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769555135] [2019-11-15 20:07:49,352 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:07:49,352 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 20:07:49,352 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537232133] [2019-11-15 20:07:49,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:07:49,353 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:07:49,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:07:49,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:07:49,353 INFO L87 Difference]: Start difference. First operand 59948 states and 215671 transitions. Second operand 7 states. [2019-11-15 20:07:51,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:07:51,169 INFO L93 Difference]: Finished difference Result 83684 states and 290096 transitions. [2019-11-15 20:07:51,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 20:07:51,170 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-11-15 20:07:51,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:07:51,355 INFO L225 Difference]: With dead ends: 83684 [2019-11-15 20:07:51,356 INFO L226 Difference]: Without dead ends: 83684 [2019-11-15 20:07:51,356 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:07:51,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83684 states. [2019-11-15 20:07:52,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83684 to 71011. [2019-11-15 20:07:52,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71011 states. [2019-11-15 20:07:52,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71011 states to 71011 states and 249885 transitions. [2019-11-15 20:07:52,811 INFO L78 Accepts]: Start accepts. Automaton has 71011 states and 249885 transitions. Word has length 52 [2019-11-15 20:07:52,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:07:52,812 INFO L462 AbstractCegarLoop]: Abstraction has 71011 states and 249885 transitions. [2019-11-15 20:07:52,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:07:52,812 INFO L276 IsEmpty]: Start isEmpty. Operand 71011 states and 249885 transitions. [2019-11-15 20:07:52,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 20:07:52,829 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:07:52,829 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:07:52,830 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:07:52,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:07:52,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1844005676, now seen corresponding path program 1 times [2019-11-15 20:07:52,830 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:07:52,830 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84914449] [2019-11-15 20:07:52,831 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:52,831 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:52,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:07:52,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:07:52,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:07:52,888 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84914449] [2019-11-15 20:07:52,888 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:07:52,888 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:07:52,888 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866209217] [2019-11-15 20:07:52,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:07:52,889 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:07:52,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:07:52,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:07:52,889 INFO L87 Difference]: Start difference. First operand 71011 states and 249885 transitions. Second operand 3 states. [2019-11-15 20:07:53,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:07:53,131 INFO L93 Difference]: Finished difference Result 54020 states and 188917 transitions. [2019-11-15 20:07:53,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:07:53,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-15 20:07:53,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:07:53,235 INFO L225 Difference]: With dead ends: 54020 [2019-11-15 20:07:53,235 INFO L226 Difference]: Without dead ends: 54020 [2019-11-15 20:07:53,236 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:07:53,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54020 states. [2019-11-15 20:07:54,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54020 to 53405. [2019-11-15 20:07:54,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53405 states. [2019-11-15 20:07:54,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53405 states to 53405 states and 187036 transitions. [2019-11-15 20:07:54,586 INFO L78 Accepts]: Start accepts. Automaton has 53405 states and 187036 transitions. Word has length 52 [2019-11-15 20:07:54,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:07:54,586 INFO L462 AbstractCegarLoop]: Abstraction has 53405 states and 187036 transitions. [2019-11-15 20:07:54,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:07:54,587 INFO L276 IsEmpty]: Start isEmpty. Operand 53405 states and 187036 transitions. [2019-11-15 20:07:54,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 20:07:54,595 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:07:54,595 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:07:54,595 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:07:54,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:07:54,595 INFO L82 PathProgramCache]: Analyzing trace with hash -456832597, now seen corresponding path program 1 times [2019-11-15 20:07:54,595 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:07:54,595 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172200407] [2019-11-15 20:07:54,596 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:54,596 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:54,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:07:54,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:07:54,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:07:54,657 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172200407] [2019-11-15 20:07:54,657 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:07:54,657 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:07:54,657 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761998903] [2019-11-15 20:07:54,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:07:54,658 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:07:54,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:07:54,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:07:54,658 INFO L87 Difference]: Start difference. First operand 53405 states and 187036 transitions. Second operand 6 states. [2019-11-15 20:07:55,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:07:55,334 INFO L93 Difference]: Finished difference Result 68645 states and 237300 transitions. [2019-11-15 20:07:55,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 20:07:55,334 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-11-15 20:07:55,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:07:55,458 INFO L225 Difference]: With dead ends: 68645 [2019-11-15 20:07:55,459 INFO L226 Difference]: Without dead ends: 68077 [2019-11-15 20:07:55,459 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 20:07:55,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68077 states. [2019-11-15 20:07:56,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68077 to 53489. [2019-11-15 20:07:56,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53489 states. [2019-11-15 20:07:56,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53489 states to 53489 states and 187733 transitions. [2019-11-15 20:07:56,513 INFO L78 Accepts]: Start accepts. Automaton has 53489 states and 187733 transitions. Word has length 52 [2019-11-15 20:07:56,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:07:56,514 INFO L462 AbstractCegarLoop]: Abstraction has 53489 states and 187733 transitions. [2019-11-15 20:07:56,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:07:56,514 INFO L276 IsEmpty]: Start isEmpty. Operand 53489 states and 187733 transitions. [2019-11-15 20:07:56,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 20:07:56,523 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:07:56,523 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:07:56,524 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:07:56,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:07:56,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1423918431, now seen corresponding path program 1 times [2019-11-15 20:07:56,524 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:07:56,524 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234596667] [2019-11-15 20:07:56,524 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:56,524 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:56,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:07:56,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:07:56,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:07:56,603 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234596667] [2019-11-15 20:07:56,604 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:07:56,604 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:07:56,605 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682543602] [2019-11-15 20:07:56,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:07:56,606 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:07:56,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:07:56,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:07:56,607 INFO L87 Difference]: Start difference. First operand 53489 states and 187733 transitions. Second operand 6 states. [2019-11-15 20:07:57,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:07:57,659 INFO L93 Difference]: Finished difference Result 96424 states and 331752 transitions. [2019-11-15 20:07:57,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:07:57,660 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-11-15 20:07:57,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:07:57,838 INFO L225 Difference]: With dead ends: 96424 [2019-11-15 20:07:57,838 INFO L226 Difference]: Without dead ends: 96424 [2019-11-15 20:07:57,839 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:07:58,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96424 states. [2019-11-15 20:07:59,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96424 to 70773. [2019-11-15 20:07:59,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70773 states. [2019-11-15 20:07:59,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70773 states to 70773 states and 244809 transitions. [2019-11-15 20:07:59,241 INFO L78 Accepts]: Start accepts. Automaton has 70773 states and 244809 transitions. Word has length 53 [2019-11-15 20:07:59,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:07:59,242 INFO L462 AbstractCegarLoop]: Abstraction has 70773 states and 244809 transitions. [2019-11-15 20:07:59,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:07:59,242 INFO L276 IsEmpty]: Start isEmpty. Operand 70773 states and 244809 transitions. [2019-11-15 20:07:59,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 20:07:59,254 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:07:59,254 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:07:59,254 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:07:59,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:07:59,254 INFO L82 PathProgramCache]: Analyzing trace with hash -536414750, now seen corresponding path program 1 times [2019-11-15 20:07:59,254 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:07:59,254 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306337624] [2019-11-15 20:07:59,254 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:59,255 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:59,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:07:59,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:07:59,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:07:59,319 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306337624] [2019-11-15 20:07:59,319 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:07:59,319 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:07:59,319 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457455292] [2019-11-15 20:07:59,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:07:59,320 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:07:59,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:07:59,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:07:59,320 INFO L87 Difference]: Start difference. First operand 70773 states and 244809 transitions. Second operand 4 states. [2019-11-15 20:07:59,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:07:59,391 INFO L93 Difference]: Finished difference Result 12386 states and 37621 transitions. [2019-11-15 20:07:59,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:07:59,391 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-11-15 20:07:59,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:07:59,430 INFO L225 Difference]: With dead ends: 12386 [2019-11-15 20:07:59,430 INFO L226 Difference]: Without dead ends: 10681 [2019-11-15 20:07:59,431 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:07:59,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10681 states. [2019-11-15 20:07:59,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10681 to 10633. [2019-11-15 20:07:59,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10633 states. [2019-11-15 20:07:59,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10633 states to 10633 states and 31700 transitions. [2019-11-15 20:07:59,648 INFO L78 Accepts]: Start accepts. Automaton has 10633 states and 31700 transitions. Word has length 53 [2019-11-15 20:07:59,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:07:59,649 INFO L462 AbstractCegarLoop]: Abstraction has 10633 states and 31700 transitions. [2019-11-15 20:07:59,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:07:59,649 INFO L276 IsEmpty]: Start isEmpty. Operand 10633 states and 31700 transitions. [2019-11-15 20:07:59,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-15 20:07:59,652 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:07:59,653 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] [2019-11-15 20:07:59,653 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:07:59,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:07:59,653 INFO L82 PathProgramCache]: Analyzing trace with hash -257891193, now seen corresponding path program 1 times [2019-11-15 20:07:59,654 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:07:59,654 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112275727] [2019-11-15 20:07:59,654 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:59,654 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:07:59,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:07:59,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:07:59,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:07:59,726 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112275727] [2019-11-15 20:07:59,726 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:07:59,726 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:07:59,726 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721870321] [2019-11-15 20:07:59,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:07:59,727 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:07:59,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:07:59,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:07:59,727 INFO L87 Difference]: Start difference. First operand 10633 states and 31700 transitions. Second operand 4 states. [2019-11-15 20:07:59,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:07:59,850 INFO L93 Difference]: Finished difference Result 12165 states and 36338 transitions. [2019-11-15 20:07:59,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:07:59,850 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-11-15 20:07:59,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:07:59,869 INFO L225 Difference]: With dead ends: 12165 [2019-11-15 20:07:59,869 INFO L226 Difference]: Without dead ends: 12165 [2019-11-15 20:07:59,869 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:07:59,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12165 states. [2019-11-15 20:08:00,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12165 to 10963. [2019-11-15 20:08:00,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10963 states. [2019-11-15 20:08:00,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10963 states to 10963 states and 32702 transitions. [2019-11-15 20:08:00,039 INFO L78 Accepts]: Start accepts. Automaton has 10963 states and 32702 transitions. Word has length 60 [2019-11-15 20:08:00,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:08:00,039 INFO L462 AbstractCegarLoop]: Abstraction has 10963 states and 32702 transitions. [2019-11-15 20:08:00,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:08:00,039 INFO L276 IsEmpty]: Start isEmpty. Operand 10963 states and 32702 transitions. [2019-11-15 20:08:00,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-15 20:08:00,042 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:08:00,042 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] [2019-11-15 20:08:00,042 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:08:00,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:08:00,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1484919142, now seen corresponding path program 1 times [2019-11-15 20:08:00,043 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:08:00,043 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831723793] [2019-11-15 20:08:00,043 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:08:00,043 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:08:00,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:08:00,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:08:00,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:08:00,113 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831723793] [2019-11-15 20:08:00,113 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:08:00,113 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:08:00,113 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294350754] [2019-11-15 20:08:00,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:08:00,114 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:08:00,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:08:00,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:08:00,114 INFO L87 Difference]: Start difference. First operand 10963 states and 32702 transitions. Second operand 6 states. [2019-11-15 20:08:00,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:08:00,508 INFO L93 Difference]: Finished difference Result 13789 states and 40570 transitions. [2019-11-15 20:08:00,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 20:08:00,509 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-11-15 20:08:00,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:08:00,525 INFO L225 Difference]: With dead ends: 13789 [2019-11-15 20:08:00,525 INFO L226 Difference]: Without dead ends: 13728 [2019-11-15 20:08:00,525 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-15 20:08:00,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13728 states. [2019-11-15 20:08:00,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13728 to 12854. [2019-11-15 20:08:00,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12854 states. [2019-11-15 20:08:00,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12854 states to 12854 states and 38040 transitions. [2019-11-15 20:08:00,689 INFO L78 Accepts]: Start accepts. Automaton has 12854 states and 38040 transitions. Word has length 60 [2019-11-15 20:08:00,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:08:00,689 INFO L462 AbstractCegarLoop]: Abstraction has 12854 states and 38040 transitions. [2019-11-15 20:08:00,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:08:00,689 INFO L276 IsEmpty]: Start isEmpty. Operand 12854 states and 38040 transitions. [2019-11-15 20:08:00,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 20:08:00,694 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:08:00,694 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] [2019-11-15 20:08:00,695 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:08:00,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:08:00,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1235676948, now seen corresponding path program 1 times [2019-11-15 20:08:00,695 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:08:00,695 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109431070] [2019-11-15 20:08:00,695 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:08:00,696 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:08:00,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:08:00,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:08:00,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:08:00,762 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109431070] [2019-11-15 20:08:00,762 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:08:00,762 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:08:00,762 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472728967] [2019-11-15 20:08:00,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:08:00,763 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:08:00,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:08:00,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:08:00,763 INFO L87 Difference]: Start difference. First operand 12854 states and 38040 transitions. Second operand 4 states. [2019-11-15 20:08:01,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:08:01,183 INFO L93 Difference]: Finished difference Result 15947 states and 46763 transitions. [2019-11-15 20:08:01,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:08:01,184 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-15 20:08:01,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:08:01,203 INFO L225 Difference]: With dead ends: 15947 [2019-11-15 20:08:01,204 INFO L226 Difference]: Without dead ends: 15947 [2019-11-15 20:08:01,204 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:08:01,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15947 states. [2019-11-15 20:08:01,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15947 to 14216. [2019-11-15 20:08:01,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14216 states. [2019-11-15 20:08:01,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14216 states to 14216 states and 41815 transitions. [2019-11-15 20:08:01,399 INFO L78 Accepts]: Start accepts. Automaton has 14216 states and 41815 transitions. Word has length 66 [2019-11-15 20:08:01,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:08:01,399 INFO L462 AbstractCegarLoop]: Abstraction has 14216 states and 41815 transitions. [2019-11-15 20:08:01,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:08:01,399 INFO L276 IsEmpty]: Start isEmpty. Operand 14216 states and 41815 transitions. [2019-11-15 20:08:01,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 20:08:01,406 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:08:01,406 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] [2019-11-15 20:08:01,406 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:08:01,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:08:01,406 INFO L82 PathProgramCache]: Analyzing trace with hash 982081005, now seen corresponding path program 1 times [2019-11-15 20:08:01,407 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:08:01,407 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116886979] [2019-11-15 20:08:01,407 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:08:01,407 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:08:01,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:08:01,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:08:01,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:08:01,524 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116886979] [2019-11-15 20:08:01,524 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:08:01,524 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:08:01,524 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135408623] [2019-11-15 20:08:01,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:08:01,525 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:08:01,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:08:01,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:08:01,525 INFO L87 Difference]: Start difference. First operand 14216 states and 41815 transitions. Second operand 6 states. [2019-11-15 20:08:02,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:08:02,042 INFO L93 Difference]: Finished difference Result 15413 states and 44700 transitions. [2019-11-15 20:08:02,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:08:02,043 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-11-15 20:08:02,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:08:02,060 INFO L225 Difference]: With dead ends: 15413 [2019-11-15 20:08:02,061 INFO L226 Difference]: Without dead ends: 15413 [2019-11-15 20:08:02,061 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:08:02,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15413 states. [2019-11-15 20:08:02,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15413 to 15089. [2019-11-15 20:08:02,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15089 states. [2019-11-15 20:08:02,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15089 states to 15089 states and 43878 transitions. [2019-11-15 20:08:02,242 INFO L78 Accepts]: Start accepts. Automaton has 15089 states and 43878 transitions. Word has length 66 [2019-11-15 20:08:02,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:08:02,243 INFO L462 AbstractCegarLoop]: Abstraction has 15089 states and 43878 transitions. [2019-11-15 20:08:02,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:08:02,243 INFO L276 IsEmpty]: Start isEmpty. Operand 15089 states and 43878 transitions. [2019-11-15 20:08:02,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 20:08:02,251 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:08:02,252 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] [2019-11-15 20:08:02,252 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:08:02,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:08:02,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1943695022, now seen corresponding path program 1 times [2019-11-15 20:08:02,252 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:08:02,252 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781100086] [2019-11-15 20:08:02,252 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:08:02,252 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:08:02,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:08:02,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:08:02,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:08:02,329 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781100086] [2019-11-15 20:08:02,330 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:08:02,330 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:08:02,330 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642376876] [2019-11-15 20:08:02,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:08:02,331 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:08:02,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:08:02,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:08:02,331 INFO L87 Difference]: Start difference. First operand 15089 states and 43878 transitions. Second operand 6 states. [2019-11-15 20:08:02,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:08:02,766 INFO L93 Difference]: Finished difference Result 17155 states and 48592 transitions. [2019-11-15 20:08:02,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 20:08:02,767 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-11-15 20:08:02,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:08:02,785 INFO L225 Difference]: With dead ends: 17155 [2019-11-15 20:08:02,785 INFO L226 Difference]: Without dead ends: 17155 [2019-11-15 20:08:02,785 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-15 20:08:02,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17155 states. [2019-11-15 20:08:02,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17155 to 15619. [2019-11-15 20:08:02,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15619 states. [2019-11-15 20:08:02,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15619 states to 15619 states and 44726 transitions. [2019-11-15 20:08:02,988 INFO L78 Accepts]: Start accepts. Automaton has 15619 states and 44726 transitions. Word has length 66 [2019-11-15 20:08:02,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:08:02,989 INFO L462 AbstractCegarLoop]: Abstraction has 15619 states and 44726 transitions. [2019-11-15 20:08:02,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:08:02,989 INFO L276 IsEmpty]: Start isEmpty. Operand 15619 states and 44726 transitions. [2019-11-15 20:08:03,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 20:08:03,000 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:08:03,000 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] [2019-11-15 20:08:03,000 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:08:03,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:08:03,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1106507793, now seen corresponding path program 1 times [2019-11-15 20:08:03,001 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:08:03,001 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579583597] [2019-11-15 20:08:03,001 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:08:03,001 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:08:03,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:08:03,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:08:03,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:08:03,069 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579583597] [2019-11-15 20:08:03,070 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:08:03,070 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:08:03,070 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140258232] [2019-11-15 20:08:03,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:08:03,070 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:08:03,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:08:03,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:08:03,071 INFO L87 Difference]: Start difference. First operand 15619 states and 44726 transitions. Second operand 5 states. [2019-11-15 20:08:03,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:08:03,503 INFO L93 Difference]: Finished difference Result 19634 states and 55999 transitions. [2019-11-15 20:08:03,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:08:03,504 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-11-15 20:08:03,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:08:03,527 INFO L225 Difference]: With dead ends: 19634 [2019-11-15 20:08:03,527 INFO L226 Difference]: Without dead ends: 19634 [2019-11-15 20:08:03,527 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 20:08:03,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19634 states. [2019-11-15 20:08:03,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19634 to 18191. [2019-11-15 20:08:03,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18191 states. [2019-11-15 20:08:03,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18191 states to 18191 states and 51753 transitions. [2019-11-15 20:08:03,763 INFO L78 Accepts]: Start accepts. Automaton has 18191 states and 51753 transitions. Word has length 66 [2019-11-15 20:08:03,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:08:03,764 INFO L462 AbstractCegarLoop]: Abstraction has 18191 states and 51753 transitions. [2019-11-15 20:08:03,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:08:03,764 INFO L276 IsEmpty]: Start isEmpty. Operand 18191 states and 51753 transitions. [2019-11-15 20:08:03,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 20:08:03,771 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:08:03,771 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:08:03,772 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:08:03,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:08:03,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1617041970, now seen corresponding path program 1 times [2019-11-15 20:08:03,772 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:08:03,772 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521112692] [2019-11-15 20:08:03,772 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:08:03,772 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:08:03,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:08:03,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:08:03,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:08:03,827 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521112692] [2019-11-15 20:08:03,827 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:08:03,827 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:08:03,828 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941012477] [2019-11-15 20:08:03,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:08:03,828 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:08:03,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:08:03,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:08:03,829 INFO L87 Difference]: Start difference. First operand 18191 states and 51753 transitions. Second operand 4 states. [2019-11-15 20:08:04,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:08:04,288 INFO L93 Difference]: Finished difference Result 21605 states and 61304 transitions. [2019-11-15 20:08:04,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:08:04,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-15 20:08:04,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:08:04,314 INFO L225 Difference]: With dead ends: 21605 [2019-11-15 20:08:04,315 INFO L226 Difference]: Without dead ends: 21383 [2019-11-15 20:08:04,315 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:08:04,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21383 states. [2019-11-15 20:08:04,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21383 to 20513. [2019-11-15 20:08:04,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20513 states. [2019-11-15 20:08:04,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20513 states to 20513 states and 58140 transitions. [2019-11-15 20:08:04,585 INFO L78 Accepts]: Start accepts. Automaton has 20513 states and 58140 transitions. Word has length 66 [2019-11-15 20:08:04,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:08:04,585 INFO L462 AbstractCegarLoop]: Abstraction has 20513 states and 58140 transitions. [2019-11-15 20:08:04,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:08:04,585 INFO L276 IsEmpty]: Start isEmpty. Operand 20513 states and 58140 transitions. [2019-11-15 20:08:04,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 20:08:04,591 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:08:04,591 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] [2019-11-15 20:08:04,592 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:08:04,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:08:04,592 INFO L82 PathProgramCache]: Analyzing trace with hash -6529714, now seen corresponding path program 1 times [2019-11-15 20:08:04,592 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:08:04,592 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381153218] [2019-11-15 20:08:04,592 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:08:04,592 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:08:04,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:08:04,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:08:04,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:08:04,711 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381153218] [2019-11-15 20:08:04,712 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:08:04,712 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 20:08:04,712 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360904661] [2019-11-15 20:08:04,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 20:08:04,713 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:08:04,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 20:08:04,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-15 20:08:04,714 INFO L87 Difference]: Start difference. First operand 20513 states and 58140 transitions. Second operand 9 states. [2019-11-15 20:08:05,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:08:05,663 INFO L93 Difference]: Finished difference Result 27608 states and 77920 transitions. [2019-11-15 20:08:05,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 20:08:05,663 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-11-15 20:08:05,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:08:05,700 INFO L225 Difference]: With dead ends: 27608 [2019-11-15 20:08:05,700 INFO L226 Difference]: Without dead ends: 27608 [2019-11-15 20:08:05,700 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-11-15 20:08:05,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27608 states. [2019-11-15 20:08:05,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27608 to 23102. [2019-11-15 20:08:05,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23102 states. [2019-11-15 20:08:06,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23102 states to 23102 states and 65204 transitions. [2019-11-15 20:08:06,009 INFO L78 Accepts]: Start accepts. Automaton has 23102 states and 65204 transitions. Word has length 66 [2019-11-15 20:08:06,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:08:06,009 INFO L462 AbstractCegarLoop]: Abstraction has 23102 states and 65204 transitions. [2019-11-15 20:08:06,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 20:08:06,009 INFO L276 IsEmpty]: Start isEmpty. Operand 23102 states and 65204 transitions. [2019-11-15 20:08:06,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 20:08:06,016 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:08:06,016 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] [2019-11-15 20:08:06,017 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:08:06,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:08:06,017 INFO L82 PathProgramCache]: Analyzing trace with hash 880973967, now seen corresponding path program 1 times [2019-11-15 20:08:06,017 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:08:06,017 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845773453] [2019-11-15 20:08:06,017 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:08:06,017 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:08:06,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:08:06,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:08:06,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:08:06,092 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845773453] [2019-11-15 20:08:06,092 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:08:06,092 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:08:06,092 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330658778] [2019-11-15 20:08:06,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:08:06,094 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:08:06,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:08:06,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:08:06,094 INFO L87 Difference]: Start difference. First operand 23102 states and 65204 transitions. Second operand 5 states. [2019-11-15 20:08:06,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:08:06,157 INFO L93 Difference]: Finished difference Result 6392 states and 15091 transitions. [2019-11-15 20:08:06,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 20:08:06,158 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-11-15 20:08:06,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:08:06,164 INFO L225 Difference]: With dead ends: 6392 [2019-11-15 20:08:06,164 INFO L226 Difference]: Without dead ends: 5432 [2019-11-15 20:08:06,165 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:08:06,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5432 states. [2019-11-15 20:08:06,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5432 to 4684. [2019-11-15 20:08:06,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4684 states. [2019-11-15 20:08:06,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4684 states to 4684 states and 10759 transitions. [2019-11-15 20:08:06,236 INFO L78 Accepts]: Start accepts. Automaton has 4684 states and 10759 transitions. Word has length 66 [2019-11-15 20:08:06,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:08:06,237 INFO L462 AbstractCegarLoop]: Abstraction has 4684 states and 10759 transitions. [2019-11-15 20:08:06,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:08:06,237 INFO L276 IsEmpty]: Start isEmpty. Operand 4684 states and 10759 transitions. [2019-11-15 20:08:06,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 20:08:06,240 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:08:06,240 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] [2019-11-15 20:08:06,240 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:08:06,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:08:06,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1738873321, now seen corresponding path program 1 times [2019-11-15 20:08:06,241 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:08:06,241 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967894881] [2019-11-15 20:08:06,241 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:08:06,241 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:08:06,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:08:06,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:08:06,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:08:06,269 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967894881] [2019-11-15 20:08:06,269 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:08:06,269 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:08:06,269 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554418744] [2019-11-15 20:08:06,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:08:06,270 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:08:06,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:08:06,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:08:06,271 INFO L87 Difference]: Start difference. First operand 4684 states and 10759 transitions. Second operand 3 states. [2019-11-15 20:08:06,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:08:06,304 INFO L93 Difference]: Finished difference Result 5801 states and 13142 transitions. [2019-11-15 20:08:06,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:08:06,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-15 20:08:06,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:08:06,311 INFO L225 Difference]: With dead ends: 5801 [2019-11-15 20:08:06,311 INFO L226 Difference]: Without dead ends: 5801 [2019-11-15 20:08:06,312 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:08:06,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5801 states. [2019-11-15 20:08:06,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5801 to 4607. [2019-11-15 20:08:06,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4607 states. [2019-11-15 20:08:06,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4607 states to 4607 states and 10306 transitions. [2019-11-15 20:08:06,368 INFO L78 Accepts]: Start accepts. Automaton has 4607 states and 10306 transitions. Word has length 66 [2019-11-15 20:08:06,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:08:06,369 INFO L462 AbstractCegarLoop]: Abstraction has 4607 states and 10306 transitions. [2019-11-15 20:08:06,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:08:06,369 INFO L276 IsEmpty]: Start isEmpty. Operand 4607 states and 10306 transitions. [2019-11-15 20:08:06,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-15 20:08:06,372 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:08:06,372 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] [2019-11-15 20:08:06,372 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:08:06,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:08:06,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1014352042, now seen corresponding path program 1 times [2019-11-15 20:08:06,373 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:08:06,373 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028309699] [2019-11-15 20:08:06,373 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:08:06,374 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:08:06,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:08:06,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:08:06,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:08:06,424 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028309699] [2019-11-15 20:08:06,424 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:08:06,424 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:08:06,424 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052388913] [2019-11-15 20:08:06,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:08:06,425 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:08:06,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:08:06,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:08:06,425 INFO L87 Difference]: Start difference. First operand 4607 states and 10306 transitions. Second operand 5 states. [2019-11-15 20:08:06,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:08:06,608 INFO L93 Difference]: Finished difference Result 5678 states and 12754 transitions. [2019-11-15 20:08:06,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 20:08:06,608 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-11-15 20:08:06,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:08:06,612 INFO L225 Difference]: With dead ends: 5678 [2019-11-15 20:08:06,612 INFO L226 Difference]: Without dead ends: 5678 [2019-11-15 20:08:06,613 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-15 20:08:06,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5678 states. [2019-11-15 20:08:06,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5678 to 5027. [2019-11-15 20:08:06,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5027 states. [2019-11-15 20:08:06,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5027 states to 5027 states and 11264 transitions. [2019-11-15 20:08:06,663 INFO L78 Accepts]: Start accepts. Automaton has 5027 states and 11264 transitions. Word has length 72 [2019-11-15 20:08:06,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:08:06,663 INFO L462 AbstractCegarLoop]: Abstraction has 5027 states and 11264 transitions. [2019-11-15 20:08:06,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:08:06,664 INFO L276 IsEmpty]: Start isEmpty. Operand 5027 states and 11264 transitions. [2019-11-15 20:08:06,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-15 20:08:06,667 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:08:06,668 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] [2019-11-15 20:08:06,668 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:08:06,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:08:06,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1537804919, now seen corresponding path program 1 times [2019-11-15 20:08:06,669 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:08:06,669 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509946988] [2019-11-15 20:08:06,669 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:08:06,669 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:08:06,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:08:06,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:08:06,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:08:06,744 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509946988] [2019-11-15 20:08:06,744 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:08:06,744 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 20:08:06,744 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456013791] [2019-11-15 20:08:06,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:08:06,745 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:08:06,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:08:06,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:08:06,745 INFO L87 Difference]: Start difference. First operand 5027 states and 11264 transitions. Second operand 7 states. [2019-11-15 20:08:07,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:08:07,291 INFO L93 Difference]: Finished difference Result 5893 states and 13110 transitions. [2019-11-15 20:08:07,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 20:08:07,291 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2019-11-15 20:08:07,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:08:07,296 INFO L225 Difference]: With dead ends: 5893 [2019-11-15 20:08:07,296 INFO L226 Difference]: Without dead ends: 5840 [2019-11-15 20:08:07,297 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-11-15 20:08:07,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5840 states. [2019-11-15 20:08:07,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5840 to 5058. [2019-11-15 20:08:07,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5058 states. [2019-11-15 20:08:07,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5058 states to 5058 states and 11264 transitions. [2019-11-15 20:08:07,365 INFO L78 Accepts]: Start accepts. Automaton has 5058 states and 11264 transitions. Word has length 72 [2019-11-15 20:08:07,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:08:07,365 INFO L462 AbstractCegarLoop]: Abstraction has 5058 states and 11264 transitions. [2019-11-15 20:08:07,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:08:07,365 INFO L276 IsEmpty]: Start isEmpty. Operand 5058 states and 11264 transitions. [2019-11-15 20:08:07,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-15 20:08:07,370 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:08:07,371 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] [2019-11-15 20:08:07,371 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:08:07,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:08:07,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1799811038, now seen corresponding path program 1 times [2019-11-15 20:08:07,372 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:08:07,372 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255311147] [2019-11-15 20:08:07,372 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:08:07,372 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:08:07,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:08:07,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:08:07,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:08:07,438 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255311147] [2019-11-15 20:08:07,438 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:08:07,439 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:08:07,439 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66208823] [2019-11-15 20:08:07,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:08:07,439 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:08:07,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:08:07,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:08:07,440 INFO L87 Difference]: Start difference. First operand 5058 states and 11264 transitions. Second operand 4 states. [2019-11-15 20:08:07,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:08:07,569 INFO L93 Difference]: Finished difference Result 6057 states and 13398 transitions. [2019-11-15 20:08:07,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:08:07,570 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-11-15 20:08:07,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:08:07,576 INFO L225 Difference]: With dead ends: 6057 [2019-11-15 20:08:07,577 INFO L226 Difference]: Without dead ends: 6057 [2019-11-15 20:08:07,577 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:08:07,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6057 states. [2019-11-15 20:08:07,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6057 to 5344. [2019-11-15 20:08:07,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5344 states. [2019-11-15 20:08:07,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5344 states to 5344 states and 11888 transitions. [2019-11-15 20:08:07,642 INFO L78 Accepts]: Start accepts. Automaton has 5344 states and 11888 transitions. Word has length 93 [2019-11-15 20:08:07,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:08:07,642 INFO L462 AbstractCegarLoop]: Abstraction has 5344 states and 11888 transitions. [2019-11-15 20:08:07,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:08:07,642 INFO L276 IsEmpty]: Start isEmpty. Operand 5344 states and 11888 transitions. [2019-11-15 20:08:07,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 20:08:07,647 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:08:07,648 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 20:08:07,648 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:08:07,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:08:07,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1588217784, now seen corresponding path program 1 times [2019-11-15 20:08:07,648 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:08:07,649 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911159743] [2019-11-15 20:08:07,649 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:08:07,649 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:08:07,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:08:07,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:08:07,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:08:07,707 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911159743] [2019-11-15 20:08:07,707 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:08:07,707 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:08:07,707 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592711613] [2019-11-15 20:08:07,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:08:07,708 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:08:07,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:08:07,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:08:07,708 INFO L87 Difference]: Start difference. First operand 5344 states and 11888 transitions. Second operand 5 states. [2019-11-15 20:08:07,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:08:07,810 INFO L93 Difference]: Finished difference Result 5833 states and 12951 transitions. [2019-11-15 20:08:07,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:08:07,810 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-11-15 20:08:07,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:08:07,814 INFO L225 Difference]: With dead ends: 5833 [2019-11-15 20:08:07,815 INFO L226 Difference]: Without dead ends: 5833 [2019-11-15 20:08:07,815 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:08:07,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5833 states. [2019-11-15 20:08:07,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5833 to 4469. [2019-11-15 20:08:07,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4469 states. [2019-11-15 20:08:07,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4469 states to 4469 states and 9934 transitions. [2019-11-15 20:08:07,863 INFO L78 Accepts]: Start accepts. Automaton has 4469 states and 9934 transitions. Word has length 95 [2019-11-15 20:08:07,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:08:07,863 INFO L462 AbstractCegarLoop]: Abstraction has 4469 states and 9934 transitions. [2019-11-15 20:08:07,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:08:07,863 INFO L276 IsEmpty]: Start isEmpty. Operand 4469 states and 9934 transitions. [2019-11-15 20:08:07,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 20:08:07,867 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:08:07,867 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 20:08:07,867 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:08:07,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:08:07,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1576901657, now seen corresponding path program 1 times [2019-11-15 20:08:07,867 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:08:07,868 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211054815] [2019-11-15 20:08:07,868 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:08:07,868 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:08:07,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:08:07,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:08:07,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:08:07,926 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211054815] [2019-11-15 20:08:07,926 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:08:07,926 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:08:07,927 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475856464] [2019-11-15 20:08:07,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:08:07,927 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:08:07,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:08:07,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:08:07,928 INFO L87 Difference]: Start difference. First operand 4469 states and 9934 transitions. Second operand 4 states. [2019-11-15 20:08:08,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:08:08,042 INFO L93 Difference]: Finished difference Result 4900 states and 10901 transitions. [2019-11-15 20:08:08,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:08:08,042 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-15 20:08:08,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:08:08,047 INFO L225 Difference]: With dead ends: 4900 [2019-11-15 20:08:08,047 INFO L226 Difference]: Without dead ends: 4900 [2019-11-15 20:08:08,047 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:08:08,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4900 states. [2019-11-15 20:08:08,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4900 to 4540. [2019-11-15 20:08:08,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4540 states. [2019-11-15 20:08:08,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4540 states to 4540 states and 10085 transitions. [2019-11-15 20:08:08,108 INFO L78 Accepts]: Start accepts. Automaton has 4540 states and 10085 transitions. Word has length 95 [2019-11-15 20:08:08,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:08:08,109 INFO L462 AbstractCegarLoop]: Abstraction has 4540 states and 10085 transitions. [2019-11-15 20:08:08,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:08:08,109 INFO L276 IsEmpty]: Start isEmpty. Operand 4540 states and 10085 transitions. [2019-11-15 20:08:08,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 20:08:08,115 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:08:08,115 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 20:08:08,115 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:08:08,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:08:08,116 INFO L82 PathProgramCache]: Analyzing trace with hash -476923578, now seen corresponding path program 1 times [2019-11-15 20:08:08,116 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:08:08,116 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48862833] [2019-11-15 20:08:08,116 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:08:08,116 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:08:08,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:08:08,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:08:08,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:08:08,182 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48862833] [2019-11-15 20:08:08,182 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:08:08,182 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:08:08,182 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711853243] [2019-11-15 20:08:08,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:08:08,183 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:08:08,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:08:08,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:08:08,184 INFO L87 Difference]: Start difference. First operand 4540 states and 10085 transitions. Second operand 4 states. [2019-11-15 20:08:08,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:08:08,500 INFO L93 Difference]: Finished difference Result 5768 states and 12740 transitions. [2019-11-15 20:08:08,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:08:08,500 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-15 20:08:08,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:08:08,506 INFO L225 Difference]: With dead ends: 5768 [2019-11-15 20:08:08,506 INFO L226 Difference]: Without dead ends: 5716 [2019-11-15 20:08:08,507 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:08:08,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5716 states. [2019-11-15 20:08:08,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5716 to 5413. [2019-11-15 20:08:08,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5413 states. [2019-11-15 20:08:08,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5413 states to 5413 states and 11982 transitions. [2019-11-15 20:08:08,582 INFO L78 Accepts]: Start accepts. Automaton has 5413 states and 11982 transitions. Word has length 95 [2019-11-15 20:08:08,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:08:08,583 INFO L462 AbstractCegarLoop]: Abstraction has 5413 states and 11982 transitions. [2019-11-15 20:08:08,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:08:08,583 INFO L276 IsEmpty]: Start isEmpty. Operand 5413 states and 11982 transitions. [2019-11-15 20:08:08,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 20:08:08,589 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:08:08,589 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 20:08:08,590 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:08:08,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:08:08,590 INFO L82 PathProgramCache]: Analyzing trace with hash 640856296, now seen corresponding path program 1 times [2019-11-15 20:08:08,590 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:08:08,590 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055511468] [2019-11-15 20:08:08,590 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:08:08,591 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:08:08,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:08:08,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:08:08,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:08:08,693 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055511468] [2019-11-15 20:08:08,693 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:08:08,693 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 20:08:08,693 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442899561] [2019-11-15 20:08:08,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:08:08,694 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:08:08,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:08:08,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:08:08,694 INFO L87 Difference]: Start difference. First operand 5413 states and 11982 transitions. Second operand 7 states. [2019-11-15 20:08:09,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:08:09,213 INFO L93 Difference]: Finished difference Result 7243 states and 15991 transitions. [2019-11-15 20:08:09,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 20:08:09,214 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-11-15 20:08:09,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:08:09,222 INFO L225 Difference]: With dead ends: 7243 [2019-11-15 20:08:09,223 INFO L226 Difference]: Without dead ends: 7243 [2019-11-15 20:08:09,223 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-11-15 20:08:09,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7243 states. [2019-11-15 20:08:09,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7243 to 6514. [2019-11-15 20:08:09,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6514 states. [2019-11-15 20:08:09,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6514 states to 6514 states and 14409 transitions. [2019-11-15 20:08:09,366 INFO L78 Accepts]: Start accepts. Automaton has 6514 states and 14409 transitions. Word has length 95 [2019-11-15 20:08:09,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:08:09,366 INFO L462 AbstractCegarLoop]: Abstraction has 6514 states and 14409 transitions. [2019-11-15 20:08:09,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:08:09,366 INFO L276 IsEmpty]: Start isEmpty. Operand 6514 states and 14409 transitions. [2019-11-15 20:08:09,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 20:08:09,374 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:08:09,375 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 20:08:09,375 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:08:09,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:08:09,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1740834375, now seen corresponding path program 1 times [2019-11-15 20:08:09,376 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:08:09,376 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713925432] [2019-11-15 20:08:09,376 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:08:09,377 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:08:09,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:08:09,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:08:09,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:08:09,573 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713925432] [2019-11-15 20:08:09,573 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:08:09,573 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 20:08:09,573 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612732505] [2019-11-15 20:08:09,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 20:08:09,574 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:08:09,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 20:08:09,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-15 20:08:09,575 INFO L87 Difference]: Start difference. First operand 6514 states and 14409 transitions. Second operand 9 states. [2019-11-15 20:08:10,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:08:10,101 INFO L93 Difference]: Finished difference Result 8383 states and 18331 transitions. [2019-11-15 20:08:10,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 20:08:10,101 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-11-15 20:08:10,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:08:10,107 INFO L225 Difference]: With dead ends: 8383 [2019-11-15 20:08:10,107 INFO L226 Difference]: Without dead ends: 8383 [2019-11-15 20:08:10,108 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 5 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 20:08:10,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8383 states. [2019-11-15 20:08:10,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8383 to 7231. [2019-11-15 20:08:10,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7231 states. [2019-11-15 20:08:10,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7231 states to 7231 states and 15884 transitions. [2019-11-15 20:08:10,183 INFO L78 Accepts]: Start accepts. Automaton has 7231 states and 15884 transitions. Word has length 95 [2019-11-15 20:08:10,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:08:10,183 INFO L462 AbstractCegarLoop]: Abstraction has 7231 states and 15884 transitions. [2019-11-15 20:08:10,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 20:08:10,183 INFO L276 IsEmpty]: Start isEmpty. Operand 7231 states and 15884 transitions. [2019-11-15 20:08:10,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 20:08:10,189 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:08:10,189 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 20:08:10,190 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:08:10,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:08:10,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1952185288, now seen corresponding path program 1 times [2019-11-15 20:08:10,190 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:08:10,190 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590818692] [2019-11-15 20:08:10,191 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:08:10,191 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:08:10,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:08:10,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:08:10,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:08:10,285 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590818692] [2019-11-15 20:08:10,285 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:08:10,286 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:08:10,286 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060312609] [2019-11-15 20:08:10,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:08:10,286 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:08:10,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:08:10,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:08:10,287 INFO L87 Difference]: Start difference. First operand 7231 states and 15884 transitions. Second operand 5 states. [2019-11-15 20:08:10,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:08:10,346 INFO L93 Difference]: Finished difference Result 7150 states and 15668 transitions. [2019-11-15 20:08:10,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:08:10,347 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-11-15 20:08:10,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:08:10,354 INFO L225 Difference]: With dead ends: 7150 [2019-11-15 20:08:10,354 INFO L226 Difference]: Without dead ends: 7150 [2019-11-15 20:08:10,356 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 20:08:10,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7150 states. [2019-11-15 20:08:10,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7150 to 5484. [2019-11-15 20:08:10,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5484 states. [2019-11-15 20:08:10,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5484 states to 5484 states and 12005 transitions. [2019-11-15 20:08:10,423 INFO L78 Accepts]: Start accepts. Automaton has 5484 states and 12005 transitions. Word has length 95 [2019-11-15 20:08:10,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:08:10,423 INFO L462 AbstractCegarLoop]: Abstraction has 5484 states and 12005 transitions. [2019-11-15 20:08:10,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:08:10,423 INFO L276 IsEmpty]: Start isEmpty. Operand 5484 states and 12005 transitions. [2019-11-15 20:08:10,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 20:08:10,427 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:08:10,427 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 20:08:10,427 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:08:10,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:08:10,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1455278327, now seen corresponding path program 1 times [2019-11-15 20:08:10,427 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:08:10,427 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071258785] [2019-11-15 20:08:10,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:08:10,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:08:10,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:08:10,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:08:10,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:08:10,559 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071258785] [2019-11-15 20:08:10,559 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:08:10,559 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 20:08:10,559 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827670576] [2019-11-15 20:08:10,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 20:08:10,560 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:08:10,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 20:08:10,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:08:10,560 INFO L87 Difference]: Start difference. First operand 5484 states and 12005 transitions. Second operand 10 states. [2019-11-15 20:08:11,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:08:11,088 INFO L93 Difference]: Finished difference Result 16370 states and 36408 transitions. [2019-11-15 20:08:11,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-15 20:08:11,089 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 95 [2019-11-15 20:08:11,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:08:11,100 INFO L225 Difference]: With dead ends: 16370 [2019-11-15 20:08:11,100 INFO L226 Difference]: Without dead ends: 10815 [2019-11-15 20:08:11,100 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 20:08:11,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10815 states. [2019-11-15 20:08:11,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10815 to 5433. [2019-11-15 20:08:11,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5433 states. [2019-11-15 20:08:11,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5433 states to 5433 states and 11822 transitions. [2019-11-15 20:08:11,204 INFO L78 Accepts]: Start accepts. Automaton has 5433 states and 11822 transitions. Word has length 95 [2019-11-15 20:08:11,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:08:11,204 INFO L462 AbstractCegarLoop]: Abstraction has 5433 states and 11822 transitions. [2019-11-15 20:08:11,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 20:08:11,205 INFO L276 IsEmpty]: Start isEmpty. Operand 5433 states and 11822 transitions. [2019-11-15 20:08:11,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 20:08:11,210 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:08:11,211 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 20:08:11,211 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:08:11,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:08:11,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1976127129, now seen corresponding path program 2 times [2019-11-15 20:08:11,212 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:08:11,212 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124252208] [2019-11-15 20:08:11,212 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:08:11,212 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:08:11,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:08:11,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:08:11,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:08:11,313 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:08:11,313 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 20:08:11,485 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-15 20:08:11,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 08:08:11 BasicIcfg [2019-11-15 20:08:11,487 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 20:08:11,487 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:08:11,487 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:08:11,487 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:08:11,488 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:07:33" (3/4) ... [2019-11-15 20:08:11,491 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 20:08:11,608 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_64136e03-9c65-4dd5-9dae-c7a42dca2f33/bin/uautomizer/witness.graphml [2019-11-15 20:08:11,609 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:08:11,611 INFO L168 Benchmark]: Toolchain (without parser) took 39367.64 ms. Allocated memory was 1.0 GB in the beginning and 4.0 GB in the end (delta: 3.0 GB). Free memory was 939.4 MB in the beginning and 3.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 964.3 MB. Max. memory is 11.5 GB. [2019-11-15 20:08:11,611 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:08:11,611 INFO L168 Benchmark]: CACSL2BoogieTranslator took 620.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -165.8 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-11-15 20:08:11,612 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:08:11,612 INFO L168 Benchmark]: Boogie Preprocessor took 36.45 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:08:11,612 INFO L168 Benchmark]: RCFGBuilder took 820.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. [2019-11-15 20:08:11,613 INFO L168 Benchmark]: TraceAbstraction took 37711.48 ms. Allocated memory was 1.2 GB in the beginning and 4.0 GB in the end (delta: 2.9 GB). Free memory was 1.1 GB in the beginning and 3.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 918.6 MB. Max. memory is 11.5 GB. [2019-11-15 20:08:11,613 INFO L168 Benchmark]: Witness Printer took 121.75 ms. Allocated memory is still 4.0 GB. Free memory was 3.0 GB in the beginning and 3.0 GB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-11-15 20:08:11,615 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.25 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 620.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -165.8 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.45 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 820.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 37711.48 ms. Allocated memory was 1.2 GB in the beginning and 4.0 GB in the end (delta: 2.9 GB). Free memory was 1.1 GB in the beginning and 3.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 918.6 MB. Max. memory is 11.5 GB. * Witness Printer took 121.75 ms. Allocated memory is still 4.0 GB. Free memory was 3.0 GB in the beginning and 3.0 GB in the end (delta: 17.9 MB). Peak memory consumption was 17.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] [L699] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L700] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L702] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L704] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L705] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L706] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L707] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L708] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L709] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L710] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L711] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L712] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L713] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L714] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L715] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L716] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L717] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L718] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L719] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L720] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L793] 0 pthread_t t1555; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L794] FCALL, FORK 0 pthread_create(&t1555, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] 0 pthread_t t1556; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L729] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L730] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L731] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L732] 1 y$r_buff0_thd1 = (_Bool)1 [L735] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L796] FCALL, FORK 0 pthread_create(&t1556, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 1 [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L760] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L762] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L763] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L763] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L741] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L742] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L745] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L765] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L766] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L767] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L767] 2 y = y$flush_delayed ? y$mem_tmp : y [L768] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L804] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L805] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L805] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L806] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L809] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 218 locations, 3 error locations. Result: UNSAFE, OverallTime: 37.5s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 17.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8189 SDtfs, 8926 SDslu, 19174 SDs, 0 SdLazy, 7447 SolverSat, 433 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 301 GetRequests, 86 SyntacticMatches, 21 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71011occurred 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: 14.3s AutomataMinimizationTime, 30 MinimizatonAttempts, 106200 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 2131 NumberOfCodeBlocks, 2131 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2006 ConstructedInterpolants, 0 QuantifiedInterpolants, 366064 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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...