./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix011_pso.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e0a31600-7ef4-45a6-b730-fd54ba9f8c82/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e0a31600-7ef4-45a6-b730-fd54ba9f8c82/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e0a31600-7ef4-45a6-b730-fd54ba9f8c82/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e0a31600-7ef4-45a6-b730-fd54ba9f8c82/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix011_pso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_e0a31600-7ef4-45a6-b730-fd54ba9f8c82/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e0a31600-7ef4-45a6-b730-fd54ba9f8c82/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2c8bd5173f7a5071741d35a00d4948a15adec514 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-635dfa2 [2018-12-09 16:49:01,863 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 16:49:01,864 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 16:49:01,872 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 16:49:01,872 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 16:49:01,873 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 16:49:01,874 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 16:49:01,875 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 16:49:01,876 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 16:49:01,876 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 16:49:01,877 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 16:49:01,877 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 16:49:01,878 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 16:49:01,878 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 16:49:01,879 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 16:49:01,880 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 16:49:01,880 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 16:49:01,882 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 16:49:01,883 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 16:49:01,884 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 16:49:01,885 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 16:49:01,885 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 16:49:01,887 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 16:49:01,887 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 16:49:01,887 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 16:49:01,888 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 16:49:01,888 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 16:49:01,889 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 16:49:01,889 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 16:49:01,890 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 16:49:01,890 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 16:49:01,890 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 16:49:01,890 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 16:49:01,891 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 16:49:01,891 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 16:49:01,891 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 16:49:01,891 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e0a31600-7ef4-45a6-b730-fd54ba9f8c82/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 16:49:01,898 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 16:49:01,898 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 16:49:01,899 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 16:49:01,899 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 16:49:01,899 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 16:49:01,899 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 16:49:01,899 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 16:49:01,899 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 16:49:01,899 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 16:49:01,899 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 16:49:01,899 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 16:49:01,899 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 16:49:01,900 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 16:49:01,900 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 16:49:01,900 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 16:49:01,900 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 16:49:01,900 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 16:49:01,900 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 16:49:01,900 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 16:49:01,900 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 16:49:01,900 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 16:49:01,900 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 16:49:01,901 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 16:49:01,901 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 16:49:01,901 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 16:49:01,901 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 16:49:01,901 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 16:49:01,901 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 16:49:01,901 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 16:49:01,901 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 16:49:01,901 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 16:49:01,901 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 16:49:01,901 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 16:49:01,901 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 16:49:01,901 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 16:49:01,902 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 16:49:01,902 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_e0a31600-7ef4-45a6-b730-fd54ba9f8c82/bin-2019/utaipan 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 -> Taipan 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 -> 2c8bd5173f7a5071741d35a00d4948a15adec514 [2018-12-09 16:49:01,918 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 16:49:01,925 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 16:49:01,927 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 16:49:01,928 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 16:49:01,928 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 16:49:01,928 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e0a31600-7ef4-45a6-b730-fd54ba9f8c82/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix011_pso.opt_false-unreach-call.i [2018-12-09 16:49:01,964 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e0a31600-7ef4-45a6-b730-fd54ba9f8c82/bin-2019/utaipan/data/987ff7ac2/61019f5788f8491fa42e6e49daf5aa61/FLAGcddecf742 [2018-12-09 16:49:02,440 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 16:49:02,440 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e0a31600-7ef4-45a6-b730-fd54ba9f8c82/sv-benchmarks/c/pthread-wmm/mix011_pso.opt_false-unreach-call.i [2018-12-09 16:49:02,447 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e0a31600-7ef4-45a6-b730-fd54ba9f8c82/bin-2019/utaipan/data/987ff7ac2/61019f5788f8491fa42e6e49daf5aa61/FLAGcddecf742 [2018-12-09 16:49:02,455 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e0a31600-7ef4-45a6-b730-fd54ba9f8c82/bin-2019/utaipan/data/987ff7ac2/61019f5788f8491fa42e6e49daf5aa61 [2018-12-09 16:49:02,457 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 16:49:02,458 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 16:49:02,459 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 16:49:02,459 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 16:49:02,462 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 16:49:02,462 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:49:02" (1/1) ... [2018-12-09 16:49:02,464 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cdc5e03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:49:02, skipping insertion in model container [2018-12-09 16:49:02,464 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:49:02" (1/1) ... [2018-12-09 16:49:02,470 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 16:49:02,499 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 16:49:02,702 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 16:49:02,710 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 16:49:02,776 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 16:49:02,805 INFO L195 MainTranslator]: Completed translation [2018-12-09 16:49:02,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:49:02 WrapperNode [2018-12-09 16:49:02,805 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 16:49:02,806 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 16:49:02,806 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 16:49:02,806 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 16:49:02,811 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:49:02" (1/1) ... [2018-12-09 16:49:02,822 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:49:02" (1/1) ... [2018-12-09 16:49:02,839 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 16:49:02,839 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 16:49:02,839 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 16:49:02,839 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 16:49:02,845 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:49:02" (1/1) ... [2018-12-09 16:49:02,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:49:02" (1/1) ... [2018-12-09 16:49:02,848 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:49:02" (1/1) ... [2018-12-09 16:49:02,848 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:49:02" (1/1) ... [2018-12-09 16:49:02,854 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:49:02" (1/1) ... [2018-12-09 16:49:02,856 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:49:02" (1/1) ... [2018-12-09 16:49:02,858 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:49:02" (1/1) ... [2018-12-09 16:49:02,861 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 16:49:02,861 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 16:49:02,861 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 16:49:02,861 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 16:49:02,862 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:49:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e0a31600-7ef4-45a6-b730-fd54ba9f8c82/bin-2019/utaipan/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-12-09 16:49:02,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 16:49:02,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 16:49:02,893 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 16:49:02,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 16:49:02,893 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 16:49:02,893 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 16:49:02,894 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 16:49:02,894 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 16:49:02,894 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-09 16:49:02,894 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-09 16:49:02,894 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 16:49:02,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 16:49:02,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 16:49:02,895 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-09 16:49:03,232 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 16:49:03,233 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 16:49:03,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:49:03 BoogieIcfgContainer [2018-12-09 16:49:03,233 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 16:49:03,233 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 16:49:03,233 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 16:49:03,235 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 16:49:03,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 04:49:02" (1/3) ... [2018-12-09 16:49:03,236 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@654daca2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:49:03, skipping insertion in model container [2018-12-09 16:49:03,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:49:02" (2/3) ... [2018-12-09 16:49:03,236 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@654daca2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:49:03, skipping insertion in model container [2018-12-09 16:49:03,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:49:03" (3/3) ... [2018-12-09 16:49:03,237 INFO L112 eAbstractionObserver]: Analyzing ICFG mix011_pso.opt_false-unreach-call.i [2018-12-09 16:49:03,263 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,263 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,263 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,263 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,264 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,264 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,264 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,264 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,264 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,264 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,264 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,264 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,264 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,265 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,265 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,265 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,265 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,265 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,265 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,265 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,265 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,265 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,265 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,265 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,265 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,265 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,266 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,266 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,266 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,266 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,266 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,266 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,266 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,266 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,266 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,266 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,267 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,267 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,267 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,267 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,267 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,267 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,267 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,267 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,267 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,267 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,267 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,268 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,268 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,268 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,268 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,268 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,268 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,268 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,268 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,268 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,268 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,268 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,269 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,269 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,269 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,269 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,269 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,269 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,269 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,269 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,269 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,269 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,269 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,269 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,270 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,270 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,270 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,270 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,270 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,270 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,270 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,270 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,270 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,271 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,271 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,271 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,271 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,271 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,271 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,271 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,271 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,271 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,272 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,272 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,272 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,272 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,272 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,272 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,272 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,272 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,272 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,273 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,273 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,273 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,273 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,273 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,273 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,273 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,273 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,274 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,274 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,274 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,274 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,274 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,274 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,274 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,275 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,275 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,275 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,275 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,275 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,275 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,275 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,275 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,276 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,276 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,276 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,276 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,276 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,276 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,276 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,276 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,276 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,276 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,276 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,276 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,276 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,277 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,277 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,277 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,277 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,277 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,277 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,277 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,277 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,277 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,277 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,277 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,277 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,278 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,278 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,278 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,278 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,278 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,278 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,278 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,278 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,278 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,278 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,278 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,278 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,278 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,279 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,279 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,279 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,279 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,279 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,279 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,279 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,279 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,279 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,279 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,279 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,279 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,279 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,280 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,280 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,280 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,280 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,280 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,280 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,280 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,280 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,280 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,280 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,280 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,280 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,280 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,281 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,281 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,281 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,281 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,281 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,281 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,281 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,281 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,281 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,281 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,282 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,282 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,282 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,282 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,282 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,282 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,282 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,282 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,282 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,282 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,283 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,283 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,283 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,283 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,283 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,283 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,283 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,283 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,283 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,283 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,283 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,283 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,283 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,284 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,284 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,284 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,284 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,284 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,284 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,284 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,284 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,284 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,284 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,284 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,284 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,284 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,285 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,285 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,285 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,285 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,285 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,285 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,285 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet57.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,285 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet57.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,285 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,285 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,285 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet57.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,285 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet57.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 16:49:03,291 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 16:49:03,291 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 16:49:03,296 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 16:49:03,305 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 16:49:03,320 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 16:49:03,320 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 16:49:03,320 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 16:49:03,320 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 16:49:03,320 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 16:49:03,320 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 16:49:03,320 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 16:49:03,320 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 16:49:03,327 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 189places, 241 transitions [2018-12-09 16:51:50,056 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 445146 states. [2018-12-09 16:51:50,058 INFO L276 IsEmpty]: Start isEmpty. Operand 445146 states. [2018-12-09 16:51:50,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 16:51:50,066 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:51:50,067 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] [2018-12-09 16:51:50,068 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:51:50,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:51:50,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1446185373, now seen corresponding path program 1 times [2018-12-09 16:51:50,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:51:50,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:51:50,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:51:50,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:51:50,108 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:51:50,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:51:50,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:51:50,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:51:50,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 16:51:50,217 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:51:50,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 16:51:50,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 16:51:50,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 16:51:50,230 INFO L87 Difference]: Start difference. First operand 445146 states. Second operand 4 states. [2018-12-09 16:51:58,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:51:58,072 INFO L93 Difference]: Finished difference Result 810626 states and 3886643 transitions. [2018-12-09 16:51:58,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 16:51:58,073 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-12-09 16:51:58,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:52:05,864 INFO L225 Difference]: With dead ends: 810626 [2018-12-09 16:52:05,864 INFO L226 Difference]: Without dead ends: 530976 [2018-12-09 16:52:05,865 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-12-09 16:52:12,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530976 states. [2018-12-09 16:52:18,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530976 to 307956. [2018-12-09 16:52:18,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307956 states. [2018-12-09 16:52:19,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307956 states to 307956 states and 1493657 transitions. [2018-12-09 16:52:19,646 INFO L78 Accepts]: Start accepts. Automaton has 307956 states and 1493657 transitions. Word has length 47 [2018-12-09 16:52:19,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:52:19,647 INFO L480 AbstractCegarLoop]: Abstraction has 307956 states and 1493657 transitions. [2018-12-09 16:52:19,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 16:52:19,647 INFO L276 IsEmpty]: Start isEmpty. Operand 307956 states and 1493657 transitions. [2018-12-09 16:52:19,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-09 16:52:19,657 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:52:19,658 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] [2018-12-09 16:52:19,658 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:52:19,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:52:19,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1064613016, now seen corresponding path program 1 times [2018-12-09 16:52:19,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:52:19,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:52:19,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:52:19,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:52:19,661 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:52:19,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:52:19,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:52:19,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:52:19,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 16:52:19,705 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:52:19,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 16:52:19,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 16:52:19,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 16:52:19,706 INFO L87 Difference]: Start difference. First operand 307956 states and 1493657 transitions. Second operand 3 states. [2018-12-09 16:52:21,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:52:21,909 INFO L93 Difference]: Finished difference Result 307956 states and 1492632 transitions. [2018-12-09 16:52:21,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 16:52:21,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2018-12-09 16:52:21,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:52:27,511 INFO L225 Difference]: With dead ends: 307956 [2018-12-09 16:52:27,512 INFO L226 Difference]: Without dead ends: 307956 [2018-12-09 16:52:27,512 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-12-09 16:52:32,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307956 states. [2018-12-09 16:52:36,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307956 to 307956. [2018-12-09 16:52:36,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307956 states. [2018-12-09 16:52:37,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307956 states to 307956 states and 1492632 transitions. [2018-12-09 16:52:37,949 INFO L78 Accepts]: Start accepts. Automaton has 307956 states and 1492632 transitions. Word has length 55 [2018-12-09 16:52:37,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:52:37,949 INFO L480 AbstractCegarLoop]: Abstraction has 307956 states and 1492632 transitions. [2018-12-09 16:52:37,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 16:52:37,949 INFO L276 IsEmpty]: Start isEmpty. Operand 307956 states and 1492632 transitions. [2018-12-09 16:52:37,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-09 16:52:37,956 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:52:37,956 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] [2018-12-09 16:52:37,956 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:52:37,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:52:37,956 INFO L82 PathProgramCache]: Analyzing trace with hash 678197319, now seen corresponding path program 1 times [2018-12-09 16:52:37,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:52:37,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:52:37,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:52:37,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:52:37,959 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:52:37,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:52:37,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:52:37,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:52:37,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 16:52:37,995 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:52:37,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 16:52:37,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 16:52:37,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 16:52:37,996 INFO L87 Difference]: Start difference. First operand 307956 states and 1492632 transitions. Second operand 4 states. [2018-12-09 16:52:39,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:52:39,387 INFO L93 Difference]: Finished difference Result 272410 states and 1286587 transitions. [2018-12-09 16:52:39,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 16:52:39,388 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-12-09 16:52:39,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:52:40,815 INFO L225 Difference]: With dead ends: 272410 [2018-12-09 16:52:40,815 INFO L226 Difference]: Without dead ends: 258310 [2018-12-09 16:52:40,816 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-12-09 16:52:49,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258310 states. [2018-12-09 16:52:52,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258310 to 258310. [2018-12-09 16:52:52,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258310 states. [2018-12-09 16:52:53,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258310 states to 258310 states and 1232394 transitions. [2018-12-09 16:52:53,447 INFO L78 Accepts]: Start accepts. Automaton has 258310 states and 1232394 transitions. Word has length 55 [2018-12-09 16:52:53,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:52:53,448 INFO L480 AbstractCegarLoop]: Abstraction has 258310 states and 1232394 transitions. [2018-12-09 16:52:53,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 16:52:53,448 INFO L276 IsEmpty]: Start isEmpty. Operand 258310 states and 1232394 transitions. [2018-12-09 16:52:53,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-09 16:52:53,454 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:52:53,454 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] [2018-12-09 16:52:53,454 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:52:53,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:52:53,454 INFO L82 PathProgramCache]: Analyzing trace with hash -801855287, now seen corresponding path program 1 times [2018-12-09 16:52:53,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:52:53,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:52:53,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:52:53,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:52:53,456 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:52:53,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:52:53,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:52:53,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:52:53,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 16:52:53,505 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:52:53,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 16:52:53,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 16:52:53,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 16:52:53,505 INFO L87 Difference]: Start difference. First operand 258310 states and 1232394 transitions. Second operand 5 states. [2018-12-09 16:52:53,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:52:53,777 INFO L93 Difference]: Finished difference Result 61670 states and 252910 transitions. [2018-12-09 16:52:53,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 16:52:53,777 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2018-12-09 16:52:53,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:52:53,880 INFO L225 Difference]: With dead ends: 61670 [2018-12-09 16:52:53,880 INFO L226 Difference]: Without dead ends: 49978 [2018-12-09 16:52:53,881 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-12-09 16:52:54,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49978 states. [2018-12-09 16:52:54,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49978 to 49518. [2018-12-09 16:52:54,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49518 states. [2018-12-09 16:52:54,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49518 states to 49518 states and 199432 transitions. [2018-12-09 16:52:54,628 INFO L78 Accepts]: Start accepts. Automaton has 49518 states and 199432 transitions. Word has length 56 [2018-12-09 16:52:54,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:52:54,628 INFO L480 AbstractCegarLoop]: Abstraction has 49518 states and 199432 transitions. [2018-12-09 16:52:54,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 16:52:54,628 INFO L276 IsEmpty]: Start isEmpty. Operand 49518 states and 199432 transitions. [2018-12-09 16:52:54,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-09 16:52:54,631 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:52:54,631 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] [2018-12-09 16:52:54,631 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:52:54,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:52:54,631 INFO L82 PathProgramCache]: Analyzing trace with hash -2065306486, now seen corresponding path program 1 times [2018-12-09 16:52:54,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:52:54,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:52:54,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:52:54,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:52:54,633 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:52:54,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:52:54,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:52:54,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:52:54,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 16:52:54,689 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:52:54,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 16:52:54,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 16:52:54,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 16:52:54,689 INFO L87 Difference]: Start difference. First operand 49518 states and 199432 transitions. Second operand 5 states. [2018-12-09 16:52:55,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:52:55,672 INFO L93 Difference]: Finished difference Result 100164 states and 398361 transitions. [2018-12-09 16:52:55,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 16:52:55,673 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2018-12-09 16:52:55,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:52:55,882 INFO L225 Difference]: With dead ends: 100164 [2018-12-09 16:52:55,882 INFO L226 Difference]: Without dead ends: 99789 [2018-12-09 16:52:55,882 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-12-09 16:52:56,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99789 states. [2018-12-09 16:52:56,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99789 to 66557. [2018-12-09 16:52:56,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66557 states. [2018-12-09 16:52:57,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66557 states to 66557 states and 261440 transitions. [2018-12-09 16:52:57,098 INFO L78 Accepts]: Start accepts. Automaton has 66557 states and 261440 transitions. Word has length 56 [2018-12-09 16:52:57,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:52:57,099 INFO L480 AbstractCegarLoop]: Abstraction has 66557 states and 261440 transitions. [2018-12-09 16:52:57,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 16:52:57,099 INFO L276 IsEmpty]: Start isEmpty. Operand 66557 states and 261440 transitions. [2018-12-09 16:52:57,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-09 16:52:57,102 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:52:57,102 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-12-09 16:52:57,102 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:52:57,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:52:57,103 INFO L82 PathProgramCache]: Analyzing trace with hash 397938288, now seen corresponding path program 1 times [2018-12-09 16:52:57,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:52:57,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:52:57,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:52:57,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:52:57,104 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:52:57,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:52:57,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:52:57,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:52:57,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 16:52:57,127 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:52:57,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 16:52:57,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 16:52:57,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 16:52:57,128 INFO L87 Difference]: Start difference. First operand 66557 states and 261440 transitions. Second operand 3 states. [2018-12-09 16:52:57,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:52:57,810 INFO L93 Difference]: Finished difference Result 122933 states and 477435 transitions. [2018-12-09 16:52:57,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 16:52:57,811 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-12-09 16:52:57,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:52:58,071 INFO L225 Difference]: With dead ends: 122933 [2018-12-09 16:52:58,072 INFO L226 Difference]: Without dead ends: 122913 [2018-12-09 16:52:58,072 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-12-09 16:52:58,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122913 states. [2018-12-09 16:52:59,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122913 to 103768. [2018-12-09 16:52:59,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103768 states. [2018-12-09 16:52:59,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103768 states to 103768 states and 403302 transitions. [2018-12-09 16:52:59,985 INFO L78 Accepts]: Start accepts. Automaton has 103768 states and 403302 transitions. Word has length 58 [2018-12-09 16:52:59,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:52:59,986 INFO L480 AbstractCegarLoop]: Abstraction has 103768 states and 403302 transitions. [2018-12-09 16:52:59,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 16:52:59,986 INFO L276 IsEmpty]: Start isEmpty. Operand 103768 states and 403302 transitions. [2018-12-09 16:52:59,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-09 16:52:59,993 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:52:59,993 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] [2018-12-09 16:52:59,994 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:52:59,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:52:59,994 INFO L82 PathProgramCache]: Analyzing trace with hash -549306821, now seen corresponding path program 1 times [2018-12-09 16:52:59,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:52:59,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:52:59,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:52:59,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:52:59,996 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:53:00,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:53:00,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:53:00,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:53:00,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 16:53:00,081 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:53:00,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 16:53:00,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 16:53:00,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-09 16:53:00,082 INFO L87 Difference]: Start difference. First operand 103768 states and 403302 transitions. Second operand 8 states. [2018-12-09 16:53:01,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:53:01,197 INFO L93 Difference]: Finished difference Result 140478 states and 532645 transitions. [2018-12-09 16:53:01,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 16:53:01,197 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2018-12-09 16:53:01,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:53:01,489 INFO L225 Difference]: With dead ends: 140478 [2018-12-09 16:53:01,489 INFO L226 Difference]: Without dead ends: 140013 [2018-12-09 16:53:01,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2018-12-09 16:53:01,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140013 states. [2018-12-09 16:53:03,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140013 to 105817. [2018-12-09 16:53:03,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105817 states. [2018-12-09 16:53:03,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105817 states to 105817 states and 410087 transitions. [2018-12-09 16:53:03,581 INFO L78 Accepts]: Start accepts. Automaton has 105817 states and 410087 transitions. Word has length 62 [2018-12-09 16:53:03,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:53:03,582 INFO L480 AbstractCegarLoop]: Abstraction has 105817 states and 410087 transitions. [2018-12-09 16:53:03,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 16:53:03,582 INFO L276 IsEmpty]: Start isEmpty. Operand 105817 states and 410087 transitions. [2018-12-09 16:53:03,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-09 16:53:03,608 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:53:03,609 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] [2018-12-09 16:53:03,609 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:53:03,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:53:03,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1816924190, now seen corresponding path program 1 times [2018-12-09 16:53:03,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:53:03,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:53:03,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:53:03,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:53:03,611 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:53:03,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:53:03,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:53:03,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:53:03,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 16:53:03,673 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:53:03,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 16:53:03,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 16:53:03,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 16:53:03,674 INFO L87 Difference]: Start difference. First operand 105817 states and 410087 transitions. Second operand 6 states. [2018-12-09 16:53:03,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:53:03,829 INFO L93 Difference]: Finished difference Result 40569 states and 137847 transitions. [2018-12-09 16:53:03,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 16:53:03,830 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2018-12-09 16:53:03,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:53:03,882 INFO L225 Difference]: With dead ends: 40569 [2018-12-09 16:53:03,882 INFO L226 Difference]: Without dead ends: 35641 [2018-12-09 16:53:03,882 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-12-09 16:53:03,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35641 states. [2018-12-09 16:53:05,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35641 to 34576. [2018-12-09 16:53:05,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34576 states. [2018-12-09 16:53:05,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34576 states to 34576 states and 116385 transitions. [2018-12-09 16:53:05,822 INFO L78 Accepts]: Start accepts. Automaton has 34576 states and 116385 transitions. Word has length 73 [2018-12-09 16:53:05,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:53:05,822 INFO L480 AbstractCegarLoop]: Abstraction has 34576 states and 116385 transitions. [2018-12-09 16:53:05,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 16:53:05,822 INFO L276 IsEmpty]: Start isEmpty. Operand 34576 states and 116385 transitions. [2018-12-09 16:53:05,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-09 16:53:05,861 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:53:05,861 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:53:05,862 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:53:05,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:53:05,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1298061300, now seen corresponding path program 1 times [2018-12-09 16:53:05,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:53:05,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:53:05,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:53:05,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:53:05,863 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:53:05,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:53:05,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:53:05,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:53:05,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 16:53:05,903 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:53:05,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 16:53:05,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 16:53:05,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 16:53:05,904 INFO L87 Difference]: Start difference. First operand 34576 states and 116385 transitions. Second operand 4 states. [2018-12-09 16:53:06,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:53:06,126 INFO L93 Difference]: Finished difference Result 39804 states and 132258 transitions. [2018-12-09 16:53:06,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 16:53:06,126 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2018-12-09 16:53:06,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:53:06,180 INFO L225 Difference]: With dead ends: 39804 [2018-12-09 16:53:06,180 INFO L226 Difference]: Without dead ends: 39804 [2018-12-09 16:53:06,180 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-12-09 16:53:06,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39804 states. [2018-12-09 16:53:06,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39804 to 37471. [2018-12-09 16:53:06,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37471 states. [2018-12-09 16:53:06,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37471 states to 37471 states and 125131 transitions. [2018-12-09 16:53:06,661 INFO L78 Accepts]: Start accepts. Automaton has 37471 states and 125131 transitions. Word has length 108 [2018-12-09 16:53:06,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:53:06,661 INFO L480 AbstractCegarLoop]: Abstraction has 37471 states and 125131 transitions. [2018-12-09 16:53:06,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 16:53:06,661 INFO L276 IsEmpty]: Start isEmpty. Operand 37471 states and 125131 transitions. [2018-12-09 16:53:06,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-09 16:53:06,700 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:53:06,700 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:53:06,700 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:53:06,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:53:06,700 INFO L82 PathProgramCache]: Analyzing trace with hash 919696653, now seen corresponding path program 1 times [2018-12-09 16:53:06,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:53:06,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:53:06,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:53:06,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:53:06,702 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:53:06,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:53:06,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:53:06,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:53:06,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 16:53:06,748 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:53:06,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 16:53:06,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 16:53:06,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 16:53:06,748 INFO L87 Difference]: Start difference. First operand 37471 states and 125131 transitions. Second operand 3 states. [2018-12-09 16:53:07,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:53:07,011 INFO L93 Difference]: Finished difference Result 51166 states and 169197 transitions. [2018-12-09 16:53:07,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 16:53:07,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2018-12-09 16:53:07,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:53:07,085 INFO L225 Difference]: With dead ends: 51166 [2018-12-09 16:53:07,085 INFO L226 Difference]: Without dead ends: 51166 [2018-12-09 16:53:07,085 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-12-09 16:53:07,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51166 states. [2018-12-09 16:53:07,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51166 to 46396. [2018-12-09 16:53:07,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46396 states. [2018-12-09 16:53:07,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46396 states to 46396 states and 154616 transitions. [2018-12-09 16:53:07,769 INFO L78 Accepts]: Start accepts. Automaton has 46396 states and 154616 transitions. Word has length 108 [2018-12-09 16:53:07,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:53:07,769 INFO L480 AbstractCegarLoop]: Abstraction has 46396 states and 154616 transitions. [2018-12-09 16:53:07,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 16:53:07,769 INFO L276 IsEmpty]: Start isEmpty. Operand 46396 states and 154616 transitions. [2018-12-09 16:53:07,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-09 16:53:07,817 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:53:07,817 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:53:07,817 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:53:07,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:53:07,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1110537687, now seen corresponding path program 2 times [2018-12-09 16:53:07,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:53:07,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:53:07,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:53:07,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:53:07,819 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:53:07,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:53:07,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:53:07,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:53:07,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 16:53:07,883 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:53:07,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 16:53:07,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 16:53:07,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 16:53:07,883 INFO L87 Difference]: Start difference. First operand 46396 states and 154616 transitions. Second operand 5 states. [2018-12-09 16:53:08,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:53:08,279 INFO L93 Difference]: Finished difference Result 60078 states and 195971 transitions. [2018-12-09 16:53:08,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 16:53:08,279 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2018-12-09 16:53:08,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:53:08,358 INFO L225 Difference]: With dead ends: 60078 [2018-12-09 16:53:08,359 INFO L226 Difference]: Without dead ends: 60078 [2018-12-09 16:53:08,359 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-12-09 16:53:08,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60078 states. [2018-12-09 16:53:08,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60078 to 50831. [2018-12-09 16:53:08,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50831 states. [2018-12-09 16:53:09,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50831 states to 50831 states and 168114 transitions. [2018-12-09 16:53:09,083 INFO L78 Accepts]: Start accepts. Automaton has 50831 states and 168114 transitions. Word has length 108 [2018-12-09 16:53:09,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:53:09,083 INFO L480 AbstractCegarLoop]: Abstraction has 50831 states and 168114 transitions. [2018-12-09 16:53:09,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 16:53:09,083 INFO L276 IsEmpty]: Start isEmpty. Operand 50831 states and 168114 transitions. [2018-12-09 16:53:09,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-09 16:53:09,141 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:53:09,141 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:53:09,142 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:53:09,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:53:09,142 INFO L82 PathProgramCache]: Analyzing trace with hash -411744613, now seen corresponding path program 3 times [2018-12-09 16:53:09,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:53:09,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:53:09,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 16:53:09,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:53:09,144 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:53:09,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:53:09,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:53:09,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:53:09,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 16:53:09,199 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:53:09,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 16:53:09,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 16:53:09,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 16:53:09,200 INFO L87 Difference]: Start difference. First operand 50831 states and 168114 transitions. Second operand 4 states. [2018-12-09 16:53:09,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:53:09,433 INFO L93 Difference]: Finished difference Result 51663 states and 170882 transitions. [2018-12-09 16:53:09,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 16:53:09,433 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2018-12-09 16:53:09,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:53:09,628 INFO L225 Difference]: With dead ends: 51663 [2018-12-09 16:53:09,628 INFO L226 Difference]: Without dead ends: 51663 [2018-12-09 16:53:09,629 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-12-09 16:53:09,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51663 states. [2018-12-09 16:53:10,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51663 to 51087. [2018-12-09 16:53:10,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51087 states. [2018-12-09 16:53:10,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51087 states to 51087 states and 169010 transitions. [2018-12-09 16:53:10,238 INFO L78 Accepts]: Start accepts. Automaton has 51087 states and 169010 transitions. Word has length 108 [2018-12-09 16:53:10,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:53:10,238 INFO L480 AbstractCegarLoop]: Abstraction has 51087 states and 169010 transitions. [2018-12-09 16:53:10,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 16:53:10,238 INFO L276 IsEmpty]: Start isEmpty. Operand 51087 states and 169010 transitions. [2018-12-09 16:53:10,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-09 16:53:10,296 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:53:10,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, 1, 1, 1, 1, 1, 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-12-09 16:53:10,297 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:53:10,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:53:10,297 INFO L82 PathProgramCache]: Analyzing trace with hash 2075768220, now seen corresponding path program 1 times [2018-12-09 16:53:10,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:53:10,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:53:10,298 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 16:53:10,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:53:10,298 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:53:10,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:53:10,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:53:10,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:53:10,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 16:53:10,395 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:53:10,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 16:53:10,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 16:53:10,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 16:53:10,395 INFO L87 Difference]: Start difference. First operand 51087 states and 169010 transitions. Second operand 6 states. [2018-12-09 16:53:10,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:53:10,562 INFO L93 Difference]: Finished difference Result 50895 states and 167938 transitions. [2018-12-09 16:53:10,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 16:53:10,563 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 108 [2018-12-09 16:53:10,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:53:10,635 INFO L225 Difference]: With dead ends: 50895 [2018-12-09 16:53:10,635 INFO L226 Difference]: Without dead ends: 50895 [2018-12-09 16:53:10,636 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-12-09 16:53:10,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50895 states. [2018-12-09 16:53:11,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50895 to 49362. [2018-12-09 16:53:11,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49362 states. [2018-12-09 16:53:11,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49362 states to 49362 states and 163380 transitions. [2018-12-09 16:53:11,295 INFO L78 Accepts]: Start accepts. Automaton has 49362 states and 163380 transitions. Word has length 108 [2018-12-09 16:53:11,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:53:11,295 INFO L480 AbstractCegarLoop]: Abstraction has 49362 states and 163380 transitions. [2018-12-09 16:53:11,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 16:53:11,295 INFO L276 IsEmpty]: Start isEmpty. Operand 49362 states and 163380 transitions. [2018-12-09 16:53:11,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-09 16:53:11,346 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:53:11,346 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:53:11,346 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:53:11,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:53:11,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1888864614, now seen corresponding path program 1 times [2018-12-09 16:53:11,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:53:11,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:53:11,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:53:11,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:53:11,348 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:53:11,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:53:11,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:53:11,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:53:11,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 16:53:11,529 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:53:11,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 16:53:11,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 16:53:11,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 16:53:11,530 INFO L87 Difference]: Start difference. First operand 49362 states and 163380 transitions. Second operand 8 states. [2018-12-09 16:53:12,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:53:12,775 INFO L93 Difference]: Finished difference Result 96500 states and 314072 transitions. [2018-12-09 16:53:12,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-09 16:53:12,776 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 110 [2018-12-09 16:53:12,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:53:12,918 INFO L225 Difference]: With dead ends: 96500 [2018-12-09 16:53:12,918 INFO L226 Difference]: Without dead ends: 96045 [2018-12-09 16:53:12,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2018-12-09 16:53:13,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96045 states. [2018-12-09 16:53:13,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96045 to 71737. [2018-12-09 16:53:13,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71737 states. [2018-12-09 16:53:14,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71737 states to 71737 states and 237370 transitions. [2018-12-09 16:53:14,031 INFO L78 Accepts]: Start accepts. Automaton has 71737 states and 237370 transitions. Word has length 110 [2018-12-09 16:53:14,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:53:14,032 INFO L480 AbstractCegarLoop]: Abstraction has 71737 states and 237370 transitions. [2018-12-09 16:53:14,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 16:53:14,032 INFO L276 IsEmpty]: Start isEmpty. Operand 71737 states and 237370 transitions. [2018-12-09 16:53:14,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-09 16:53:14,116 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:53:14,117 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:53:14,117 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:53:14,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:53:14,117 INFO L82 PathProgramCache]: Analyzing trace with hash 328893339, now seen corresponding path program 1 times [2018-12-09 16:53:14,117 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:53:14,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:53:14,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:53:14,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:53:14,118 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:53:14,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:53:14,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:53:14,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:53:14,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 16:53:14,304 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:53:14,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 16:53:14,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 16:53:14,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 16:53:14,304 INFO L87 Difference]: Start difference. First operand 71737 states and 237370 transitions. Second operand 7 states. [2018-12-09 16:53:15,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:53:15,011 INFO L93 Difference]: Finished difference Result 112397 states and 360818 transitions. [2018-12-09 16:53:15,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 16:53:15,012 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 110 [2018-12-09 16:53:15,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:53:15,190 INFO L225 Difference]: With dead ends: 112397 [2018-12-09 16:53:15,190 INFO L226 Difference]: Without dead ends: 112397 [2018-12-09 16:53:15,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-12-09 16:53:15,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112397 states. [2018-12-09 16:53:16,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112397 to 92207. [2018-12-09 16:53:16,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92207 states. [2018-12-09 16:53:16,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92207 states to 92207 states and 300141 transitions. [2018-12-09 16:53:16,817 INFO L78 Accepts]: Start accepts. Automaton has 92207 states and 300141 transitions. Word has length 110 [2018-12-09 16:53:16,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:53:16,818 INFO L480 AbstractCegarLoop]: Abstraction has 92207 states and 300141 transitions. [2018-12-09 16:53:16,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 16:53:16,818 INFO L276 IsEmpty]: Start isEmpty. Operand 92207 states and 300141 transitions. [2018-12-09 16:53:16,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-09 16:53:16,929 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:53:16,929 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:53:16,929 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:53:16,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:53:16,929 INFO L82 PathProgramCache]: Analyzing trace with hash 540244252, now seen corresponding path program 1 times [2018-12-09 16:53:16,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:53:16,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:53:16,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:53:16,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:53:16,931 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:53:16,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:53:17,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:53:17,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:53:17,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 16:53:17,021 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:53:17,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 16:53:17,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 16:53:17,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 16:53:17,021 INFO L87 Difference]: Start difference. First operand 92207 states and 300141 transitions. Second operand 7 states. [2018-12-09 16:53:17,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:53:17,489 INFO L93 Difference]: Finished difference Result 95869 states and 311098 transitions. [2018-12-09 16:53:17,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 16:53:17,489 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 110 [2018-12-09 16:53:17,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:53:17,631 INFO L225 Difference]: With dead ends: 95869 [2018-12-09 16:53:17,631 INFO L226 Difference]: Without dead ends: 95869 [2018-12-09 16:53:17,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-12-09 16:53:17,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95869 states. [2018-12-09 16:53:18,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95869 to 95060. [2018-12-09 16:53:18,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95060 states. [2018-12-09 16:53:19,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95060 states to 95060 states and 308849 transitions. [2018-12-09 16:53:19,110 INFO L78 Accepts]: Start accepts. Automaton has 95060 states and 308849 transitions. Word has length 110 [2018-12-09 16:53:19,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:53:19,110 INFO L480 AbstractCegarLoop]: Abstraction has 95060 states and 308849 transitions. [2018-12-09 16:53:19,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 16:53:19,111 INFO L276 IsEmpty]: Start isEmpty. Operand 95060 states and 308849 transitions. [2018-12-09 16:53:19,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-09 16:53:19,224 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:53:19,224 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:53:19,225 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:53:19,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:53:19,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1427747933, now seen corresponding path program 1 times [2018-12-09 16:53:19,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:53:19,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:53:19,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:53:19,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:53:19,226 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:53:19,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:53:19,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:53:19,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:53:19,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 16:53:19,279 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:53:19,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 16:53:19,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 16:53:19,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 16:53:19,279 INFO L87 Difference]: Start difference. First operand 95060 states and 308849 transitions. Second operand 4 states. [2018-12-09 16:53:19,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:53:19,845 INFO L93 Difference]: Finished difference Result 125838 states and 410873 transitions. [2018-12-09 16:53:19,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 16:53:19,845 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2018-12-09 16:53:19,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:53:20,052 INFO L225 Difference]: With dead ends: 125838 [2018-12-09 16:53:20,052 INFO L226 Difference]: Without dead ends: 125838 [2018-12-09 16:53:20,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 16:53:20,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125838 states. [2018-12-09 16:53:21,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125838 to 91470. [2018-12-09 16:53:21,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91470 states. [2018-12-09 16:53:21,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91470 states to 91470 states and 297317 transitions. [2018-12-09 16:53:21,641 INFO L78 Accepts]: Start accepts. Automaton has 91470 states and 297317 transitions. Word has length 110 [2018-12-09 16:53:21,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:53:21,642 INFO L480 AbstractCegarLoop]: Abstraction has 91470 states and 297317 transitions. [2018-12-09 16:53:21,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 16:53:21,642 INFO L276 IsEmpty]: Start isEmpty. Operand 91470 states and 297317 transitions. [2018-12-09 16:53:21,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-09 16:53:21,755 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:53:21,755 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:53:21,756 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:53:21,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:53:21,756 INFO L82 PathProgramCache]: Analyzing trace with hash 876666015, now seen corresponding path program 2 times [2018-12-09 16:53:21,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:53:21,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:53:21,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:53:21,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:53:21,758 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:53:21,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:53:21,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:53:21,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:53:21,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 16:53:21,814 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:53:21,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 16:53:21,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 16:53:21,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 16:53:21,814 INFO L87 Difference]: Start difference. First operand 91470 states and 297317 transitions. Second operand 5 states. [2018-12-09 16:53:22,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:53:22,320 INFO L93 Difference]: Finished difference Result 100688 states and 324688 transitions. [2018-12-09 16:53:22,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 16:53:22,320 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2018-12-09 16:53:22,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:53:22,477 INFO L225 Difference]: With dead ends: 100688 [2018-12-09 16:53:22,478 INFO L226 Difference]: Without dead ends: 100688 [2018-12-09 16:53:22,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 16:53:22,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100688 states. [2018-12-09 16:53:23,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100688 to 94485. [2018-12-09 16:53:23,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94485 states. [2018-12-09 16:53:23,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94485 states to 94485 states and 306389 transitions. [2018-12-09 16:53:23,916 INFO L78 Accepts]: Start accepts. Automaton has 94485 states and 306389 transitions. Word has length 110 [2018-12-09 16:53:23,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:53:23,917 INFO L480 AbstractCegarLoop]: Abstraction has 94485 states and 306389 transitions. [2018-12-09 16:53:23,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 16:53:23,917 INFO L276 IsEmpty]: Start isEmpty. Operand 94485 states and 306389 transitions. [2018-12-09 16:53:24,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-09 16:53:24,032 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:53:24,033 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:53:24,033 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:53:24,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:53:24,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1747743645, now seen corresponding path program 3 times [2018-12-09 16:53:24,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:53:24,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:53:24,034 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 16:53:24,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:53:24,034 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:53:24,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:53:24,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-12-09 16:53:24,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:53:24,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 16:53:24,065 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:53:24,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 16:53:24,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 16:53:24,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 16:53:24,066 INFO L87 Difference]: Start difference. First operand 94485 states and 306389 transitions. Second operand 3 states. [2018-12-09 16:53:24,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:53:24,423 INFO L93 Difference]: Finished difference Result 114425 states and 370296 transitions. [2018-12-09 16:53:24,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 16:53:24,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2018-12-09 16:53:24,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:53:24,602 INFO L225 Difference]: With dead ends: 114425 [2018-12-09 16:53:24,602 INFO L226 Difference]: Without dead ends: 114425 [2018-12-09 16:53:24,602 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-12-09 16:53:24,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114425 states. [2018-12-09 16:53:26,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114425 to 114020. [2018-12-09 16:53:26,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114020 states. [2018-12-09 16:53:26,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114020 states to 114020 states and 369112 transitions. [2018-12-09 16:53:26,292 INFO L78 Accepts]: Start accepts. Automaton has 114020 states and 369112 transitions. Word has length 110 [2018-12-09 16:53:26,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:53:26,292 INFO L480 AbstractCegarLoop]: Abstraction has 114020 states and 369112 transitions. [2018-12-09 16:53:26,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 16:53:26,293 INFO L276 IsEmpty]: Start isEmpty. Operand 114020 states and 369112 transitions. [2018-12-09 16:53:26,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-09 16:53:26,448 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:53:26,448 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:53:26,448 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:53:26,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:53:26,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1536392732, now seen corresponding path program 1 times [2018-12-09 16:53:26,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:53:26,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:53:26,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 16:53:26,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:53:26,450 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:53:26,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:53:26,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:53:26,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:53:26,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 16:53:26,520 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:53:26,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 16:53:26,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 16:53:26,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 16:53:26,521 INFO L87 Difference]: Start difference. First operand 114020 states and 369112 transitions. Second operand 6 states. [2018-12-09 16:53:27,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:53:27,274 INFO L93 Difference]: Finished difference Result 134778 states and 435595 transitions. [2018-12-09 16:53:27,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 16:53:27,275 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 110 [2018-12-09 16:53:27,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:53:27,495 INFO L225 Difference]: With dead ends: 134778 [2018-12-09 16:53:27,495 INFO L226 Difference]: Without dead ends: 134778 [2018-12-09 16:53:27,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-09 16:53:27,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134778 states. [2018-12-09 16:53:29,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134778 to 114195. [2018-12-09 16:53:29,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114195 states. [2018-12-09 16:53:29,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114195 states to 114195 states and 369627 transitions. [2018-12-09 16:53:29,269 INFO L78 Accepts]: Start accepts. Automaton has 114195 states and 369627 transitions. Word has length 110 [2018-12-09 16:53:29,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:53:29,270 INFO L480 AbstractCegarLoop]: Abstraction has 114195 states and 369627 transitions. [2018-12-09 16:53:29,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 16:53:29,270 INFO L276 IsEmpty]: Start isEmpty. Operand 114195 states and 369627 transitions. [2018-12-09 16:53:29,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-09 16:53:29,422 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:53:29,422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:53:29,422 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:53:29,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:53:29,422 INFO L82 PathProgramCache]: Analyzing trace with hash 312737698, now seen corresponding path program 1 times [2018-12-09 16:53:29,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:53:29,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:53:29,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:53:29,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:53:29,423 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:53:29,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:53:29,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:53:29,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:53:29,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 16:53:29,515 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:53:29,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 16:53:29,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 16:53:29,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-09 16:53:29,516 INFO L87 Difference]: Start difference. First operand 114195 states and 369627 transitions. Second operand 10 states. [2018-12-09 16:53:30,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:53:30,480 INFO L93 Difference]: Finished difference Result 169035 states and 544713 transitions. [2018-12-09 16:53:30,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 16:53:30,480 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 112 [2018-12-09 16:53:30,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:53:30,570 INFO L225 Difference]: With dead ends: 169035 [2018-12-09 16:53:30,570 INFO L226 Difference]: Without dead ends: 66235 [2018-12-09 16:53:30,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2018-12-09 16:53:30,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66235 states. [2018-12-09 16:53:31,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66235 to 66235. [2018-12-09 16:53:31,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66235 states. [2018-12-09 16:53:31,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66235 states to 66235 states and 205935 transitions. [2018-12-09 16:53:31,524 INFO L78 Accepts]: Start accepts. Automaton has 66235 states and 205935 transitions. Word has length 112 [2018-12-09 16:53:31,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:53:31,525 INFO L480 AbstractCegarLoop]: Abstraction has 66235 states and 205935 transitions. [2018-12-09 16:53:31,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 16:53:31,525 INFO L276 IsEmpty]: Start isEmpty. Operand 66235 states and 205935 transitions. [2018-12-09 16:53:31,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-09 16:53:31,596 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:53:31,596 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:53:31,596 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:53:31,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:53:31,596 INFO L82 PathProgramCache]: Analyzing trace with hash 207315942, now seen corresponding path program 2 times [2018-12-09 16:53:31,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:53:31,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:53:31,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:53:31,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:53:31,597 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:53:31,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:53:31,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:53:31,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:53:31,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 16:53:31,669 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:53:31,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 16:53:31,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 16:53:31,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 16:53:31,670 INFO L87 Difference]: Start difference. First operand 66235 states and 205935 transitions. Second operand 7 states. [2018-12-09 16:53:32,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:53:32,109 INFO L93 Difference]: Finished difference Result 83621 states and 261648 transitions. [2018-12-09 16:53:32,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 16:53:32,109 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 112 [2018-12-09 16:53:32,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:53:32,130 INFO L225 Difference]: With dead ends: 83621 [2018-12-09 16:53:32,130 INFO L226 Difference]: Without dead ends: 17031 [2018-12-09 16:53:32,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-12-09 16:53:32,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17031 states. [2018-12-09 16:53:32,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17031 to 17029. [2018-12-09 16:53:32,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17029 states. [2018-12-09 16:53:32,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17029 states to 17029 states and 55039 transitions. [2018-12-09 16:53:32,314 INFO L78 Accepts]: Start accepts. Automaton has 17029 states and 55039 transitions. Word has length 112 [2018-12-09 16:53:32,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:53:32,314 INFO L480 AbstractCegarLoop]: Abstraction has 17029 states and 55039 transitions. [2018-12-09 16:53:32,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 16:53:32,315 INFO L276 IsEmpty]: Start isEmpty. Operand 17029 states and 55039 transitions. [2018-12-09 16:53:32,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-09 16:53:32,331 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:53:32,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 16:53:32,331 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:53:32,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:53:32,331 INFO L82 PathProgramCache]: Analyzing trace with hash 816097090, now seen corresponding path program 1 times [2018-12-09 16:53:32,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:53:32,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:53:32,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 16:53:32,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:53:32,332 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:53:32,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:53:32,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:53:32,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:53:32,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 16:53:32,444 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:53:32,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 16:53:32,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 16:53:32,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-12-09 16:53:32,444 INFO L87 Difference]: Start difference. First operand 17029 states and 55039 transitions. Second operand 11 states. [2018-12-09 16:53:32,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:53:32,750 INFO L93 Difference]: Finished difference Result 23024 states and 73119 transitions. [2018-12-09 16:53:32,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 16:53:32,750 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 112 [2018-12-09 16:53:32,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:53:32,775 INFO L225 Difference]: With dead ends: 23024 [2018-12-09 16:53:32,776 INFO L226 Difference]: Without dead ends: 23024 [2018-12-09 16:53:32,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2018-12-09 16:53:32,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23024 states. [2018-12-09 16:53:32,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23024 to 16907. [2018-12-09 16:53:32,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16907 states. [2018-12-09 16:53:32,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16907 states to 16907 states and 54681 transitions. [2018-12-09 16:53:32,986 INFO L78 Accepts]: Start accepts. Automaton has 16907 states and 54681 transitions. Word has length 112 [2018-12-09 16:53:32,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:53:32,986 INFO L480 AbstractCegarLoop]: Abstraction has 16907 states and 54681 transitions. [2018-12-09 16:53:32,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 16:53:32,986 INFO L276 IsEmpty]: Start isEmpty. Operand 16907 states and 54681 transitions. [2018-12-09 16:53:33,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-09 16:53:33,003 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:53:33,003 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:53:33,003 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:53:33,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:53:33,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1129786526, now seen corresponding path program 3 times [2018-12-09 16:53:33,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:53:33,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:53:33,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:53:33,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:53:33,004 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:53:33,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:53:33,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:53:33,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:53:33,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-09 16:53:33,180 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:53:33,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 16:53:33,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 16:53:33,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-12-09 16:53:33,181 INFO L87 Difference]: Start difference. First operand 16907 states and 54681 transitions. Second operand 13 states. [2018-12-09 16:53:33,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:53:33,719 INFO L93 Difference]: Finished difference Result 26916 states and 85550 transitions. [2018-12-09 16:53:33,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 16:53:33,719 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 112 [2018-12-09 16:53:33,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:53:33,743 INFO L225 Difference]: With dead ends: 26916 [2018-12-09 16:53:33,744 INFO L226 Difference]: Without dead ends: 20138 [2018-12-09 16:53:33,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2018-12-09 16:53:33,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20138 states. [2018-12-09 16:53:33,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20138 to 17254. [2018-12-09 16:53:33,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17254 states. [2018-12-09 16:53:33,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17254 states to 17254 states and 55530 transitions. [2018-12-09 16:53:33,938 INFO L78 Accepts]: Start accepts. Automaton has 17254 states and 55530 transitions. Word has length 112 [2018-12-09 16:53:33,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:53:33,939 INFO L480 AbstractCegarLoop]: Abstraction has 17254 states and 55530 transitions. [2018-12-09 16:53:33,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 16:53:33,939 INFO L276 IsEmpty]: Start isEmpty. Operand 17254 states and 55530 transitions. [2018-12-09 16:53:33,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-09 16:53:33,954 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:53:33,955 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:53:33,955 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:53:33,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:53:33,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1172321924, now seen corresponding path program 4 times [2018-12-09 16:53:33,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:53:33,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:53:33,956 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 16:53:33,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:53:33,956 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:53:33,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 16:53:33,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 16:53:33,999 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 16:53:34,089 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 16:53:34,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 04:53:34 BasicIcfg [2018-12-09 16:53:34,090 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 16:53:34,090 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 16:53:34,090 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 16:53:34,090 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 16:53:34,091 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:49:03" (3/4) ... [2018-12-09 16:53:34,092 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 16:53:34,187 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_e0a31600-7ef4-45a6-b730-fd54ba9f8c82/bin-2019/utaipan/witness.graphml [2018-12-09 16:53:34,187 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 16:53:34,188 INFO L168 Benchmark]: Toolchain (without parser) took 271730.35 ms. Allocated memory was 1.0 GB in the beginning and 7.7 GB in the end (delta: 6.6 GB). Free memory was 948.1 MB in the beginning and 4.4 GB in the end (delta: -3.4 GB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. [2018-12-09 16:53:34,189 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 16:53:34,189 INFO L168 Benchmark]: CACSL2BoogieTranslator took 346.73 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -139.8 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. [2018-12-09 16:53:34,189 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.37 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 16:53:34,189 INFO L168 Benchmark]: Boogie Preprocessor took 21.51 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 16:53:34,189 INFO L168 Benchmark]: RCFGBuilder took 372.18 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.4 MB). Peak memory consumption was 58.4 MB. Max. memory is 11.5 GB. [2018-12-09 16:53:34,189 INFO L168 Benchmark]: TraceAbstraction took 270856.61 ms. Allocated memory was 1.1 GB in the beginning and 7.7 GB in the end (delta: 6.5 GB). Free memory was 1.0 GB in the beginning and 4.4 GB in the end (delta: -3.4 GB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. [2018-12-09 16:53:34,189 INFO L168 Benchmark]: Witness Printer took 96.99 ms. Allocated memory is still 7.7 GB. Free memory was 4.4 GB in the beginning and 4.4 GB in the end (delta: 65.7 MB). Peak memory consumption was 65.7 MB. Max. memory is 11.5 GB. [2018-12-09 16:53:34,190 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 346.73 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -139.8 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.37 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.51 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 372.18 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.4 MB). Peak memory consumption was 58.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 270856.61 ms. Allocated memory was 1.1 GB in the beginning and 7.7 GB in the end (delta: 6.5 GB). Free memory was 1.0 GB in the beginning and 4.4 GB in the end (delta: -3.4 GB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. * Witness Printer took 96.99 ms. Allocated memory is still 7.7 GB. Free memory was 4.4 GB in the beginning and 4.4 GB in the end (delta: 65.7 MB). Peak memory consumption was 65.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L676] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L678] -1 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0] [L680] -1 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L682] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L683] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L684] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L686] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L688] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L690] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L691] -1 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L692] -1 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L693] -1 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L694] -1 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L695] -1 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L696] -1 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L697] -1 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L698] -1 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L699] -1 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L700] -1 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L701] -1 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L702] -1 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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}] [L703] -1 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L704] -1 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L705] -1 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L706] -1 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L707] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L708] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L814] -1 pthread_t t292; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L815] FCALL, FORK -1 pthread_create(&t292, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_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] [L816] -1 pthread_t t293; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_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] [L817] FCALL, FORK -1 pthread_create(&t293, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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}, 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] [L818] -1 pthread_t t294; VAL [__unbuffered_cnt=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}, 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] [L819] FCALL, FORK -1 pthread_create(&t294, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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}, 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] [L761] 0 z$w_buff1 = z$w_buff0 [L762] 0 z$w_buff0 = 1 [L763] 0 z$w_buff1_used = z$w_buff0_used [L764] 0 z$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=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}, 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] [L766] 0 z$r_buff1_thd0 = z$r_buff0_thd0 [L767] 0 z$r_buff1_thd1 = z$r_buff0_thd1 [L768] 0 z$r_buff1_thd2 = z$r_buff0_thd2 [L769] 0 z$r_buff1_thd3 = z$r_buff0_thd3 [L770] 0 z$r_buff0_thd3 = (_Bool)1 [L773] 0 weak$$choice0 = __VERIFIER_nondet_pointer() [L774] 0 weak$$choice2 = __VERIFIER_nondet_pointer() [L775] 0 z$flush_delayed = weak$$choice2 [L776] 0 z$mem_tmp = z VAL [__unbuffered_cnt=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, 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] [L777] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, 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] [L777] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1 VAL [__unbuffered_cnt=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, 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] [L777] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, 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] [L777] 0 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L778] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, z=1, 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] [L778] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L779] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, z=1, 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] [L779] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L780] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, z=1, 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] [L780] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L781] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, z=1, 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] [L781] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L782] EXPR 0 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) VAL [__unbuffered_cnt=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, z=1, 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] [L782] 0 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L783] EXPR 0 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, z=1, 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] [L783] 0 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L784] 0 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, z=1, 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] [L785] EXPR 0 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, z=1, 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] [L785] 0 z = z$flush_delayed ? z$mem_tmp : z [L786] 0 z$flush_delayed = (_Bool)0 [L789] 0 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, 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] [L792] 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_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, 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] [L712] 1 a = 1 [L715] 1 x = 1 [L720] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, 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] [L727] 2 x = 2 [L730] 2 y = 1 [L733] 2 __unbuffered_p1_EAX = y [L736] 2 weak$$choice0 = __VERIFIER_nondet_pointer() [L737] 2 weak$$choice2 = __VERIFIER_nondet_pointer() [L738] 2 z$flush_delayed = weak$$choice2 [L739] 2 z$mem_tmp = z VAL [__unbuffered_cnt=1, __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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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] [L740] 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_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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] [L792] 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) [L793] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=1, __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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=1, 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] [L793] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L794] 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 [!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_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=1, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L740] 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) [L741] 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_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}, 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=2, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L741] 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)) [L742] 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_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}, 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=2, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L742] 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)) [L743] 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_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}, 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))=0, x=2, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L743] 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)) [L744] 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_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}, 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=2, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L794] 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 [L795] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 VAL [__unbuffered_cnt=1, __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}, 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=2, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L795] 0 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L796] 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=1, __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}, 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=2, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 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 [L799] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __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}, 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=2, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L744] 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)) [L745] 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=2, __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}, 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=2, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L745] 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)) [L746] 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=2, __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}, 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=2, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L746] 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)) [L747] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=2, __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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L748] EXPR 2 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=2, __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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L748] 2 z = z$flush_delayed ? z$mem_tmp : z [L749] 2 z$flush_delayed = (_Bool)0 [L754] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __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}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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] [L825] 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_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}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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] [L825] EXPR -1 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z VAL [__unbuffered_cnt=3, __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}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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] [L825] 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_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}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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] [L825] -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) [L826] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=3, __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}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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] [L826] -1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L827] 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_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}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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] [L827] -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 [L828] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 VAL [__unbuffered_cnt=3, __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}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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] [L828] -1 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L829] 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_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}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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] [L829] -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 [L832] -1 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __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}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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_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}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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_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}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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, 304 locations, 3 error locations. UNSAFE Result, 270.7s OverallTime, 25 OverallIterations, 1 TraceHistogramMax, 40.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8416 SDtfs, 10373 SDslu, 21625 SDs, 0 SdLazy, 6930 SolverSat, 431 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 250 GetRequests, 64 SyntacticMatches, 21 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=445146occurred in iteration=0, 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: 60.1s AutomataMinimizationTime, 24 MinimizatonAttempts, 445446 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 2332 NumberOfCodeBlocks, 2332 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 2196 ConstructedInterpolants, 0 QuantifiedInterpolants, 490217 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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...