./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix032_rmo.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c7dfa269-2320-4393-af7a-086bf4a4b0e6/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c7dfa269-2320-4393-af7a-086bf4a4b0e6/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c7dfa269-2320-4393-af7a-086bf4a4b0e6/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c7dfa269-2320-4393-af7a-086bf4a4b0e6/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix032_rmo.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c7dfa269-2320-4393-af7a-086bf4a4b0e6/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c7dfa269-2320-4393-af7a-086bf4a4b0e6/bin-2019/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 3bccc60f19dbcc18d87154d20be228295e714a4b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.23-0cd3be1 [2018-11-28 12:34:06,853 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 12:34:06,854 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 12:34:06,862 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 12:34:06,862 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 12:34:06,862 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 12:34:06,863 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 12:34:06,864 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 12:34:06,865 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 12:34:06,866 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 12:34:06,866 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 12:34:06,867 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 12:34:06,867 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 12:34:06,868 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 12:34:06,869 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 12:34:06,869 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 12:34:06,870 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 12:34:06,871 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 12:34:06,872 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 12:34:06,873 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 12:34:06,873 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 12:34:06,874 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 12:34:06,875 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 12:34:06,875 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 12:34:06,875 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 12:34:06,876 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 12:34:06,876 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 12:34:06,877 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 12:34:06,877 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 12:34:06,878 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 12:34:06,878 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 12:34:06,879 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 12:34:06,879 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 12:34:06,879 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 12:34:06,880 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 12:34:06,880 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 12:34:06,880 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c7dfa269-2320-4393-af7a-086bf4a4b0e6/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 12:34:06,888 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 12:34:06,888 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 12:34:06,889 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 12:34:06,889 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 12:34:06,889 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 12:34:06,889 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 12:34:06,889 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 12:34:06,890 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 12:34:06,890 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 12:34:06,890 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 12:34:06,890 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 12:34:06,890 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 12:34:06,890 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 12:34:06,891 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 12:34:06,891 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 12:34:06,891 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 12:34:06,891 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 12:34:06,891 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 12:34:06,891 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 12:34:06,891 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 12:34:06,892 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 12:34:06,892 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 12:34:06,892 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 12:34:06,892 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 12:34:06,892 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 12:34:06,892 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 12:34:06,893 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 12:34:06,893 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 12:34:06,893 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 12:34:06,893 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 12:34:06,893 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_c7dfa269-2320-4393-af7a-086bf4a4b0e6/bin-2019/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 -> 3bccc60f19dbcc18d87154d20be228295e714a4b [2018-11-28 12:34:06,917 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 12:34:06,924 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 12:34:06,926 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 12:34:06,927 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 12:34:06,927 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 12:34:06,928 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c7dfa269-2320-4393-af7a-086bf4a4b0e6/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix032_rmo.opt_false-unreach-call.i [2018-11-28 12:34:06,965 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c7dfa269-2320-4393-af7a-086bf4a4b0e6/bin-2019/uautomizer/data/36bd0f05d/6883be3dde2b472d8b3ce141c54c5954/FLAGff9f1f2bc [2018-11-28 12:34:07,405 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 12:34:07,406 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c7dfa269-2320-4393-af7a-086bf4a4b0e6/sv-benchmarks/c/pthread-wmm/mix032_rmo.opt_false-unreach-call.i [2018-11-28 12:34:07,413 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c7dfa269-2320-4393-af7a-086bf4a4b0e6/bin-2019/uautomizer/data/36bd0f05d/6883be3dde2b472d8b3ce141c54c5954/FLAGff9f1f2bc [2018-11-28 12:34:07,422 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c7dfa269-2320-4393-af7a-086bf4a4b0e6/bin-2019/uautomizer/data/36bd0f05d/6883be3dde2b472d8b3ce141c54c5954 [2018-11-28 12:34:07,423 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 12:34:07,424 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 12:34:07,425 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 12:34:07,425 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 12:34:07,428 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 12:34:07,428 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:34:07" (1/1) ... [2018-11-28 12:34:07,430 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22b7394e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:34:07, skipping insertion in model container [2018-11-28 12:34:07,431 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:34:07" (1/1) ... [2018-11-28 12:34:07,437 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 12:34:07,468 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 12:34:07,714 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:34:07,723 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 12:34:07,814 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:34:07,850 INFO L195 MainTranslator]: Completed translation [2018-11-28 12:34:07,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:34:07 WrapperNode [2018-11-28 12:34:07,850 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 12:34:07,851 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 12:34:07,851 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 12:34:07,851 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 12:34:07,857 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:34:07" (1/1) ... [2018-11-28 12:34:07,871 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:34:07" (1/1) ... [2018-11-28 12:34:07,893 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 12:34:07,893 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 12:34:07,894 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 12:34:07,894 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 12:34:07,901 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:34:07" (1/1) ... [2018-11-28 12:34:07,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:34:07" (1/1) ... [2018-11-28 12:34:07,905 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:34:07" (1/1) ... [2018-11-28 12:34:07,905 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:34:07" (1/1) ... [2018-11-28 12:34:07,913 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:34:07" (1/1) ... [2018-11-28 12:34:07,916 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:34:07" (1/1) ... [2018-11-28 12:34:07,918 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:34:07" (1/1) ... [2018-11-28 12:34:07,921 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 12:34:07,922 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 12:34:07,922 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 12:34:07,922 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 12:34:07,923 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:34:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7dfa269-2320-4393-af7a-086bf4a4b0e6/bin-2019/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 [2018-11-28 12:34:07,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 12:34:07,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 12:34:07,969 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-11-28 12:34:07,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 12:34:07,969 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-11-28 12:34:07,969 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-11-28 12:34:07,969 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-11-28 12:34:07,970 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-11-28 12:34:07,970 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-11-28 12:34:07,970 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-11-28 12:34:07,970 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-11-28 12:34:07,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 12:34:07,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 12:34:07,971 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-11-28 12:34:08,370 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 12:34:08,370 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 12:34:08,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:34:08 BoogieIcfgContainer [2018-11-28 12:34:08,371 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 12:34:08,371 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 12:34:08,371 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 12:34:08,373 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 12:34:08,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:34:07" (1/3) ... [2018-11-28 12:34:08,374 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16dc1067 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:34:08, skipping insertion in model container [2018-11-28 12:34:08,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:34:07" (2/3) ... [2018-11-28 12:34:08,374 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16dc1067 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:34:08, skipping insertion in model container [2018-11-28 12:34:08,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:34:08" (3/3) ... [2018-11-28 12:34:08,375 INFO L112 eAbstractionObserver]: Analyzing ICFG mix032_rmo.opt_false-unreach-call.i [2018-11-28 12:34:08,399 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,400 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,400 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,400 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,400 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,400 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,400 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,400 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,401 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,401 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,401 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,401 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,401 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,401 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,402 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,402 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,402 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,402 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,402 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,402 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,402 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,402 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,403 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,403 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,403 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,403 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,403 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,403 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,403 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,404 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,404 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,404 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,404 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,404 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,404 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,404 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,405 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,405 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,405 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,405 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,405 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,405 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,406 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,406 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,406 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,406 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,406 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,406 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,406 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,407 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,407 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,407 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,407 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,407 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,407 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,408 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,408 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,408 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,408 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,408 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,408 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,409 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,409 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,409 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,409 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,409 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,409 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,409 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,409 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,410 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,414 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,414 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,414 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,414 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,414 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,414 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,415 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,415 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,415 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,415 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,415 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,415 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,415 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,415 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,416 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,416 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,416 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,416 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,416 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,416 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,416 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,416 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,417 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,417 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,417 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,417 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,417 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,417 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,417 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,417 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,418 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,418 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,418 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,418 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,418 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,418 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,418 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,418 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,419 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,419 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,419 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,419 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,419 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,419 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,420 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,420 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,420 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,420 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,420 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,420 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,420 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,421 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,421 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,421 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,421 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,421 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,421 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,421 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,421 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,422 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,422 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,422 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,422 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,422 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,422 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,422 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,423 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,423 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,423 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,423 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,423 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,423 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,423 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,423 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,424 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,424 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,424 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,424 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,424 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,424 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 12:34:08,429 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-11-28 12:34:08,429 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 12:34:08,435 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-28 12:34:08,446 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-28 12:34:08,463 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 12:34:08,463 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 12:34:08,463 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 12:34:08,463 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 12:34:08,463 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 12:34:08,463 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 12:34:08,464 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 12:34:08,464 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 12:34:08,464 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 12:34:08,472 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 149places, 180 transitions [2018-11-28 12:34:28,304 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 149048 states. [2018-11-28 12:34:28,305 INFO L276 IsEmpty]: Start isEmpty. Operand 149048 states. [2018-11-28 12:34:28,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-28 12:34:28,315 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:34:28,316 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:34:28,317 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:34:28,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:34:28,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1796074028, now seen corresponding path program 1 times [2018-11-28 12:34:28,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:34:28,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:34:28,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:34:28,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:34:28,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:34:28,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:34:28,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:34:28,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:34:28,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:34:28,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:34:28,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:34:28,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:34:28,523 INFO L87 Difference]: Start difference. First operand 149048 states. Second operand 4 states. [2018-11-28 12:34:30,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:34:30,293 INFO L93 Difference]: Finished difference Result 257068 states and 1188607 transitions. [2018-11-28 12:34:30,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:34:30,294 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-11-28 12:34:30,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:34:30,980 INFO L225 Difference]: With dead ends: 257068 [2018-11-28 12:34:30,980 INFO L226 Difference]: Without dead ends: 174818 [2018-11-28 12:34:30,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:34:31,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174818 states. [2018-11-28 12:34:37,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174818 to 110558. [2018-11-28 12:34:37,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110558 states. [2018-11-28 12:34:37,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110558 states to 110558 states and 511489 transitions. [2018-11-28 12:34:37,460 INFO L78 Accepts]: Start accepts. Automaton has 110558 states and 511489 transitions. Word has length 49 [2018-11-28 12:34:37,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:34:37,461 INFO L480 AbstractCegarLoop]: Abstraction has 110558 states and 511489 transitions. [2018-11-28 12:34:37,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:34:37,461 INFO L276 IsEmpty]: Start isEmpty. Operand 110558 states and 511489 transitions. [2018-11-28 12:34:37,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-28 12:34:37,472 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:34:37,473 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:34:37,473 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:34:37,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:34:37,473 INFO L82 PathProgramCache]: Analyzing trace with hash -506965212, now seen corresponding path program 1 times [2018-11-28 12:34:37,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:34:37,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:34:37,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:34:37,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:34:37,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:34:37,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:34:37,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:34:37,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:34:37,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:34:37,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:34:37,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:34:37,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:34:37,543 INFO L87 Difference]: Start difference. First operand 110558 states and 511489 transitions. Second operand 3 states. [2018-11-28 12:34:38,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:34:38,838 INFO L93 Difference]: Finished difference Result 110558 states and 511384 transitions. [2018-11-28 12:34:38,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:34:38,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2018-11-28 12:34:38,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:34:39,128 INFO L225 Difference]: With dead ends: 110558 [2018-11-28 12:34:39,128 INFO L226 Difference]: Without dead ends: 110558 [2018-11-28 12:34:39,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:34:39,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110558 states. [2018-11-28 12:34:40,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110558 to 110558. [2018-11-28 12:34:40,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110558 states. [2018-11-28 12:34:45,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110558 states to 110558 states and 511384 transitions. [2018-11-28 12:34:45,147 INFO L78 Accepts]: Start accepts. Automaton has 110558 states and 511384 transitions. Word has length 57 [2018-11-28 12:34:45,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:34:45,148 INFO L480 AbstractCegarLoop]: Abstraction has 110558 states and 511384 transitions. [2018-11-28 12:34:45,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:34:45,148 INFO L276 IsEmpty]: Start isEmpty. Operand 110558 states and 511384 transitions. [2018-11-28 12:34:45,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-28 12:34:45,154 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:34:45,154 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:34:45,155 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:34:45,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:34:45,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1235845123, now seen corresponding path program 1 times [2018-11-28 12:34:45,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:34:45,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:34:45,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:34:45,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:34:45,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:34:45,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:34:45,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:34:45,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:34:45,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:34:45,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:34:45,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:34:45,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:34:45,220 INFO L87 Difference]: Start difference. First operand 110558 states and 511384 transitions. Second operand 5 states. [2018-11-28 12:34:46,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:34:46,478 INFO L93 Difference]: Finished difference Result 240608 states and 1068639 transitions. [2018-11-28 12:34:46,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 12:34:46,478 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2018-11-28 12:34:46,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:34:47,085 INFO L225 Difference]: With dead ends: 240608 [2018-11-28 12:34:47,085 INFO L226 Difference]: Without dead ends: 237058 [2018-11-28 12:34:47,085 INFO L631 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 [2018-11-28 12:34:48,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237058 states. [2018-11-28 12:34:50,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237058 to 160438. [2018-11-28 12:34:50,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160438 states. [2018-11-28 12:34:51,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160438 states to 160438 states and 716828 transitions. [2018-11-28 12:34:51,096 INFO L78 Accepts]: Start accepts. Automaton has 160438 states and 716828 transitions. Word has length 57 [2018-11-28 12:34:51,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:34:51,097 INFO L480 AbstractCegarLoop]: Abstraction has 160438 states and 716828 transitions. [2018-11-28 12:34:51,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:34:51,097 INFO L276 IsEmpty]: Start isEmpty. Operand 160438 states and 716828 transitions. [2018-11-28 12:34:51,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-28 12:34:51,106 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:34:51,106 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:34:51,106 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:34:51,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:34:51,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1838099179, now seen corresponding path program 1 times [2018-11-28 12:34:51,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:34:51,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:34:51,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:34:51,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:34:51,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:34:51,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:34:51,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:34:51,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:34:51,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 12:34:51,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 12:34:51,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:34:51,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:34:51,223 INFO L87 Difference]: Start difference. First operand 160438 states and 716828 transitions. Second operand 6 states. [2018-11-28 12:34:53,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:34:53,172 INFO L93 Difference]: Finished difference Result 210258 states and 922769 transitions. [2018-11-28 12:34:53,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 12:34:53,172 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2018-11-28 12:34:53,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:34:53,698 INFO L225 Difference]: With dead ends: 210258 [2018-11-28 12:34:53,698 INFO L226 Difference]: Without dead ends: 207358 [2018-11-28 12:34:53,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-11-28 12:34:54,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207358 states. [2018-11-28 12:35:00,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207358 to 178278. [2018-11-28 12:35:00,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178278 states. [2018-11-28 12:35:01,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178278 states to 178278 states and 791365 transitions. [2018-11-28 12:35:01,117 INFO L78 Accepts]: Start accepts. Automaton has 178278 states and 791365 transitions. Word has length 58 [2018-11-28 12:35:01,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:35:01,118 INFO L480 AbstractCegarLoop]: Abstraction has 178278 states and 791365 transitions. [2018-11-28 12:35:01,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 12:35:01,118 INFO L276 IsEmpty]: Start isEmpty. Operand 178278 states and 791365 transitions. [2018-11-28 12:35:01,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-28 12:35:01,130 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:35:01,130 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:35:01,130 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:35:01,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:35:01,130 INFO L82 PathProgramCache]: Analyzing trace with hash -299178373, now seen corresponding path program 1 times [2018-11-28 12:35:01,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:35:01,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:35:01,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:35:01,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:35:01,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:35:01,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:35:01,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:35:01,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:35:01,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:35:01,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:35:01,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:35:01,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:35:01,172 INFO L87 Difference]: Start difference. First operand 178278 states and 791365 transitions. Second operand 3 states. [2018-11-28 12:35:02,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:35:02,793 INFO L93 Difference]: Finished difference Result 231658 states and 1011134 transitions. [2018-11-28 12:35:02,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:35:02,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-11-28 12:35:02,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:35:03,357 INFO L225 Difference]: With dead ends: 231658 [2018-11-28 12:35:03,357 INFO L226 Difference]: Without dead ends: 231658 [2018-11-28 12:35:03,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:35:04,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231658 states. [2018-11-28 12:35:13,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231658 to 202943. [2018-11-28 12:35:13,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202943 states. [2018-11-28 12:35:13,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202943 states to 202943 states and 893422 transitions. [2018-11-28 12:35:13,623 INFO L78 Accepts]: Start accepts. Automaton has 202943 states and 893422 transitions. Word has length 60 [2018-11-28 12:35:13,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:35:13,623 INFO L480 AbstractCegarLoop]: Abstraction has 202943 states and 893422 transitions. [2018-11-28 12:35:13,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:35:13,624 INFO L276 IsEmpty]: Start isEmpty. Operand 202943 states and 893422 transitions. [2018-11-28 12:35:13,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-28 12:35:13,651 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:35:13,651 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:35:13,652 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:35:13,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:35:13,652 INFO L82 PathProgramCache]: Analyzing trace with hash 281236806, now seen corresponding path program 1 times [2018-11-28 12:35:13,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:35:13,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:35:13,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:35:13,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:35:13,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:35:13,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:35:13,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:35:13,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:35:13,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 12:35:13,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 12:35:13,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:35:13,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:35:13,715 INFO L87 Difference]: Start difference. First operand 202943 states and 893422 transitions. Second operand 6 states. [2018-11-28 12:35:15,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:35:15,930 INFO L93 Difference]: Finished difference Result 356178 states and 1552140 transitions. [2018-11-28 12:35:15,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 12:35:15,931 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-11-28 12:35:15,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:35:16,782 INFO L225 Difference]: With dead ends: 356178 [2018-11-28 12:35:16,782 INFO L226 Difference]: Without dead ends: 352828 [2018-11-28 12:35:16,782 INFO L631 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 [2018-11-28 12:35:18,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352828 states. [2018-11-28 12:35:22,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352828 to 205748. [2018-11-28 12:35:22,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205748 states. [2018-11-28 12:35:23,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205748 states to 205748 states and 906656 transitions. [2018-11-28 12:35:23,038 INFO L78 Accepts]: Start accepts. Automaton has 205748 states and 906656 transitions. Word has length 64 [2018-11-28 12:35:23,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:35:23,039 INFO L480 AbstractCegarLoop]: Abstraction has 205748 states and 906656 transitions. [2018-11-28 12:35:23,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 12:35:23,039 INFO L276 IsEmpty]: Start isEmpty. Operand 205748 states and 906656 transitions. [2018-11-28 12:35:23,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-28 12:35:23,070 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:35:23,070 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:35:23,070 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:35:23,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:35:23,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1440890515, now seen corresponding path program 1 times [2018-11-28 12:35:23,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:35:23,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:35:23,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:35:23,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:35:23,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:35:23,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:35:23,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:35:23,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:35:23,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 12:35:23,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 12:35:23,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:35:23,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:35:23,146 INFO L87 Difference]: Start difference. First operand 205748 states and 906656 transitions. Second operand 6 states. [2018-11-28 12:35:28,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:35:28,655 INFO L93 Difference]: Finished difference Result 284253 states and 1239490 transitions. [2018-11-28 12:35:28,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 12:35:28,656 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-11-28 12:35:28,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:35:29,303 INFO L225 Difference]: With dead ends: 284253 [2018-11-28 12:35:29,303 INFO L226 Difference]: Without dead ends: 278558 [2018-11-28 12:35:29,303 INFO L631 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 [2018-11-28 12:35:30,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278558 states. [2018-11-28 12:35:33,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278558 to 261033. [2018-11-28 12:35:33,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261033 states. [2018-11-28 12:35:35,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261033 states to 261033 states and 1142709 transitions. [2018-11-28 12:35:35,395 INFO L78 Accepts]: Start accepts. Automaton has 261033 states and 1142709 transitions. Word has length 64 [2018-11-28 12:35:35,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:35:35,395 INFO L480 AbstractCegarLoop]: Abstraction has 261033 states and 1142709 transitions. [2018-11-28 12:35:35,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 12:35:35,395 INFO L276 IsEmpty]: Start isEmpty. Operand 261033 states and 1142709 transitions. [2018-11-28 12:35:35,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-28 12:35:35,434 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:35:35,434 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:35:35,434 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:35:35,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:35:35,435 INFO L82 PathProgramCache]: Analyzing trace with hash -356060844, now seen corresponding path program 1 times [2018-11-28 12:35:35,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:35:35,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:35:35,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:35:35,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:35:35,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:35:35,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:35:35,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:35:35,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:35:35,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 12:35:35,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 12:35:35,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 12:35:35,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:35:35,518 INFO L87 Difference]: Start difference. First operand 261033 states and 1142709 transitions. Second operand 7 states. [2018-11-28 12:35:38,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:35:38,602 INFO L93 Difference]: Finished difference Result 379448 states and 1607926 transitions. [2018-11-28 12:35:38,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 12:35:38,602 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2018-11-28 12:35:38,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:35:39,520 INFO L225 Difference]: With dead ends: 379448 [2018-11-28 12:35:39,520 INFO L226 Difference]: Without dead ends: 379448 [2018-11-28 12:35:39,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-28 12:35:40,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379448 states. [2018-11-28 12:35:50,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379448 to 308623. [2018-11-28 12:35:50,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308623 states. [2018-11-28 12:35:51,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308623 states to 308623 states and 1326666 transitions. [2018-11-28 12:35:51,864 INFO L78 Accepts]: Start accepts. Automaton has 308623 states and 1326666 transitions. Word has length 64 [2018-11-28 12:35:51,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:35:51,864 INFO L480 AbstractCegarLoop]: Abstraction has 308623 states and 1326666 transitions. [2018-11-28 12:35:51,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 12:35:51,864 INFO L276 IsEmpty]: Start isEmpty. Operand 308623 states and 1326666 transitions. [2018-11-28 12:35:51,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-28 12:35:51,901 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:35:51,901 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:35:51,901 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:35:51,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:35:51,901 INFO L82 PathProgramCache]: Analyzing trace with hash 531442837, now seen corresponding path program 1 times [2018-11-28 12:35:51,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:35:51,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:35:51,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:35:51,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:35:51,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:35:51,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:35:51,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:35:51,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:35:51,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:35:51,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:35:51,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:35:51,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:35:51,954 INFO L87 Difference]: Start difference. First operand 308623 states and 1326666 transitions. Second operand 4 states. [2018-11-28 12:35:53,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:35:53,836 INFO L93 Difference]: Finished difference Result 267156 states and 1127024 transitions. [2018-11-28 12:35:53,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 12:35:53,836 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-11-28 12:35:53,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:35:54,462 INFO L225 Difference]: With dead ends: 267156 [2018-11-28 12:35:54,462 INFO L226 Difference]: Without dead ends: 259071 [2018-11-28 12:35:54,463 INFO L631 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 [2018-11-28 12:35:56,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259071 states. [2018-11-28 12:35:59,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259071 to 259071. [2018-11-28 12:35:59,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259071 states. [2018-11-28 12:36:00,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259071 states to 259071 states and 1099302 transitions. [2018-11-28 12:36:00,456 INFO L78 Accepts]: Start accepts. Automaton has 259071 states and 1099302 transitions. Word has length 64 [2018-11-28 12:36:00,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:36:00,456 INFO L480 AbstractCegarLoop]: Abstraction has 259071 states and 1099302 transitions. [2018-11-28 12:36:00,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:36:00,456 INFO L276 IsEmpty]: Start isEmpty. Operand 259071 states and 1099302 transitions. [2018-11-28 12:36:00,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-28 12:36:00,495 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:36:00,495 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:36:00,496 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:36:00,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:36:00,496 INFO L82 PathProgramCache]: Analyzing trace with hash 757118313, now seen corresponding path program 1 times [2018-11-28 12:36:00,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:36:00,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:36:00,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:36:00,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:36:00,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:36:00,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:36:00,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:36:00,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:36:00,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:36:00,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:36:00,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:36:00,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:36:00,552 INFO L87 Difference]: Start difference. First operand 259071 states and 1099302 transitions. Second operand 5 states. [2018-11-28 12:36:00,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:36:00,787 INFO L93 Difference]: Finished difference Result 57903 states and 224526 transitions. [2018-11-28 12:36:00,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:36:00,788 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-11-28 12:36:00,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:36:00,877 INFO L225 Difference]: With dead ends: 57903 [2018-11-28 12:36:00,877 INFO L226 Difference]: Without dead ends: 50987 [2018-11-28 12:36:00,878 INFO L631 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 [2018-11-28 12:36:00,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50987 states. [2018-11-28 12:36:01,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50987 to 50747. [2018-11-28 12:36:01,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50747 states. [2018-11-28 12:36:05,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50747 states to 50747 states and 196313 transitions. [2018-11-28 12:36:05,986 INFO L78 Accepts]: Start accepts. Automaton has 50747 states and 196313 transitions. Word has length 65 [2018-11-28 12:36:05,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:36:05,986 INFO L480 AbstractCegarLoop]: Abstraction has 50747 states and 196313 transitions. [2018-11-28 12:36:05,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:36:05,986 INFO L276 IsEmpty]: Start isEmpty. Operand 50747 states and 196313 transitions. [2018-11-28 12:36:06,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-28 12:36:06,004 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:36:06,005 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:36:06,005 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:36:06,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:36:06,005 INFO L82 PathProgramCache]: Analyzing trace with hash -229270171, now seen corresponding path program 1 times [2018-11-28 12:36:06,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:36:06,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:36:06,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:36:06,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:36:06,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:36:06,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:36:06,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:36:06,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:36:06,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:36:06,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:36:06,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:36:06,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:36:06,065 INFO L87 Difference]: Start difference. First operand 50747 states and 196313 transitions. Second operand 4 states. [2018-11-28 12:36:06,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:36:06,427 INFO L93 Difference]: Finished difference Result 59866 states and 230932 transitions. [2018-11-28 12:36:06,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 12:36:06,427 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2018-11-28 12:36:06,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:36:06,551 INFO L225 Difference]: With dead ends: 59866 [2018-11-28 12:36:06,551 INFO L226 Difference]: Without dead ends: 59866 [2018-11-28 12:36:06,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:36:06,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59866 states. [2018-11-28 12:36:07,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59866 to 53962. [2018-11-28 12:36:07,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53962 states. [2018-11-28 12:36:07,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53962 states to 53962 states and 208380 transitions. [2018-11-28 12:36:07,422 INFO L78 Accepts]: Start accepts. Automaton has 53962 states and 208380 transitions. Word has length 75 [2018-11-28 12:36:07,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:36:07,422 INFO L480 AbstractCegarLoop]: Abstraction has 53962 states and 208380 transitions. [2018-11-28 12:36:07,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:36:07,422 INFO L276 IsEmpty]: Start isEmpty. Operand 53962 states and 208380 transitions. [2018-11-28 12:36:07,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-28 12:36:07,441 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:36:07,441 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:36:07,441 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:36:07,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:36:07,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1513540164, now seen corresponding path program 1 times [2018-11-28 12:36:07,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:36:07,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:36:07,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:36:07,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:36:07,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:36:07,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:36:07,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:36:07,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:36:07,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 12:36:07,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 12:36:07,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:36:07,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:36:07,523 INFO L87 Difference]: Start difference. First operand 53962 states and 208380 transitions. Second operand 6 states. [2018-11-28 12:36:08,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:36:08,229 INFO L93 Difference]: Finished difference Result 98121 states and 377174 transitions. [2018-11-28 12:36:08,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 12:36:08,230 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2018-11-28 12:36:08,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:36:08,687 INFO L225 Difference]: With dead ends: 98121 [2018-11-28 12:36:08,687 INFO L226 Difference]: Without dead ends: 97801 [2018-11-28 12:36:08,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-11-28 12:36:08,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97801 states. [2018-11-28 12:36:09,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97801 to 58187. [2018-11-28 12:36:09,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58187 states. [2018-11-28 12:36:09,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58187 states to 58187 states and 223571 transitions. [2018-11-28 12:36:09,788 INFO L78 Accepts]: Start accepts. Automaton has 58187 states and 223571 transitions. Word has length 75 [2018-11-28 12:36:09,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:36:09,788 INFO L480 AbstractCegarLoop]: Abstraction has 58187 states and 223571 transitions. [2018-11-28 12:36:09,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 12:36:09,789 INFO L276 IsEmpty]: Start isEmpty. Operand 58187 states and 223571 transitions. [2018-11-28 12:36:09,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-28 12:36:09,813 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:36:09,814 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:36:09,814 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:36:09,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:36:09,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1542588999, now seen corresponding path program 1 times [2018-11-28 12:36:09,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:36:09,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:36:09,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:36:09,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:36:09,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:36:09,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:36:09,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:36:09,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:36:09,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:36:09,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 12:36:09,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 12:36:09,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 12:36:09,873 INFO L87 Difference]: Start difference. First operand 58187 states and 223571 transitions. Second operand 4 states. [2018-11-28 12:36:10,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:36:10,277 INFO L93 Difference]: Finished difference Result 73350 states and 278575 transitions. [2018-11-28 12:36:10,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:36:10,278 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2018-11-28 12:36:10,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:36:10,430 INFO L225 Difference]: With dead ends: 73350 [2018-11-28 12:36:10,430 INFO L226 Difference]: Without dead ends: 73350 [2018-11-28 12:36:10,430 INFO L631 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 [2018-11-28 12:36:10,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73350 states. [2018-11-28 12:36:11,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73350 to 66714. [2018-11-28 12:36:11,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66714 states. [2018-11-28 12:36:11,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66714 states to 66714 states and 254003 transitions. [2018-11-28 12:36:11,714 INFO L78 Accepts]: Start accepts. Automaton has 66714 states and 254003 transitions. Word has length 77 [2018-11-28 12:36:11,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:36:11,714 INFO L480 AbstractCegarLoop]: Abstraction has 66714 states and 254003 transitions. [2018-11-28 12:36:11,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 12:36:11,714 INFO L276 IsEmpty]: Start isEmpty. Operand 66714 states and 254003 transitions. [2018-11-28 12:36:11,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-28 12:36:11,750 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:36:11,750 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:36:11,750 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:36:11,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:36:11,750 INFO L82 PathProgramCache]: Analyzing trace with hash 675168954, now seen corresponding path program 1 times [2018-11-28 12:36:11,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:36:11,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:36:11,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:36:11,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:36:11,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:36:11,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:36:11,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:36:11,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:36:11,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:36:11,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:36:11,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:36:11,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:36:11,800 INFO L87 Difference]: Start difference. First operand 66714 states and 254003 transitions. Second operand 3 states. [2018-11-28 12:36:12,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:36:12,137 INFO L93 Difference]: Finished difference Result 69476 states and 263648 transitions. [2018-11-28 12:36:12,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:36:12,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-11-28 12:36:12,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:36:12,273 INFO L225 Difference]: With dead ends: 69476 [2018-11-28 12:36:12,273 INFO L226 Difference]: Without dead ends: 69476 [2018-11-28 12:36:12,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:36:12,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69476 states. [2018-11-28 12:36:13,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69476 to 68224. [2018-11-28 12:36:13,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68224 states. [2018-11-28 12:36:13,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68224 states to 68224 states and 259247 transitions. [2018-11-28 12:36:13,495 INFO L78 Accepts]: Start accepts. Automaton has 68224 states and 259247 transitions. Word has length 77 [2018-11-28 12:36:13,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:36:13,495 INFO L480 AbstractCegarLoop]: Abstraction has 68224 states and 259247 transitions. [2018-11-28 12:36:13,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:36:13,496 INFO L276 IsEmpty]: Start isEmpty. Operand 68224 states and 259247 transitions. [2018-11-28 12:36:13,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-28 12:36:13,539 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:36:13,539 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:36:13,540 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:36:13,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:36:13,540 INFO L82 PathProgramCache]: Analyzing trace with hash -935757050, now seen corresponding path program 1 times [2018-11-28 12:36:13,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:36:13,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:36:13,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:36:13,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:36:13,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:36:13,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:36:13,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:36:13,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:36:13,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 12:36:13,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 12:36:13,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:36:13,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:36:13,614 INFO L87 Difference]: Start difference. First operand 68224 states and 259247 transitions. Second operand 6 states. [2018-11-28 12:36:14,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:36:14,354 INFO L93 Difference]: Finished difference Result 82931 states and 311778 transitions. [2018-11-28 12:36:14,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 12:36:14,354 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2018-11-28 12:36:14,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:36:14,514 INFO L225 Difference]: With dead ends: 82931 [2018-11-28 12:36:14,514 INFO L226 Difference]: Without dead ends: 82931 [2018-11-28 12:36:14,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:36:14,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82931 states. [2018-11-28 12:36:15,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82931 to 78447. [2018-11-28 12:36:15,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78447 states. [2018-11-28 12:36:15,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78447 states to 78447 states and 296296 transitions. [2018-11-28 12:36:15,922 INFO L78 Accepts]: Start accepts. Automaton has 78447 states and 296296 transitions. Word has length 79 [2018-11-28 12:36:15,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:36:15,923 INFO L480 AbstractCegarLoop]: Abstraction has 78447 states and 296296 transitions. [2018-11-28 12:36:15,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 12:36:15,923 INFO L276 IsEmpty]: Start isEmpty. Operand 78447 states and 296296 transitions. [2018-11-28 12:36:15,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-28 12:36:15,974 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:36:15,974 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:36:15,974 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:36:15,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:36:15,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1282000903, now seen corresponding path program 1 times [2018-11-28 12:36:15,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:36:15,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:36:15,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:36:15,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:36:15,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:36:15,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:36:16,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:36:16,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:36:16,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 12:36:16,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 12:36:16,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:36:16,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:36:16,065 INFO L87 Difference]: Start difference. First operand 78447 states and 296296 transitions. Second operand 6 states. [2018-11-28 12:36:16,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:36:16,616 INFO L93 Difference]: Finished difference Result 91981 states and 338639 transitions. [2018-11-28 12:36:16,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 12:36:16,616 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2018-11-28 12:36:16,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:36:16,793 INFO L225 Difference]: With dead ends: 91981 [2018-11-28 12:36:16,793 INFO L226 Difference]: Without dead ends: 91981 [2018-11-28 12:36:16,793 INFO L631 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 [2018-11-28 12:36:16,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91981 states. [2018-11-28 12:36:18,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91981 to 80036. [2018-11-28 12:36:18,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80036 states. [2018-11-28 12:36:18,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80036 states to 80036 states and 297461 transitions. [2018-11-28 12:36:18,279 INFO L78 Accepts]: Start accepts. Automaton has 80036 states and 297461 transitions. Word has length 79 [2018-11-28 12:36:18,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:36:18,279 INFO L480 AbstractCegarLoop]: Abstraction has 80036 states and 297461 transitions. [2018-11-28 12:36:18,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 12:36:18,280 INFO L276 IsEmpty]: Start isEmpty. Operand 80036 states and 297461 transitions. [2018-11-28 12:36:18,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-28 12:36:18,331 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:36:18,331 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:36:18,331 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:36:18,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:36:18,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1493351816, now seen corresponding path program 1 times [2018-11-28 12:36:18,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:36:18,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:36:18,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:36:18,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:36:18,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:36:18,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:36:18,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:36:18,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:36:18,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:36:18,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:36:18,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:36:18,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:36:18,408 INFO L87 Difference]: Start difference. First operand 80036 states and 297461 transitions. Second operand 5 states. [2018-11-28 12:36:18,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:36:18,984 INFO L93 Difference]: Finished difference Result 101345 states and 374909 transitions. [2018-11-28 12:36:18,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 12:36:18,985 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2018-11-28 12:36:18,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:36:19,225 INFO L225 Difference]: With dead ends: 101345 [2018-11-28 12:36:19,225 INFO L226 Difference]: Without dead ends: 101345 [2018-11-28 12:36:19,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:36:19,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101345 states. [2018-11-28 12:36:20,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101345 to 85991. [2018-11-28 12:36:20,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85991 states. [2018-11-28 12:36:20,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85991 states to 85991 states and 317479 transitions. [2018-11-28 12:36:20,728 INFO L78 Accepts]: Start accepts. Automaton has 85991 states and 317479 transitions. Word has length 79 [2018-11-28 12:36:20,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:36:20,729 INFO L480 AbstractCegarLoop]: Abstraction has 85991 states and 317479 transitions. [2018-11-28 12:36:20,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:36:20,729 INFO L276 IsEmpty]: Start isEmpty. Operand 85991 states and 317479 transitions. [2018-11-28 12:36:20,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-28 12:36:20,776 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:36:20,776 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:36:20,776 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:36:20,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:36:20,776 INFO L82 PathProgramCache]: Analyzing trace with hash 982817639, now seen corresponding path program 1 times [2018-11-28 12:36:20,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:36:20,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:36:20,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:36:20,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:36:20,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:36:20,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:36:20,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:36:20,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:36:20,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:36:20,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 12:36:20,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:36:20,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:36:20,829 INFO L87 Difference]: Start difference. First operand 85991 states and 317479 transitions. Second operand 5 states. [2018-11-28 12:36:21,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:36:21,467 INFO L93 Difference]: Finished difference Result 115114 states and 423727 transitions. [2018-11-28 12:36:21,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 12:36:21,468 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2018-11-28 12:36:21,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:36:21,670 INFO L225 Difference]: With dead ends: 115114 [2018-11-28 12:36:21,670 INFO L226 Difference]: Without dead ends: 115114 [2018-11-28 12:36:21,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 12:36:21,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115114 states. [2018-11-28 12:36:23,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115114 to 90924. [2018-11-28 12:36:23,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90924 states. [2018-11-28 12:36:23,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90924 states to 90924 states and 335673 transitions. [2018-11-28 12:36:23,251 INFO L78 Accepts]: Start accepts. Automaton has 90924 states and 335673 transitions. Word has length 79 [2018-11-28 12:36:23,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:36:23,251 INFO L480 AbstractCegarLoop]: Abstraction has 90924 states and 335673 transitions. [2018-11-28 12:36:23,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 12:36:23,251 INFO L276 IsEmpty]: Start isEmpty. Operand 90924 states and 335673 transitions. [2018-11-28 12:36:23,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-28 12:36:23,297 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:36:23,297 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:36:23,297 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:36:23,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:36:23,298 INFO L82 PathProgramCache]: Analyzing trace with hash -824636824, now seen corresponding path program 1 times [2018-11-28 12:36:23,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:36:23,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:36:23,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:36:23,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:36:23,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:36:23,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:36:23,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:36:23,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:36:23,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 12:36:23,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 12:36:23,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:36:23,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:36:23,346 INFO L87 Difference]: Start difference. First operand 90924 states and 335673 transitions. Second operand 6 states. [2018-11-28 12:36:23,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:36:23,458 INFO L93 Difference]: Finished difference Result 32108 states and 101609 transitions. [2018-11-28 12:36:23,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 12:36:23,459 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2018-11-28 12:36:23,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:36:23,491 INFO L225 Difference]: With dead ends: 32108 [2018-11-28 12:36:23,491 INFO L226 Difference]: Without dead ends: 25827 [2018-11-28 12:36:23,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-11-28 12:36:23,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25827 states. [2018-11-28 12:36:23,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25827 to 22407. [2018-11-28 12:36:23,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22407 states. [2018-11-28 12:36:23,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22407 states to 22407 states and 70116 transitions. [2018-11-28 12:36:23,725 INFO L78 Accepts]: Start accepts. Automaton has 22407 states and 70116 transitions. Word has length 79 [2018-11-28 12:36:23,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:36:23,725 INFO L480 AbstractCegarLoop]: Abstraction has 22407 states and 70116 transitions. [2018-11-28 12:36:23,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 12:36:23,725 INFO L276 IsEmpty]: Start isEmpty. Operand 22407 states and 70116 transitions. [2018-11-28 12:36:23,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-28 12:36:23,744 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:36:23,745 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:36:23,745 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:36:23,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:36:23,745 INFO L82 PathProgramCache]: Analyzing trace with hash 246826158, now seen corresponding path program 1 times [2018-11-28 12:36:23,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:36:23,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:36:23,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:36:23,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:36:23,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:36:23,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:36:23,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:36:23,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:36:23,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 12:36:23,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 12:36:23,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 12:36:23,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:36:23,827 INFO L87 Difference]: Start difference. First operand 22407 states and 70116 transitions. Second operand 7 states. [2018-11-28 12:36:24,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:36:24,172 INFO L93 Difference]: Finished difference Result 28185 states and 87909 transitions. [2018-11-28 12:36:24,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 12:36:24,172 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-11-28 12:36:24,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:36:24,206 INFO L225 Difference]: With dead ends: 28185 [2018-11-28 12:36:24,206 INFO L226 Difference]: Without dead ends: 28185 [2018-11-28 12:36:24,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:36:24,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28185 states. [2018-11-28 12:36:24,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28185 to 23157. [2018-11-28 12:36:24,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23157 states. [2018-11-28 12:36:24,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23157 states to 23157 states and 72666 transitions. [2018-11-28 12:36:24,485 INFO L78 Accepts]: Start accepts. Automaton has 23157 states and 72666 transitions. Word has length 94 [2018-11-28 12:36:24,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:36:24,485 INFO L480 AbstractCegarLoop]: Abstraction has 23157 states and 72666 transitions. [2018-11-28 12:36:24,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 12:36:24,485 INFO L276 IsEmpty]: Start isEmpty. Operand 23157 states and 72666 transitions. [2018-11-28 12:36:24,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-28 12:36:24,506 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:36:24,507 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:36:24,507 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:36:24,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:36:24,507 INFO L82 PathProgramCache]: Analyzing trace with hash 301893331, now seen corresponding path program 1 times [2018-11-28 12:36:24,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:36:24,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:36:24,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:36:24,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:36:24,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:36:24,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:36:24,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:36:24,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:36:24,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 12:36:24,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 12:36:24,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:36:24,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:36:24,579 INFO L87 Difference]: Start difference. First operand 23157 states and 72666 transitions. Second operand 6 states. [2018-11-28 12:36:24,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:36:24,685 INFO L93 Difference]: Finished difference Result 23093 states and 71882 transitions. [2018-11-28 12:36:24,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:36:24,686 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-11-28 12:36:24,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:36:24,710 INFO L225 Difference]: With dead ends: 23093 [2018-11-28 12:36:24,710 INFO L226 Difference]: Without dead ends: 23093 [2018-11-28 12:36:24,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:36:24,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23093 states. [2018-11-28 12:36:24,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23093 to 15574. [2018-11-28 12:36:24,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15574 states. [2018-11-28 12:36:24,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15574 states to 15574 states and 48920 transitions. [2018-11-28 12:36:24,959 INFO L78 Accepts]: Start accepts. Automaton has 15574 states and 48920 transitions. Word has length 94 [2018-11-28 12:36:24,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:36:24,959 INFO L480 AbstractCegarLoop]: Abstraction has 15574 states and 48920 transitions. [2018-11-28 12:36:24,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 12:36:24,959 INFO L276 IsEmpty]: Start isEmpty. Operand 15574 states and 48920 transitions. [2018-11-28 12:36:24,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-28 12:36:24,972 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:36:24,972 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:36:24,973 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:36:24,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:36:24,973 INFO L82 PathProgramCache]: Analyzing trace with hash -188871437, now seen corresponding path program 1 times [2018-11-28 12:36:24,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:36:24,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:36:24,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:36:24,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:36:24,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:36:24,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:36:25,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:36:25,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:36:25,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 12:36:25,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 12:36:25,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 12:36:25,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:36:25,045 INFO L87 Difference]: Start difference. First operand 15574 states and 48920 transitions. Second operand 7 states. [2018-11-28 12:36:25,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:36:25,403 INFO L93 Difference]: Finished difference Result 21391 states and 66469 transitions. [2018-11-28 12:36:25,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 12:36:25,403 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-11-28 12:36:25,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:36:25,427 INFO L225 Difference]: With dead ends: 21391 [2018-11-28 12:36:25,427 INFO L226 Difference]: Without dead ends: 21031 [2018-11-28 12:36:25,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-11-28 12:36:25,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21031 states. [2018-11-28 12:36:25,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21031 to 15779. [2018-11-28 12:36:25,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15779 states. [2018-11-28 12:36:25,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15779 states to 15779 states and 49184 transitions. [2018-11-28 12:36:25,614 INFO L78 Accepts]: Start accepts. Automaton has 15779 states and 49184 transitions. Word has length 96 [2018-11-28 12:36:25,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:36:25,614 INFO L480 AbstractCegarLoop]: Abstraction has 15779 states and 49184 transitions. [2018-11-28 12:36:25,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 12:36:25,615 INFO L276 IsEmpty]: Start isEmpty. Operand 15779 states and 49184 transitions. [2018-11-28 12:36:25,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-28 12:36:25,629 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:36:25,629 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:36:25,629 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:36:25,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:36:25,629 INFO L82 PathProgramCache]: Analyzing trace with hash 2028886516, now seen corresponding path program 1 times [2018-11-28 12:36:25,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:36:25,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:36:25,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:36:25,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:36:25,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:36:25,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:36:25,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:36:25,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:36:25,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 12:36:25,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 12:36:25,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 12:36:25,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:36:25,743 INFO L87 Difference]: Start difference. First operand 15779 states and 49184 transitions. Second operand 7 states. [2018-11-28 12:36:26,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:36:26,051 INFO L93 Difference]: Finished difference Result 18311 states and 56772 transitions. [2018-11-28 12:36:26,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 12:36:26,051 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-11-28 12:36:26,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:36:26,075 INFO L225 Difference]: With dead ends: 18311 [2018-11-28 12:36:26,075 INFO L226 Difference]: Without dead ends: 18311 [2018-11-28 12:36:26,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-11-28 12:36:26,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18311 states. [2018-11-28 12:36:26,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18311 to 17787. [2018-11-28 12:36:26,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17787 states. [2018-11-28 12:36:26,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17787 states to 17787 states and 55326 transitions. [2018-11-28 12:36:26,258 INFO L78 Accepts]: Start accepts. Automaton has 17787 states and 55326 transitions. Word has length 96 [2018-11-28 12:36:26,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:36:26,258 INFO L480 AbstractCegarLoop]: Abstraction has 17787 states and 55326 transitions. [2018-11-28 12:36:26,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 12:36:26,259 INFO L276 IsEmpty]: Start isEmpty. Operand 17787 states and 55326 transitions. [2018-11-28 12:36:26,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-28 12:36:26,273 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:36:26,273 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:36:26,273 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:36:26,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:36:26,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1378577099, now seen corresponding path program 1 times [2018-11-28 12:36:26,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:36:26,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:36:26,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:36:26,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:36:26,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:36:26,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:36:26,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:36:26,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:36:26,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 12:36:26,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 12:36:26,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 12:36:26,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-28 12:36:26,408 INFO L87 Difference]: Start difference. First operand 17787 states and 55326 transitions. Second operand 11 states. [2018-11-28 12:36:27,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:36:27,494 INFO L93 Difference]: Finished difference Result 30853 states and 95735 transitions. [2018-11-28 12:36:27,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-28 12:36:27,495 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2018-11-28 12:36:27,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:36:27,526 INFO L225 Difference]: With dead ends: 30853 [2018-11-28 12:36:27,526 INFO L226 Difference]: Without dead ends: 21172 [2018-11-28 12:36:27,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-11-28 12:36:27,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21172 states. [2018-11-28 12:36:27,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21172 to 18117. [2018-11-28 12:36:27,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18117 states. [2018-11-28 12:36:27,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18117 states to 18117 states and 55915 transitions. [2018-11-28 12:36:27,780 INFO L78 Accepts]: Start accepts. Automaton has 18117 states and 55915 transitions. Word has length 96 [2018-11-28 12:36:27,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:36:27,780 INFO L480 AbstractCegarLoop]: Abstraction has 18117 states and 55915 transitions. [2018-11-28 12:36:27,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 12:36:27,780 INFO L276 IsEmpty]: Start isEmpty. Operand 18117 states and 55915 transitions. [2018-11-28 12:36:27,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-28 12:36:27,794 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:36:27,795 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:36:27,795 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:36:27,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:36:27,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1273403089, now seen corresponding path program 2 times [2018-11-28 12:36:27,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:36:27,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:36:27,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:36:27,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:36:27,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:36:27,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:36:27,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:36:27,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:36:27,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 12:36:27,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 12:36:27,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 12:36:27,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-28 12:36:27,993 INFO L87 Difference]: Start difference. First operand 18117 states and 55915 transitions. Second operand 10 states. [2018-11-28 12:36:28,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:36:28,591 INFO L93 Difference]: Finished difference Result 33785 states and 103810 transitions. [2018-11-28 12:36:28,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 12:36:28,591 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2018-11-28 12:36:28,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:36:28,608 INFO L225 Difference]: With dead ends: 33785 [2018-11-28 12:36:28,608 INFO L226 Difference]: Without dead ends: 16217 [2018-11-28 12:36:28,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-11-28 12:36:28,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16217 states. [2018-11-28 12:36:28,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16217 to 16217. [2018-11-28 12:36:28,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16217 states. [2018-11-28 12:36:28,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16217 states to 16217 states and 49807 transitions. [2018-11-28 12:36:28,859 INFO L78 Accepts]: Start accepts. Automaton has 16217 states and 49807 transitions. Word has length 96 [2018-11-28 12:36:28,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:36:28,859 INFO L480 AbstractCegarLoop]: Abstraction has 16217 states and 49807 transitions. [2018-11-28 12:36:28,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 12:36:28,859 INFO L276 IsEmpty]: Start isEmpty. Operand 16217 states and 49807 transitions. [2018-11-28 12:36:28,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-28 12:36:28,871 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:36:28,871 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:36:28,871 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:36:28,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:36:28,872 INFO L82 PathProgramCache]: Analyzing trace with hash -2018289479, now seen corresponding path program 3 times [2018-11-28 12:36:28,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:36:28,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:36:28,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:36:28,872 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:36:28,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:36:28,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:36:29,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:36:29,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:36:29,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 12:36:29,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 12:36:29,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 12:36:29,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-28 12:36:29,010 INFO L87 Difference]: Start difference. First operand 16217 states and 49807 transitions. Second operand 10 states. [2018-11-28 12:36:29,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:36:29,402 INFO L93 Difference]: Finished difference Result 29055 states and 89067 transitions. [2018-11-28 12:36:29,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 12:36:29,402 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2018-11-28 12:36:29,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:36:29,413 INFO L225 Difference]: With dead ends: 29055 [2018-11-28 12:36:29,413 INFO L226 Difference]: Without dead ends: 11021 [2018-11-28 12:36:29,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2018-11-28 12:36:29,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11021 states. [2018-11-28 12:36:29,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11021 to 11021. [2018-11-28 12:36:29,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11021 states. [2018-11-28 12:36:29,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11021 states to 11021 states and 33729 transitions. [2018-11-28 12:36:29,511 INFO L78 Accepts]: Start accepts. Automaton has 11021 states and 33729 transitions. Word has length 96 [2018-11-28 12:36:29,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:36:29,511 INFO L480 AbstractCegarLoop]: Abstraction has 11021 states and 33729 transitions. [2018-11-28 12:36:29,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 12:36:29,511 INFO L276 IsEmpty]: Start isEmpty. Operand 11021 states and 33729 transitions. [2018-11-28 12:36:29,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-28 12:36:29,519 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:36:29,519 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:36:29,519 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:36:29,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:36:29,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1740505673, now seen corresponding path program 4 times [2018-11-28 12:36:29,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:36:29,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:36:29,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:36:29,520 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:36:29,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:36:29,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:36:29,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:36:29,575 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 12:36:29,679 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-11-28 12:36:29,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:36:29 BasicIcfg [2018-11-28 12:36:29,680 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 12:36:29,680 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 12:36:29,680 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 12:36:29,680 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 12:36:29,681 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:34:08" (3/4) ... [2018-11-28 12:36:29,684 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 12:36:29,800 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c7dfa269-2320-4393-af7a-086bf4a4b0e6/bin-2019/uautomizer/witness.graphml [2018-11-28 12:36:29,801 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 12:36:29,801 INFO L168 Benchmark]: Toolchain (without parser) took 142377.72 ms. Allocated memory was 1.0 GB in the beginning and 9.0 GB in the end (delta: 8.0 GB). Free memory was 951.7 MB in the beginning and 6.6 GB in the end (delta: -5.7 GB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. [2018-11-28 12:36:29,802 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:36:29,803 INFO L168 Benchmark]: CACSL2BoogieTranslator took 425.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -160.0 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. [2018-11-28 12:36:29,803 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.73 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. [2018-11-28 12:36:29,803 INFO L168 Benchmark]: Boogie Preprocessor took 28.05 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:36:29,803 INFO L168 Benchmark]: RCFGBuilder took 448.93 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: 52.0 MB). Peak memory consumption was 52.0 MB. Max. memory is 11.5 GB. [2018-11-28 12:36:29,803 INFO L168 Benchmark]: TraceAbstraction took 141308.79 ms. Allocated memory was 1.2 GB in the beginning and 9.0 GB in the end (delta: 7.8 GB). Free memory was 1.1 GB in the beginning and 6.7 GB in the end (delta: -5.6 GB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2018-11-28 12:36:29,804 INFO L168 Benchmark]: Witness Printer took 120.63 ms. Allocated memory is still 9.0 GB. Free memory was 6.7 GB in the beginning and 6.6 GB in the end (delta: 36.1 MB). Peak memory consumption was 36.1 MB. Max. memory is 11.5 GB. [2018-11-28 12:36:29,805 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 425.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -160.0 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.73 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 28.05 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 448.93 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: 52.0 MB). Peak memory consumption was 52.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 141308.79 ms. Allocated memory was 1.2 GB in the beginning and 9.0 GB in the end (delta: 7.8 GB). Free memory was 1.1 GB in the beginning and 6.7 GB in the end (delta: -5.6 GB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. * Witness Printer took 120.63 ms. Allocated memory is still 9.0 GB. Free memory was 6.7 GB in the beginning and 6.6 GB in the end (delta: 36.1 MB). Peak memory consumption was 36.1 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: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L678] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L680] -1 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0] [L682] -1 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L684] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L686] -1 int b = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0] [L687] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0] [L688] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0] [L690] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L692] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L694] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L695] -1 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L696] -1 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L697] -1 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L698] -1 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L699] -1 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L700] -1 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L701] -1 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0] [L702] -1 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L703] -1 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L704] -1 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L705] -1 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L706] -1 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L707] -1 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L708] -1 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L709] -1 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L710] -1 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L711] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L712] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L808] -1 pthread_t t866; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L809] FCALL, FORK -1 pthread_create(&t866, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L810] -1 pthread_t t867; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L811] FCALL, FORK -1 pthread_create(&t867, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L812] -1 pthread_t t868; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L813] FCALL, FORK -1 pthread_create(&t868, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L765] 0 z$w_buff1 = z$w_buff0 [L766] 0 z$w_buff0 = 1 [L767] 0 z$w_buff1_used = z$w_buff0_used [L768] 0 z$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 0 z$r_buff1_thd0 = z$r_buff0_thd0 [L771] 0 z$r_buff1_thd1 = z$r_buff0_thd1 [L772] 0 z$r_buff1_thd2 = z$r_buff0_thd2 [L773] 0 z$r_buff1_thd3 = z$r_buff0_thd3 [L774] 0 z$r_buff0_thd3 = (_Bool)1 [L777] 0 a = 1 [L780] 0 __unbuffered_p2_EAX = a [L783] 0 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L716] 1 b = 1 [L719] 1 __unbuffered_p0_EAX = x [L724] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L731] 2 x = 1 [L734] 2 y = 1 [L737] 2 __unbuffered_p1_EAX = y [L740] 2 weak$$choice0 = __VERIFIER_nondet_pointer() [L741] 2 weak$$choice2 = __VERIFIER_nondet_pointer() [L742] 2 z$flush_delayed = weak$$choice2 [L743] 2 z$mem_tmp = z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L745] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L745] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L746] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L746] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L747] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L747] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L748] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L749] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L749] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L750] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L751] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] EXPR 2 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] 0 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L752] 2 z = z$flush_delayed ? z$mem_tmp : z [L753] 2 z$flush_delayed = (_Bool)0 [L758] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L788] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L788] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L789] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 0 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L790] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L790] 0 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L793] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L815] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L819] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L819] EXPR -1 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L819] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L819] -1 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L820] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L820] -1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L821] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L821] -1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L822] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L822] -1 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L823] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L823] -1 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L826] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 222 locations, 3 error locations. UNSAFE Result, 141.2s OverallTime, 27 OverallIterations, 1 TraceHistogramMax, 36.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7698 SDtfs, 10312 SDslu, 19340 SDs, 0 SdLazy, 7621 SolverSat, 414 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 259 GetRequests, 69 SyntacticMatches, 14 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=308623occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 82.1s AutomataMinimizationTime, 26 MinimizatonAttempts, 568522 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 2065 NumberOfCodeBlocks, 2065 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1943 ConstructedInterpolants, 0 QuantifiedInterpolants, 402642 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...