./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi007_pso.oepc_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_e3ce3981-08c9-425c-95a2-3c793bef46f8/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e3ce3981-08c9-425c-95a2-3c793bef46f8/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e3ce3981-08c9-425c-95a2-3c793bef46f8/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e3ce3981-08c9-425c-95a2-3c793bef46f8/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi007_pso.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_e3ce3981-08c9-425c-95a2-3c793bef46f8/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e3ce3981-08c9-425c-95a2-3c793bef46f8/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 a30a75099bfc7085c3bb0db7d9c1b74b69a69eff ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-08 16:40:55,828 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 16:40:55,829 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 16:40:55,835 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 16:40:55,835 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 16:40:55,836 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 16:40:55,836 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 16:40:55,837 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 16:40:55,838 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 16:40:55,838 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 16:40:55,839 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 16:40:55,839 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 16:40:55,839 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 16:40:55,840 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 16:40:55,840 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 16:40:55,841 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 16:40:55,841 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 16:40:55,842 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 16:40:55,843 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 16:40:55,844 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 16:40:55,844 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 16:40:55,845 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 16:40:55,846 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 16:40:55,846 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 16:40:55,846 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 16:40:55,846 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 16:40:55,847 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 16:40:55,847 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 16:40:55,848 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 16:40:55,848 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 16:40:55,848 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 16:40:55,849 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 16:40:55,849 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 16:40:55,849 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 16:40:55,849 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 16:40:55,850 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 16:40:55,850 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e3ce3981-08c9-425c-95a2-3c793bef46f8/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-08 16:40:55,857 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 16:40:55,857 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 16:40:55,858 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 16:40:55,858 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 16:40:55,858 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-08 16:40:55,858 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-08 16:40:55,858 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-08 16:40:55,858 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-08 16:40:55,858 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-08 16:40:55,858 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-08 16:40:55,858 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-08 16:40:55,858 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-08 16:40:55,859 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-08 16:40:55,859 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 16:40:55,859 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 16:40:55,859 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 16:40:55,859 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 16:40:55,859 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 16:40:55,859 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 16:40:55,859 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 16:40:55,859 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 16:40:55,860 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 16:40:55,860 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 16:40:55,860 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 16:40:55,860 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 16:40:55,860 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 16:40:55,860 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 16:40:55,860 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 16:40:55,860 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 16:40:55,860 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 16:40:55,860 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 16:40:55,860 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 16:40:55,861 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-08 16:40:55,861 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 16:40:55,861 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 16:40:55,861 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-08 16:40:55,861 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_e3ce3981-08c9-425c-95a2-3c793bef46f8/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 -> a30a75099bfc7085c3bb0db7d9c1b74b69a69eff [2018-12-08 16:40:55,877 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 16:40:55,884 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 16:40:55,886 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 16:40:55,887 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 16:40:55,887 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 16:40:55,887 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e3ce3981-08c9-425c-95a2-3c793bef46f8/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/rfi007_pso.oepc_false-unreach-call.i [2018-12-08 16:40:55,921 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e3ce3981-08c9-425c-95a2-3c793bef46f8/bin-2019/utaipan/data/3167157db/883c6e8fda424452afe18ac01dcb26ed/FLAG1866dbd51 [2018-12-08 16:40:56,330 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 16:40:56,330 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e3ce3981-08c9-425c-95a2-3c793bef46f8/sv-benchmarks/c/pthread-wmm/rfi007_pso.oepc_false-unreach-call.i [2018-12-08 16:40:56,337 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e3ce3981-08c9-425c-95a2-3c793bef46f8/bin-2019/utaipan/data/3167157db/883c6e8fda424452afe18ac01dcb26ed/FLAG1866dbd51 [2018-12-08 16:40:56,345 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e3ce3981-08c9-425c-95a2-3c793bef46f8/bin-2019/utaipan/data/3167157db/883c6e8fda424452afe18ac01dcb26ed [2018-12-08 16:40:56,347 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 16:40:56,348 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 16:40:56,349 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 16:40:56,349 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 16:40:56,351 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 16:40:56,351 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 04:40:56" (1/1) ... [2018-12-08 16:40:56,353 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@201b218f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:40:56, skipping insertion in model container [2018-12-08 16:40:56,353 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 04:40:56" (1/1) ... [2018-12-08 16:40:56,357 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 16:40:56,378 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 16:40:56,565 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 16:40:56,575 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 16:40:56,674 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 16:40:56,719 INFO L195 MainTranslator]: Completed translation [2018-12-08 16:40:56,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:40:56 WrapperNode [2018-12-08 16:40:56,720 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 16:40:56,720 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 16:40:56,720 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 16:40:56,720 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 16:40:56,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:40:56" (1/1) ... [2018-12-08 16:40:56,735 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:40:56" (1/1) ... [2018-12-08 16:40:56,750 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 16:40:56,750 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 16:40:56,751 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 16:40:56,751 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 16:40:56,757 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:40:56" (1/1) ... [2018-12-08 16:40:56,757 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:40:56" (1/1) ... [2018-12-08 16:40:56,759 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:40:56" (1/1) ... [2018-12-08 16:40:56,760 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:40:56" (1/1) ... [2018-12-08 16:40:56,765 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:40:56" (1/1) ... [2018-12-08 16:40:56,767 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:40:56" (1/1) ... [2018-12-08 16:40:56,769 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:40:56" (1/1) ... [2018-12-08 16:40:56,770 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 16:40:56,771 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 16:40:56,771 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 16:40:56,771 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 16:40:56,771 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:40:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e3ce3981-08c9-425c-95a2-3c793bef46f8/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-08 16:40:56,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 16:40:56,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 16:40:56,803 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-08 16:40:56,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 16:40:56,804 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-08 16:40:56,804 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-08 16:40:56,804 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-08 16:40:56,804 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-08 16:40:56,804 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-08 16:40:56,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 16:40:56,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 16:40:56,805 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-08 16:40:57,095 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 16:40:57,095 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-08 16:40:57,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 04:40:57 BoogieIcfgContainer [2018-12-08 16:40:57,096 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 16:40:57,096 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 16:40:57,096 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 16:40:57,098 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 16:40:57,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 04:40:56" (1/3) ... [2018-12-08 16:40:57,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36b98844 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 04:40:57, skipping insertion in model container [2018-12-08 16:40:57,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:40:56" (2/3) ... [2018-12-08 16:40:57,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36b98844 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 04:40:57, skipping insertion in model container [2018-12-08 16:40:57,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 04:40:57" (3/3) ... [2018-12-08 16:40:57,100 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi007_pso.oepc_false-unreach-call.i [2018-12-08 16:40:57,122 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,123 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,123 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,123 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,123 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,123 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,123 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,123 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,124 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,124 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,124 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,124 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,124 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,124 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,124 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,124 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,124 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,125 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,125 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,125 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,125 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,125 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,125 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,125 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,125 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,125 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,125 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,126 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,126 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,126 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,126 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,126 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,126 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,126 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,126 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,126 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,126 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,126 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,127 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,127 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,127 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,127 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,127 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,127 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,127 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,127 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,127 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,128 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,128 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,128 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,128 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,128 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,128 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,128 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,128 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,128 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,128 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,129 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,129 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,129 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,129 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,129 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,129 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,129 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,129 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,129 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,129 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,130 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,130 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,130 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,130 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,130 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,130 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,130 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,130 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,130 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,130 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,130 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,131 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,131 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,131 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,131 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,131 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,131 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,131 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,131 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,131 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,131 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,131 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,132 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,132 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,132 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,132 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,132 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,132 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,132 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,132 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,132 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,132 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,132 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,133 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,133 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,133 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,133 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,133 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,133 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,133 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,133 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,133 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,133 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,133 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,134 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,134 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,134 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,134 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,134 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,134 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,134 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,134 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,134 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,134 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,134 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,134 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,135 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,135 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,135 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,135 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,135 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,135 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,135 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,135 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,135 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,135 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,135 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,136 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,136 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,136 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,136 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,136 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,136 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,136 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,136 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,136 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,136 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,136 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,136 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,137 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,137 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,137 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,137 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,137 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,137 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,137 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,137 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,137 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,137 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,137 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,138 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,138 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,138 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,138 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,138 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,138 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,138 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 16:40:57,141 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-08 16:40:57,141 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 16:40:57,146 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-08 16:40:57,155 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-08 16:40:57,171 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 16:40:57,171 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 16:40:57,171 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 16:40:57,171 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 16:40:57,171 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 16:40:57,171 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 16:40:57,171 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 16:40:57,171 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 16:40:57,178 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 142places, 180 transitions [2018-12-08 16:40:58,718 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34806 states. [2018-12-08 16:40:58,719 INFO L276 IsEmpty]: Start isEmpty. Operand 34806 states. [2018-12-08 16:40:58,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-08 16:40:58,724 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:40:58,724 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] [2018-12-08 16:40:58,726 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:40:58,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:40:58,730 INFO L82 PathProgramCache]: Analyzing trace with hash 829463542, now seen corresponding path program 1 times [2018-12-08 16:40:58,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:40:58,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:40:58,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:40:58,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:40:58,767 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:40:58,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:40:58,889 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-08 16:40:58,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:40:58,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 16:40:58,891 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:40:58,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 16:40:58,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 16:40:58,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 16:40:58,905 INFO L87 Difference]: Start difference. First operand 34806 states. Second operand 4 states. [2018-12-08 16:40:59,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:40:59,430 INFO L93 Difference]: Finished difference Result 60790 states and 234493 transitions. [2018-12-08 16:40:59,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 16:40:59,431 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-12-08 16:40:59,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:40:59,583 INFO L225 Difference]: With dead ends: 60790 [2018-12-08 16:40:59,583 INFO L226 Difference]: Without dead ends: 44270 [2018-12-08 16:40:59,584 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-08 16:40:59,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44270 states. [2018-12-08 16:41:00,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44270 to 27338. [2018-12-08 16:41:00,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27338 states. [2018-12-08 16:41:00,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27338 states to 27338 states and 105499 transitions. [2018-12-08 16:41:00,338 INFO L78 Accepts]: Start accepts. Automaton has 27338 states and 105499 transitions. Word has length 33 [2018-12-08 16:41:00,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:41:00,338 INFO L480 AbstractCegarLoop]: Abstraction has 27338 states and 105499 transitions. [2018-12-08 16:41:00,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 16:41:00,338 INFO L276 IsEmpty]: Start isEmpty. Operand 27338 states and 105499 transitions. [2018-12-08 16:41:00,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-08 16:41:00,342 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:41:00,342 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] [2018-12-08 16:41:00,343 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:41:00,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:41:00,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1614500037, now seen corresponding path program 1 times [2018-12-08 16:41:00,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:41:00,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:00,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:41:00,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:00,346 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:41:00,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:41:00,389 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-08 16:41:00,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:41:00,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 16:41:00,389 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:41:00,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 16:41:00,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 16:41:00,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 16:41:00,390 INFO L87 Difference]: Start difference. First operand 27338 states and 105499 transitions. Second operand 4 states. [2018-12-08 16:41:00,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:41:00,457 INFO L93 Difference]: Finished difference Result 8528 states and 28344 transitions. [2018-12-08 16:41:00,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 16:41:00,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-12-08 16:41:00,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:41:00,472 INFO L225 Difference]: With dead ends: 8528 [2018-12-08 16:41:00,472 INFO L226 Difference]: Without dead ends: 7466 [2018-12-08 16:41:00,473 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-08 16:41:00,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7466 states. [2018-12-08 16:41:00,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7466 to 7466. [2018-12-08 16:41:00,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7466 states. [2018-12-08 16:41:00,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7466 states to 7466 states and 24636 transitions. [2018-12-08 16:41:00,559 INFO L78 Accepts]: Start accepts. Automaton has 7466 states and 24636 transitions. Word has length 45 [2018-12-08 16:41:00,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:41:00,560 INFO L480 AbstractCegarLoop]: Abstraction has 7466 states and 24636 transitions. [2018-12-08 16:41:00,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 16:41:00,560 INFO L276 IsEmpty]: Start isEmpty. Operand 7466 states and 24636 transitions. [2018-12-08 16:41:00,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-08 16:41:00,561 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:41:00,561 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] [2018-12-08 16:41:00,561 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:41:00,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:41:00,562 INFO L82 PathProgramCache]: Analyzing trace with hash 2087909407, now seen corresponding path program 1 times [2018-12-08 16:41:00,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:41:00,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:00,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:41:00,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:00,565 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:41:00,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:41:00,609 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-08 16:41:00,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:41:00,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 16:41:00,609 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:41:00,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 16:41:00,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 16:41:00,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 16:41:00,610 INFO L87 Difference]: Start difference. First operand 7466 states and 24636 transitions. Second operand 5 states. [2018-12-08 16:41:00,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:41:00,849 INFO L93 Difference]: Finished difference Result 13998 states and 45805 transitions. [2018-12-08 16:41:00,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 16:41:00,850 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-08 16:41:00,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:41:00,887 INFO L225 Difference]: With dead ends: 13998 [2018-12-08 16:41:00,887 INFO L226 Difference]: Without dead ends: 13930 [2018-12-08 16:41:00,888 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-08 16:41:00,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13930 states. [2018-12-08 16:41:01,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13930 to 9441. [2018-12-08 16:41:01,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9441 states. [2018-12-08 16:41:01,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9441 states to 9441 states and 30542 transitions. [2018-12-08 16:41:01,090 INFO L78 Accepts]: Start accepts. Automaton has 9441 states and 30542 transitions. Word has length 46 [2018-12-08 16:41:01,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:41:01,091 INFO L480 AbstractCegarLoop]: Abstraction has 9441 states and 30542 transitions. [2018-12-08 16:41:01,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 16:41:01,091 INFO L276 IsEmpty]: Start isEmpty. Operand 9441 states and 30542 transitions. [2018-12-08 16:41:01,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-08 16:41:01,092 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:41:01,092 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] [2018-12-08 16:41:01,092 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:41:01,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:41:01,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1703396709, now seen corresponding path program 1 times [2018-12-08 16:41:01,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:41:01,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:01,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:41:01,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:01,094 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:41:01,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:41:01,117 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-08 16:41:01,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:41:01,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 16:41:01,117 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:41:01,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 16:41:01,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 16:41:01,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:41:01,118 INFO L87 Difference]: Start difference. First operand 9441 states and 30542 transitions. Second operand 3 states. [2018-12-08 16:41:01,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:41:01,176 INFO L93 Difference]: Finished difference Result 13279 states and 42641 transitions. [2018-12-08 16:41:01,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 16:41:01,177 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-12-08 16:41:01,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:41:01,193 INFO L225 Difference]: With dead ends: 13279 [2018-12-08 16:41:01,193 INFO L226 Difference]: Without dead ends: 13279 [2018-12-08 16:41:01,194 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-08 16:41:01,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13279 states. [2018-12-08 16:41:01,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13279 to 9845. [2018-12-08 16:41:01,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9845 states. [2018-12-08 16:41:01,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9845 states to 9845 states and 31508 transitions. [2018-12-08 16:41:01,316 INFO L78 Accepts]: Start accepts. Automaton has 9845 states and 31508 transitions. Word has length 48 [2018-12-08 16:41:01,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:41:01,317 INFO L480 AbstractCegarLoop]: Abstraction has 9845 states and 31508 transitions. [2018-12-08 16:41:01,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 16:41:01,317 INFO L276 IsEmpty]: Start isEmpty. Operand 9845 states and 31508 transitions. [2018-12-08 16:41:01,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-08 16:41:01,318 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:41:01,318 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] [2018-12-08 16:41:01,318 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:41:01,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:41:01,319 INFO L82 PathProgramCache]: Analyzing trace with hash -778746896, now seen corresponding path program 1 times [2018-12-08 16:41:01,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:41:01,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:01,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:41:01,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:01,320 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:41:01,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:41:01,395 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-08 16:41:01,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:41:01,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 16:41:01,396 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:41:01,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 16:41:01,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 16:41:01,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 16:41:01,396 INFO L87 Difference]: Start difference. First operand 9845 states and 31508 transitions. Second operand 7 states. [2018-12-08 16:41:01,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:41:01,801 INFO L93 Difference]: Finished difference Result 12285 states and 38673 transitions. [2018-12-08 16:41:01,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 16:41:01,802 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2018-12-08 16:41:01,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:41:01,815 INFO L225 Difference]: With dead ends: 12285 [2018-12-08 16:41:01,815 INFO L226 Difference]: Without dead ends: 12213 [2018-12-08 16:41:01,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-12-08 16:41:01,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12213 states. [2018-12-08 16:41:01,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12213 to 10849. [2018-12-08 16:41:01,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10849 states. [2018-12-08 16:41:01,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10849 states to 10849 states and 34563 transitions. [2018-12-08 16:41:01,927 INFO L78 Accepts]: Start accepts. Automaton has 10849 states and 34563 transitions. Word has length 52 [2018-12-08 16:41:01,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:41:01,927 INFO L480 AbstractCegarLoop]: Abstraction has 10849 states and 34563 transitions. [2018-12-08 16:41:01,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 16:41:01,927 INFO L276 IsEmpty]: Start isEmpty. Operand 10849 states and 34563 transitions. [2018-12-08 16:41:01,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-08 16:41:01,930 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:41:01,930 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:41:01,930 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:41:01,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:41:01,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1619956916, now seen corresponding path program 1 times [2018-12-08 16:41:01,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:41:01,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:01,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:41:01,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:01,932 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:41:01,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:41:01,985 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-08 16:41:01,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:41:01,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 16:41:01,985 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:41:01,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 16:41:01,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 16:41:01,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 16:41:01,986 INFO L87 Difference]: Start difference. First operand 10849 states and 34563 transitions. Second operand 4 states. [2018-12-08 16:41:02,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:41:02,055 INFO L93 Difference]: Finished difference Result 12396 states and 39572 transitions. [2018-12-08 16:41:02,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 16:41:02,056 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-12-08 16:41:02,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:41:02,069 INFO L225 Difference]: With dead ends: 12396 [2018-12-08 16:41:02,069 INFO L226 Difference]: Without dead ends: 12396 [2018-12-08 16:41:02,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 16:41:02,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12396 states. [2018-12-08 16:41:02,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12396 to 11369. [2018-12-08 16:41:02,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11369 states. [2018-12-08 16:41:02,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11369 states to 11369 states and 36236 transitions. [2018-12-08 16:41:02,204 INFO L78 Accepts]: Start accepts. Automaton has 11369 states and 36236 transitions. Word has length 60 [2018-12-08 16:41:02,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:41:02,204 INFO L480 AbstractCegarLoop]: Abstraction has 11369 states and 36236 transitions. [2018-12-08 16:41:02,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 16:41:02,204 INFO L276 IsEmpty]: Start isEmpty. Operand 11369 states and 36236 transitions. [2018-12-08 16:41:02,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-08 16:41:02,207 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:41:02,207 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:41:02,207 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:41:02,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:41:02,208 INFO L82 PathProgramCache]: Analyzing trace with hash 122853419, now seen corresponding path program 1 times [2018-12-08 16:41:02,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:41:02,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:02,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:41:02,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:02,209 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:41:02,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:41:02,267 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-08 16:41:02,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:41:02,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 16:41:02,267 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:41:02,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 16:41:02,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 16:41:02,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 16:41:02,268 INFO L87 Difference]: Start difference. First operand 11369 states and 36236 transitions. Second operand 6 states. [2018-12-08 16:41:02,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:41:02,605 INFO L93 Difference]: Finished difference Result 20969 states and 66486 transitions. [2018-12-08 16:41:02,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 16:41:02,605 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2018-12-08 16:41:02,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:41:02,627 INFO L225 Difference]: With dead ends: 20969 [2018-12-08 16:41:02,627 INFO L226 Difference]: Without dead ends: 20898 [2018-12-08 16:41:02,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-08 16:41:02,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20898 states. [2018-12-08 16:41:02,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20898 to 13755. [2018-12-08 16:41:02,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13755 states. [2018-12-08 16:41:02,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13755 states to 13755 states and 43280 transitions. [2018-12-08 16:41:02,803 INFO L78 Accepts]: Start accepts. Automaton has 13755 states and 43280 transitions. Word has length 60 [2018-12-08 16:41:02,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:41:02,803 INFO L480 AbstractCegarLoop]: Abstraction has 13755 states and 43280 transitions. [2018-12-08 16:41:02,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 16:41:02,803 INFO L276 IsEmpty]: Start isEmpty. Operand 13755 states and 43280 transitions. [2018-12-08 16:41:02,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-08 16:41:02,807 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:41:02,807 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:41:02,807 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:41:02,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:41:02,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1900874254, now seen corresponding path program 1 times [2018-12-08 16:41:02,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:41:02,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:02,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:41:02,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:02,809 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:41:02,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:41:02,848 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-08 16:41:02,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:41:02,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 16:41:02,848 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:41:02,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 16:41:02,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 16:41:02,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 16:41:02,849 INFO L87 Difference]: Start difference. First operand 13755 states and 43280 transitions. Second operand 4 states. [2018-12-08 16:41:03,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:41:03,120 INFO L93 Difference]: Finished difference Result 23352 states and 74493 transitions. [2018-12-08 16:41:03,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 16:41:03,121 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-08 16:41:03,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:41:03,146 INFO L225 Difference]: With dead ends: 23352 [2018-12-08 16:41:03,146 INFO L226 Difference]: Without dead ends: 23352 [2018-12-08 16:41:03,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 16:41:03,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23352 states. [2018-12-08 16:41:03,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23352 to 14523. [2018-12-08 16:41:03,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14523 states. [2018-12-08 16:41:03,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14523 states to 14523 states and 45664 transitions. [2018-12-08 16:41:03,330 INFO L78 Accepts]: Start accepts. Automaton has 14523 states and 45664 transitions. Word has length 64 [2018-12-08 16:41:03,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:41:03,331 INFO L480 AbstractCegarLoop]: Abstraction has 14523 states and 45664 transitions. [2018-12-08 16:41:03,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 16:41:03,331 INFO L276 IsEmpty]: Start isEmpty. Operand 14523 states and 45664 transitions. [2018-12-08 16:41:03,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-08 16:41:03,334 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:41:03,334 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:41:03,334 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:41:03,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:41:03,335 INFO L82 PathProgramCache]: Analyzing trace with hash -2100690035, now seen corresponding path program 1 times [2018-12-08 16:41:03,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:41:03,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:03,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:41:03,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:03,336 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:41:03,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:41:03,376 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-08 16:41:03,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:41:03,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 16:41:03,377 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:41:03,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 16:41:03,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 16:41:03,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 16:41:03,377 INFO L87 Difference]: Start difference. First operand 14523 states and 45664 transitions. Second operand 4 states. [2018-12-08 16:41:03,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:41:03,563 INFO L93 Difference]: Finished difference Result 18411 states and 56991 transitions. [2018-12-08 16:41:03,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 16:41:03,563 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-08 16:41:03,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:41:03,582 INFO L225 Difference]: With dead ends: 18411 [2018-12-08 16:41:03,582 INFO L226 Difference]: Without dead ends: 18411 [2018-12-08 16:41:03,582 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-08 16:41:03,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18411 states. [2018-12-08 16:41:03,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18411 to 16569. [2018-12-08 16:41:03,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16569 states. [2018-12-08 16:41:03,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16569 states to 16569 states and 51537 transitions. [2018-12-08 16:41:03,813 INFO L78 Accepts]: Start accepts. Automaton has 16569 states and 51537 transitions. Word has length 64 [2018-12-08 16:41:03,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:41:03,813 INFO L480 AbstractCegarLoop]: Abstraction has 16569 states and 51537 transitions. [2018-12-08 16:41:03,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 16:41:03,813 INFO L276 IsEmpty]: Start isEmpty. Operand 16569 states and 51537 transitions. [2018-12-08 16:41:03,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-08 16:41:03,818 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:41:03,819 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:41:03,819 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:41:03,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:41:03,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1059723442, now seen corresponding path program 1 times [2018-12-08 16:41:03,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:41:03,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:03,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:41:03,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:03,821 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:41:03,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:41:03,849 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-08 16:41:03,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:41:03,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 16:41:03,849 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:41:03,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 16:41:03,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 16:41:03,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:41:03,850 INFO L87 Difference]: Start difference. First operand 16569 states and 51537 transitions. Second operand 3 states. [2018-12-08 16:41:03,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:41:03,996 INFO L93 Difference]: Finished difference Result 17193 states and 53232 transitions. [2018-12-08 16:41:03,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 16:41:03,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2018-12-08 16:41:03,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:41:04,014 INFO L225 Difference]: With dead ends: 17193 [2018-12-08 16:41:04,014 INFO L226 Difference]: Without dead ends: 17193 [2018-12-08 16:41:04,014 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-08 16:41:04,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17193 states. [2018-12-08 16:41:04,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17193 to 16901. [2018-12-08 16:41:04,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16901 states. [2018-12-08 16:41:04,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16901 states to 16901 states and 52431 transitions. [2018-12-08 16:41:04,178 INFO L78 Accepts]: Start accepts. Automaton has 16901 states and 52431 transitions. Word has length 64 [2018-12-08 16:41:04,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:41:04,178 INFO L480 AbstractCegarLoop]: Abstraction has 16901 states and 52431 transitions. [2018-12-08 16:41:04,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 16:41:04,178 INFO L276 IsEmpty]: Start isEmpty. Operand 16901 states and 52431 transitions. [2018-12-08 16:41:04,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-08 16:41:04,184 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:41:04,184 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] [2018-12-08 16:41:04,184 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:41:04,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:41:04,184 INFO L82 PathProgramCache]: Analyzing trace with hash 380916983, now seen corresponding path program 1 times [2018-12-08 16:41:04,184 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:41:04,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:04,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:41:04,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:04,185 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:41:04,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:41:04,239 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-08 16:41:04,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:41:04,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 16:41:04,239 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:41:04,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 16:41:04,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 16:41:04,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-08 16:41:04,240 INFO L87 Difference]: Start difference. First operand 16901 states and 52431 transitions. Second operand 6 states. [2018-12-08 16:41:04,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:41:04,852 INFO L93 Difference]: Finished difference Result 20789 states and 63395 transitions. [2018-12-08 16:41:04,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 16:41:04,853 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-12-08 16:41:04,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:41:04,873 INFO L225 Difference]: With dead ends: 20789 [2018-12-08 16:41:04,873 INFO L226 Difference]: Without dead ends: 20789 [2018-12-08 16:41:04,874 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-08 16:41:04,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20789 states. [2018-12-08 16:41:05,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20789 to 19521. [2018-12-08 16:41:05,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19521 states. [2018-12-08 16:41:05,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19521 states to 19521 states and 60007 transitions. [2018-12-08 16:41:05,069 INFO L78 Accepts]: Start accepts. Automaton has 19521 states and 60007 transitions. Word has length 66 [2018-12-08 16:41:05,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:41:05,070 INFO L480 AbstractCegarLoop]: Abstraction has 19521 states and 60007 transitions. [2018-12-08 16:41:05,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 16:41:05,070 INFO L276 IsEmpty]: Start isEmpty. Operand 19521 states and 60007 transitions. [2018-12-08 16:41:05,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-08 16:41:05,076 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:41:05,076 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] [2018-12-08 16:41:05,076 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:41:05,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:41:05,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1342531000, now seen corresponding path program 1 times [2018-12-08 16:41:05,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:41:05,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:05,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:41:05,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:05,078 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:41:05,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:41:05,137 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-08 16:41:05,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:41:05,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 16:41:05,137 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:41:05,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 16:41:05,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 16:41:05,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 16:41:05,137 INFO L87 Difference]: Start difference. First operand 19521 states and 60007 transitions. Second operand 6 states. [2018-12-08 16:41:05,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:41:05,426 INFO L93 Difference]: Finished difference Result 22441 states and 66578 transitions. [2018-12-08 16:41:05,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 16:41:05,427 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-12-08 16:41:05,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:41:05,449 INFO L225 Difference]: With dead ends: 22441 [2018-12-08 16:41:05,449 INFO L226 Difference]: Without dead ends: 22441 [2018-12-08 16:41:05,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-08 16:41:05,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22441 states. [2018-12-08 16:41:05,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22441 to 20085. [2018-12-08 16:41:05,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20085 states. [2018-12-08 16:41:05,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20085 states to 20085 states and 60622 transitions. [2018-12-08 16:41:05,704 INFO L78 Accepts]: Start accepts. Automaton has 20085 states and 60622 transitions. Word has length 66 [2018-12-08 16:41:05,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:41:05,704 INFO L480 AbstractCegarLoop]: Abstraction has 20085 states and 60622 transitions. [2018-12-08 16:41:05,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 16:41:05,704 INFO L276 IsEmpty]: Start isEmpty. Operand 20085 states and 60622 transitions. [2018-12-08 16:41:05,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-08 16:41:05,711 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:41:05,711 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] [2018-12-08 16:41:05,711 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:41:05,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:41:05,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1707671815, now seen corresponding path program 1 times [2018-12-08 16:41:05,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:41:05,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:05,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:41:05,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:05,712 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:41:05,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:41:05,768 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-08 16:41:05,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:41:05,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 16:41:05,769 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:41:05,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 16:41:05,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 16:41:05,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 16:41:05,769 INFO L87 Difference]: Start difference. First operand 20085 states and 60622 transitions. Second operand 5 states. [2018-12-08 16:41:05,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:41:05,980 INFO L93 Difference]: Finished difference Result 26432 states and 79262 transitions. [2018-12-08 16:41:05,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 16:41:05,980 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-12-08 16:41:05,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:41:06,009 INFO L225 Difference]: With dead ends: 26432 [2018-12-08 16:41:06,009 INFO L226 Difference]: Without dead ends: 26432 [2018-12-08 16:41:06,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-08 16:41:06,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26432 states. [2018-12-08 16:41:06,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26432 to 23813. [2018-12-08 16:41:06,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23813 states. [2018-12-08 16:41:06,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23813 states to 23813 states and 71372 transitions. [2018-12-08 16:41:06,266 INFO L78 Accepts]: Start accepts. Automaton has 23813 states and 71372 transitions. Word has length 66 [2018-12-08 16:41:06,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:41:06,266 INFO L480 AbstractCegarLoop]: Abstraction has 23813 states and 71372 transitions. [2018-12-08 16:41:06,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 16:41:06,266 INFO L276 IsEmpty]: Start isEmpty. Operand 23813 states and 71372 transitions. [2018-12-08 16:41:06,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-08 16:41:06,274 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:41:06,274 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] [2018-12-08 16:41:06,274 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:41:06,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:41:06,275 INFO L82 PathProgramCache]: Analyzing trace with hash 2076761304, now seen corresponding path program 1 times [2018-12-08 16:41:06,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:41:06,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:06,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:41:06,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:06,276 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:41:06,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:41:06,316 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-08 16:41:06,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:41:06,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 16:41:06,317 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:41:06,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 16:41:06,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 16:41:06,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 16:41:06,318 INFO L87 Difference]: Start difference. First operand 23813 states and 71372 transitions. Second operand 5 states. [2018-12-08 16:41:06,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:41:06,638 INFO L93 Difference]: Finished difference Result 33063 states and 98211 transitions. [2018-12-08 16:41:06,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 16:41:06,639 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-12-08 16:41:06,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:41:06,673 INFO L225 Difference]: With dead ends: 33063 [2018-12-08 16:41:06,673 INFO L226 Difference]: Without dead ends: 33063 [2018-12-08 16:41:06,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 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-08 16:41:06,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33063 states. [2018-12-08 16:41:06,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33063 to 29343. [2018-12-08 16:41:06,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29343 states. [2018-12-08 16:41:06,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29343 states to 29343 states and 87599 transitions. [2018-12-08 16:41:06,985 INFO L78 Accepts]: Start accepts. Automaton has 29343 states and 87599 transitions. Word has length 66 [2018-12-08 16:41:06,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:41:06,985 INFO L480 AbstractCegarLoop]: Abstraction has 29343 states and 87599 transitions. [2018-12-08 16:41:06,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 16:41:06,985 INFO L276 IsEmpty]: Start isEmpty. Operand 29343 states and 87599 transitions. [2018-12-08 16:41:06,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-08 16:41:06,993 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:41:06,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, 1, 1, 1, 1] [2018-12-08 16:41:06,993 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:41:06,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:41:06,993 INFO L82 PathProgramCache]: Analyzing trace with hash 269306841, now seen corresponding path program 1 times [2018-12-08 16:41:06,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:41:06,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:06,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:41:06,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:06,995 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:41:07,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:41:07,047 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-08 16:41:07,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:41:07,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 16:41:07,047 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:41:07,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 16:41:07,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 16:41:07,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 16:41:07,048 INFO L87 Difference]: Start difference. First operand 29343 states and 87599 transitions. Second operand 5 states. [2018-12-08 16:41:07,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:41:07,088 INFO L93 Difference]: Finished difference Result 9075 states and 21914 transitions. [2018-12-08 16:41:07,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 16:41:07,088 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-12-08 16:41:07,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:41:07,094 INFO L225 Difference]: With dead ends: 9075 [2018-12-08 16:41:07,094 INFO L226 Difference]: Without dead ends: 7223 [2018-12-08 16:41:07,094 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-08 16:41:07,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7223 states. [2018-12-08 16:41:07,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7223 to 6120. [2018-12-08 16:41:07,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6120 states. [2018-12-08 16:41:07,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6120 states to 6120 states and 14385 transitions. [2018-12-08 16:41:07,144 INFO L78 Accepts]: Start accepts. Automaton has 6120 states and 14385 transitions. Word has length 66 [2018-12-08 16:41:07,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:41:07,145 INFO L480 AbstractCegarLoop]: Abstraction has 6120 states and 14385 transitions. [2018-12-08 16:41:07,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 16:41:07,145 INFO L276 IsEmpty]: Start isEmpty. Operand 6120 states and 14385 transitions. [2018-12-08 16:41:07,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-08 16:41:07,148 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:41:07,148 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] [2018-12-08 16:41:07,148 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:41:07,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:41:07,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1563910716, now seen corresponding path program 1 times [2018-12-08 16:41:07,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:41:07,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:07,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:41:07,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:07,150 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:41:07,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:41:07,165 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-08 16:41:07,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:41:07,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 16:41:07,165 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:41:07,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 16:41:07,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 16:41:07,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:41:07,166 INFO L87 Difference]: Start difference. First operand 6120 states and 14385 transitions. Second operand 3 states. [2018-12-08 16:41:07,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:41:07,202 INFO L93 Difference]: Finished difference Result 8339 states and 19492 transitions. [2018-12-08 16:41:07,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 16:41:07,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-12-08 16:41:07,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:41:07,207 INFO L225 Difference]: With dead ends: 8339 [2018-12-08 16:41:07,207 INFO L226 Difference]: Without dead ends: 8339 [2018-12-08 16:41:07,207 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-08 16:41:07,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8339 states. [2018-12-08 16:41:07,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8339 to 6059. [2018-12-08 16:41:07,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6059 states. [2018-12-08 16:41:07,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6059 states to 6059 states and 13925 transitions. [2018-12-08 16:41:07,253 INFO L78 Accepts]: Start accepts. Automaton has 6059 states and 13925 transitions. Word has length 66 [2018-12-08 16:41:07,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:41:07,253 INFO L480 AbstractCegarLoop]: Abstraction has 6059 states and 13925 transitions. [2018-12-08 16:41:07,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 16:41:07,253 INFO L276 IsEmpty]: Start isEmpty. Operand 6059 states and 13925 transitions. [2018-12-08 16:41:07,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-08 16:41:07,257 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:41:07,257 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] [2018-12-08 16:41:07,257 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:41:07,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:41:07,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1344844335, now seen corresponding path program 1 times [2018-12-08 16:41:07,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:41:07,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:07,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:41:07,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:07,258 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:41:07,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:41:07,301 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-08 16:41:07,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:41:07,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 16:41:07,302 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:41:07,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 16:41:07,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 16:41:07,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 16:41:07,302 INFO L87 Difference]: Start difference. First operand 6059 states and 13925 transitions. Second operand 5 states. [2018-12-08 16:41:07,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:41:07,402 INFO L93 Difference]: Finished difference Result 7229 states and 16566 transitions. [2018-12-08 16:41:07,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 16:41:07,403 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2018-12-08 16:41:07,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:41:07,407 INFO L225 Difference]: With dead ends: 7229 [2018-12-08 16:41:07,407 INFO L226 Difference]: Without dead ends: 7229 [2018-12-08 16:41:07,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-08 16:41:07,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7229 states. [2018-12-08 16:41:07,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7229 to 6503. [2018-12-08 16:41:07,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6503 states. [2018-12-08 16:41:07,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6503 states to 6503 states and 14929 transitions. [2018-12-08 16:41:07,452 INFO L78 Accepts]: Start accepts. Automaton has 6503 states and 14929 transitions. Word has length 72 [2018-12-08 16:41:07,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:41:07,452 INFO L480 AbstractCegarLoop]: Abstraction has 6503 states and 14929 transitions. [2018-12-08 16:41:07,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 16:41:07,452 INFO L276 IsEmpty]: Start isEmpty. Operand 6503 states and 14929 transitions. [2018-12-08 16:41:07,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-08 16:41:07,455 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:41:07,456 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] [2018-12-08 16:41:07,456 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:41:07,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:41:07,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1207312626, now seen corresponding path program 1 times [2018-12-08 16:41:07,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:41:07,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:07,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:41:07,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:07,457 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:41:07,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:41:07,548 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-08 16:41:07,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:41:07,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-08 16:41:07,549 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:41:07,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 16:41:07,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 16:41:07,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-08 16:41:07,549 INFO L87 Difference]: Start difference. First operand 6503 states and 14929 transitions. Second operand 9 states. [2018-12-08 16:41:07,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:41:07,830 INFO L93 Difference]: Finished difference Result 8529 states and 19410 transitions. [2018-12-08 16:41:07,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-08 16:41:07,830 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2018-12-08 16:41:07,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:41:07,835 INFO L225 Difference]: With dead ends: 8529 [2018-12-08 16:41:07,836 INFO L226 Difference]: Without dead ends: 8410 [2018-12-08 16:41:07,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-12-08 16:41:07,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8410 states. [2018-12-08 16:41:07,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8410 to 6600. [2018-12-08 16:41:07,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6600 states. [2018-12-08 16:41:07,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6600 states to 6600 states and 15022 transitions. [2018-12-08 16:41:07,886 INFO L78 Accepts]: Start accepts. Automaton has 6600 states and 15022 transitions. Word has length 72 [2018-12-08 16:41:07,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:41:07,886 INFO L480 AbstractCegarLoop]: Abstraction has 6600 states and 15022 transitions. [2018-12-08 16:41:07,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 16:41:07,886 INFO L276 IsEmpty]: Start isEmpty. Operand 6600 states and 15022 transitions. [2018-12-08 16:41:07,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-08 16:41:07,890 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:41:07,890 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] [2018-12-08 16:41:07,891 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:41:07,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:41:07,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1119414586, now seen corresponding path program 1 times [2018-12-08 16:41:07,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:41:07,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:07,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:41:07,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:07,892 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:41:07,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:41:07,925 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-08 16:41:07,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:41:07,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 16:41:07,925 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:41:07,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 16:41:07,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 16:41:07,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 16:41:07,926 INFO L87 Difference]: Start difference. First operand 6600 states and 15022 transitions. Second operand 4 states. [2018-12-08 16:41:08,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:41:08,071 INFO L93 Difference]: Finished difference Result 10287 states and 23293 transitions. [2018-12-08 16:41:08,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 16:41:08,072 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-12-08 16:41:08,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:41:08,078 INFO L225 Difference]: With dead ends: 10287 [2018-12-08 16:41:08,078 INFO L226 Difference]: Without dead ends: 10287 [2018-12-08 16:41:08,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 16:41:08,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10287 states. [2018-12-08 16:41:08,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10287 to 7720. [2018-12-08 16:41:08,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7720 states. [2018-12-08 16:41:08,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7720 states to 7720 states and 17356 transitions. [2018-12-08 16:41:08,139 INFO L78 Accepts]: Start accepts. Automaton has 7720 states and 17356 transitions. Word has length 91 [2018-12-08 16:41:08,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:41:08,139 INFO L480 AbstractCegarLoop]: Abstraction has 7720 states and 17356 transitions. [2018-12-08 16:41:08,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 16:41:08,139 INFO L276 IsEmpty]: Start isEmpty. Operand 7720 states and 17356 transitions. [2018-12-08 16:41:08,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-08 16:41:08,144 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:41:08,144 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] [2018-12-08 16:41:08,145 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:41:08,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:41:08,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1265743780, now seen corresponding path program 1 times [2018-12-08 16:41:08,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:41:08,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:08,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:41:08,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:08,146 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:41:08,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:41:08,200 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-08 16:41:08,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:41:08,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 16:41:08,200 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:41:08,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 16:41:08,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 16:41:08,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 16:41:08,200 INFO L87 Difference]: Start difference. First operand 7720 states and 17356 transitions. Second operand 4 states. [2018-12-08 16:41:08,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:41:08,253 INFO L93 Difference]: Finished difference Result 8285 states and 18649 transitions. [2018-12-08 16:41:08,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 16:41:08,253 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-12-08 16:41:08,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:41:08,258 INFO L225 Difference]: With dead ends: 8285 [2018-12-08 16:41:08,258 INFO L226 Difference]: Without dead ends: 8285 [2018-12-08 16:41:08,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 16:41:08,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8285 states. [2018-12-08 16:41:08,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8285 to 7626. [2018-12-08 16:41:08,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7626 states. [2018-12-08 16:41:08,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7626 states to 7626 states and 17251 transitions. [2018-12-08 16:41:08,311 INFO L78 Accepts]: Start accepts. Automaton has 7626 states and 17251 transitions. Word has length 91 [2018-12-08 16:41:08,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:41:08,311 INFO L480 AbstractCegarLoop]: Abstraction has 7626 states and 17251 transitions. [2018-12-08 16:41:08,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 16:41:08,311 INFO L276 IsEmpty]: Start isEmpty. Operand 7626 states and 17251 transitions. [2018-12-08 16:41:08,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-08 16:41:08,316 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:41:08,316 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:41:08,317 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:41:08,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:41:08,317 INFO L82 PathProgramCache]: Analyzing trace with hash -248736448, now seen corresponding path program 1 times [2018-12-08 16:41:08,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:41:08,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:08,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:41:08,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:08,318 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:41:08,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:41:08,375 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-08 16:41:08,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:41:08,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 16:41:08,375 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:41:08,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 16:41:08,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 16:41:08,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-08 16:41:08,376 INFO L87 Difference]: Start difference. First operand 7626 states and 17251 transitions. Second operand 7 states. [2018-12-08 16:41:08,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:41:08,759 INFO L93 Difference]: Finished difference Result 9400 states and 21199 transitions. [2018-12-08 16:41:08,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 16:41:08,760 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-08 16:41:08,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:41:08,766 INFO L225 Difference]: With dead ends: 9400 [2018-12-08 16:41:08,766 INFO L226 Difference]: Without dead ends: 9400 [2018-12-08 16:41:08,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-08 16:41:08,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9400 states. [2018-12-08 16:41:08,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9400 to 7738. [2018-12-08 16:41:08,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7738 states. [2018-12-08 16:41:08,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7738 states to 7738 states and 17571 transitions. [2018-12-08 16:41:08,828 INFO L78 Accepts]: Start accepts. Automaton has 7738 states and 17571 transitions. Word has length 93 [2018-12-08 16:41:08,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:41:08,829 INFO L480 AbstractCegarLoop]: Abstraction has 7738 states and 17571 transitions. [2018-12-08 16:41:08,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 16:41:08,829 INFO L276 IsEmpty]: Start isEmpty. Operand 7738 states and 17571 transitions. [2018-12-08 16:41:08,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-08 16:41:08,834 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:41:08,834 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] [2018-12-08 16:41:08,834 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:41:08,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:41:08,834 INFO L82 PathProgramCache]: Analyzing trace with hash 190059557, now seen corresponding path program 1 times [2018-12-08 16:41:08,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:41:08,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:08,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:41:08,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:08,835 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:41:08,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:41:08,867 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-08 16:41:08,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:41:08,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 16:41:08,867 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:41:08,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 16:41:08,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 16:41:08,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 16:41:08,868 INFO L87 Difference]: Start difference. First operand 7738 states and 17571 transitions. Second operand 5 states. [2018-12-08 16:41:08,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:41:08,945 INFO L93 Difference]: Finished difference Result 8645 states and 19529 transitions. [2018-12-08 16:41:08,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 16:41:08,945 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-12-08 16:41:08,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:41:08,951 INFO L225 Difference]: With dead ends: 8645 [2018-12-08 16:41:08,951 INFO L226 Difference]: Without dead ends: 8645 [2018-12-08 16:41:08,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 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-08 16:41:08,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8645 states. [2018-12-08 16:41:08,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8645 to 6634. [2018-12-08 16:41:08,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6634 states. [2018-12-08 16:41:09,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6634 states to 6634 states and 15090 transitions. [2018-12-08 16:41:09,004 INFO L78 Accepts]: Start accepts. Automaton has 6634 states and 15090 transitions. Word has length 93 [2018-12-08 16:41:09,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:41:09,004 INFO L480 AbstractCegarLoop]: Abstraction has 6634 states and 15090 transitions. [2018-12-08 16:41:09,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 16:41:09,004 INFO L276 IsEmpty]: Start isEmpty. Operand 6634 states and 15090 transitions. [2018-12-08 16:41:09,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-08 16:41:09,008 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:41:09,008 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] [2018-12-08 16:41:09,008 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:41:09,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:41:09,009 INFO L82 PathProgramCache]: Analyzing trace with hash -64676988, now seen corresponding path program 1 times [2018-12-08 16:41:09,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:41:09,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:09,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:41:09,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:09,010 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:41:09,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:41:09,041 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-08 16:41:09,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:41:09,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 16:41:09,041 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:41:09,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 16:41:09,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 16:41:09,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 16:41:09,042 INFO L87 Difference]: Start difference. First operand 6634 states and 15090 transitions. Second operand 5 states. [2018-12-08 16:41:09,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:41:09,242 INFO L93 Difference]: Finished difference Result 7882 states and 17730 transitions. [2018-12-08 16:41:09,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 16:41:09,242 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-12-08 16:41:09,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:41:09,247 INFO L225 Difference]: With dead ends: 7882 [2018-12-08 16:41:09,247 INFO L226 Difference]: Without dead ends: 7751 [2018-12-08 16:41:09,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-08 16:41:09,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7751 states. [2018-12-08 16:41:09,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7751 to 7373. [2018-12-08 16:41:09,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7373 states. [2018-12-08 16:41:09,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7373 states to 7373 states and 16709 transitions. [2018-12-08 16:41:09,303 INFO L78 Accepts]: Start accepts. Automaton has 7373 states and 16709 transitions. Word has length 93 [2018-12-08 16:41:09,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:41:09,303 INFO L480 AbstractCegarLoop]: Abstraction has 7373 states and 16709 transitions. [2018-12-08 16:41:09,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 16:41:09,303 INFO L276 IsEmpty]: Start isEmpty. Operand 7373 states and 16709 transitions. [2018-12-08 16:41:09,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-08 16:41:09,308 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:41:09,308 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] [2018-12-08 16:41:09,309 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:41:09,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:41:09,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1180087493, now seen corresponding path program 1 times [2018-12-08 16:41:09,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:41:09,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:09,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:41:09,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:09,310 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:41:09,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:41:09,351 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-08 16:41:09,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:41:09,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 16:41:09,352 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:41:09,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 16:41:09,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 16:41:09,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 16:41:09,353 INFO L87 Difference]: Start difference. First operand 7373 states and 16709 transitions. Second operand 6 states. [2018-12-08 16:41:09,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:41:09,573 INFO L93 Difference]: Finished difference Result 9406 states and 21103 transitions. [2018-12-08 16:41:09,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 16:41:09,574 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-12-08 16:41:09,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:41:09,580 INFO L225 Difference]: With dead ends: 9406 [2018-12-08 16:41:09,580 INFO L226 Difference]: Without dead ends: 9298 [2018-12-08 16:41:09,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-08 16:41:09,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9298 states. [2018-12-08 16:41:09,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9298 to 7200. [2018-12-08 16:41:09,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7200 states. [2018-12-08 16:41:09,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7200 states to 7200 states and 16315 transitions. [2018-12-08 16:41:09,658 INFO L78 Accepts]: Start accepts. Automaton has 7200 states and 16315 transitions. Word has length 93 [2018-12-08 16:41:09,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:41:09,658 INFO L480 AbstractCegarLoop]: Abstraction has 7200 states and 16315 transitions. [2018-12-08 16:41:09,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 16:41:09,658 INFO L276 IsEmpty]: Start isEmpty. Operand 7200 states and 16315 transitions. [2018-12-08 16:41:09,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-08 16:41:09,664 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:41:09,665 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] [2018-12-08 16:41:09,665 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:41:09,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:41:09,665 INFO L82 PathProgramCache]: Analyzing trace with hash 86477922, now seen corresponding path program 1 times [2018-12-08 16:41:09,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:41:09,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:09,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:41:09,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:09,666 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:41:09,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:41:09,758 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-08 16:41:09,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:41:09,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-08 16:41:09,759 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:41:09,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 16:41:09,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 16:41:09,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-08 16:41:09,759 INFO L87 Difference]: Start difference. First operand 7200 states and 16315 transitions. Second operand 9 states. [2018-12-08 16:41:10,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:41:10,082 INFO L93 Difference]: Finished difference Result 10191 states and 23070 transitions. [2018-12-08 16:41:10,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-08 16:41:10,082 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2018-12-08 16:41:10,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:41:10,088 INFO L225 Difference]: With dead ends: 10191 [2018-12-08 16:41:10,088 INFO L226 Difference]: Without dead ends: 10159 [2018-12-08 16:41:10,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-12-08 16:41:10,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10159 states. [2018-12-08 16:41:10,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10159 to 9008. [2018-12-08 16:41:10,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9008 states. [2018-12-08 16:41:10,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9008 states to 9008 states and 20407 transitions. [2018-12-08 16:41:10,152 INFO L78 Accepts]: Start accepts. Automaton has 9008 states and 20407 transitions. Word has length 93 [2018-12-08 16:41:10,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:41:10,152 INFO L480 AbstractCegarLoop]: Abstraction has 9008 states and 20407 transitions. [2018-12-08 16:41:10,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 16:41:10,152 INFO L276 IsEmpty]: Start isEmpty. Operand 9008 states and 20407 transitions. [2018-12-08 16:41:10,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-08 16:41:10,158 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:41:10,158 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] [2018-12-08 16:41:10,158 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:41:10,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:41:10,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1710473437, now seen corresponding path program 1 times [2018-12-08 16:41:10,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:41:10,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:10,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:41:10,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:10,160 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:41:10,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:41:10,212 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-08 16:41:10,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:41:10,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 16:41:10,212 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:41:10,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 16:41:10,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 16:41:10,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-08 16:41:10,213 INFO L87 Difference]: Start difference. First operand 9008 states and 20407 transitions. Second operand 8 states. [2018-12-08 16:41:10,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:41:10,449 INFO L93 Difference]: Finished difference Result 14357 states and 33169 transitions. [2018-12-08 16:41:10,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 16:41:10,450 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 93 [2018-12-08 16:41:10,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:41:10,459 INFO L225 Difference]: With dead ends: 14357 [2018-12-08 16:41:10,459 INFO L226 Difference]: Without dead ends: 14357 [2018-12-08 16:41:10,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-08 16:41:10,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14357 states. [2018-12-08 16:41:10,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14357 to 9634. [2018-12-08 16:41:10,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9634 states. [2018-12-08 16:41:10,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9634 states to 9634 states and 22044 transitions. [2018-12-08 16:41:10,546 INFO L78 Accepts]: Start accepts. Automaton has 9634 states and 22044 transitions. Word has length 93 [2018-12-08 16:41:10,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:41:10,546 INFO L480 AbstractCegarLoop]: Abstraction has 9634 states and 22044 transitions. [2018-12-08 16:41:10,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 16:41:10,546 INFO L276 IsEmpty]: Start isEmpty. Operand 9634 states and 22044 transitions. [2018-12-08 16:41:10,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-08 16:41:10,553 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:41:10,553 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] [2018-12-08 16:41:10,553 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:41:10,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:41:10,553 INFO L82 PathProgramCache]: Analyzing trace with hash -822969756, now seen corresponding path program 1 times [2018-12-08 16:41:10,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:41:10,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:10,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:41:10,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:10,554 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:41:10,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:41:10,578 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-08 16:41:10,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:41:10,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 16:41:10,578 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:41:10,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 16:41:10,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 16:41:10,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:41:10,579 INFO L87 Difference]: Start difference. First operand 9634 states and 22044 transitions. Second operand 3 states. [2018-12-08 16:41:10,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:41:10,600 INFO L93 Difference]: Finished difference Result 9378 states and 21228 transitions. [2018-12-08 16:41:10,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 16:41:10,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2018-12-08 16:41:10,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:41:10,607 INFO L225 Difference]: With dead ends: 9378 [2018-12-08 16:41:10,607 INFO L226 Difference]: Without dead ends: 9346 [2018-12-08 16:41:10,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:41:10,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9346 states. [2018-12-08 16:41:10,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9346 to 7511. [2018-12-08 16:41:10,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7511 states. [2018-12-08 16:41:10,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7511 states to 7511 states and 16863 transitions. [2018-12-08 16:41:10,671 INFO L78 Accepts]: Start accepts. Automaton has 7511 states and 16863 transitions. Word has length 93 [2018-12-08 16:41:10,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:41:10,672 INFO L480 AbstractCegarLoop]: Abstraction has 7511 states and 16863 transitions. [2018-12-08 16:41:10,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 16:41:10,672 INFO L276 IsEmpty]: Start isEmpty. Operand 7511 states and 16863 transitions. [2018-12-08 16:41:10,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-08 16:41:10,676 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:41:10,676 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] [2018-12-08 16:41:10,677 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:41:10,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:41:10,677 INFO L82 PathProgramCache]: Analyzing trace with hash 461346830, now seen corresponding path program 1 times [2018-12-08 16:41:10,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:41:10,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:10,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:41:10,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:10,678 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:41:10,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:41:10,811 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-08 16:41:10,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:41:10,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-08 16:41:10,811 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:41:10,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 16:41:10,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 16:41:10,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-12-08 16:41:10,812 INFO L87 Difference]: Start difference. First operand 7511 states and 16863 transitions. Second operand 10 states. [2018-12-08 16:41:11,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:41:11,255 INFO L93 Difference]: Finished difference Result 9932 states and 22168 transitions. [2018-12-08 16:41:11,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-08 16:41:11,256 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 95 [2018-12-08 16:41:11,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:41:11,262 INFO L225 Difference]: With dead ends: 9932 [2018-12-08 16:41:11,262 INFO L226 Difference]: Without dead ends: 9932 [2018-12-08 16:41:11,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2018-12-08 16:41:11,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9932 states. [2018-12-08 16:41:11,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9932 to 8732. [2018-12-08 16:41:11,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8732 states. [2018-12-08 16:41:11,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8732 states to 8732 states and 19527 transitions. [2018-12-08 16:41:11,327 INFO L78 Accepts]: Start accepts. Automaton has 8732 states and 19527 transitions. Word has length 95 [2018-12-08 16:41:11,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:41:11,327 INFO L480 AbstractCegarLoop]: Abstraction has 8732 states and 19527 transitions. [2018-12-08 16:41:11,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 16:41:11,327 INFO L276 IsEmpty]: Start isEmpty. Operand 8732 states and 19527 transitions. [2018-12-08 16:41:11,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-08 16:41:11,333 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:41:11,333 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] [2018-12-08 16:41:11,333 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:41:11,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:41:11,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1348850511, now seen corresponding path program 1 times [2018-12-08 16:41:11,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:41:11,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:11,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:41:11,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:11,335 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:41:11,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:41:11,430 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-08 16:41:11,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:41:11,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-08 16:41:11,430 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:41:11,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 16:41:11,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 16:41:11,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-08 16:41:11,431 INFO L87 Difference]: Start difference. First operand 8732 states and 19527 transitions. Second operand 9 states. [2018-12-08 16:41:11,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:41:11,775 INFO L93 Difference]: Finished difference Result 10680 states and 23668 transitions. [2018-12-08 16:41:11,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-08 16:41:11,776 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2018-12-08 16:41:11,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:41:11,782 INFO L225 Difference]: With dead ends: 10680 [2018-12-08 16:41:11,782 INFO L226 Difference]: Without dead ends: 10680 [2018-12-08 16:41:11,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2018-12-08 16:41:11,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10680 states. [2018-12-08 16:41:11,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10680 to 9212. [2018-12-08 16:41:11,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9212 states. [2018-12-08 16:41:11,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9212 states to 9212 states and 20534 transitions. [2018-12-08 16:41:11,849 INFO L78 Accepts]: Start accepts. Automaton has 9212 states and 20534 transitions. Word has length 95 [2018-12-08 16:41:11,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:41:11,850 INFO L480 AbstractCegarLoop]: Abstraction has 9212 states and 20534 transitions. [2018-12-08 16:41:11,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 16:41:11,850 INFO L276 IsEmpty]: Start isEmpty. Operand 9212 states and 20534 transitions. [2018-12-08 16:41:11,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-08 16:41:11,856 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:41:11,856 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] [2018-12-08 16:41:11,856 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:41:11,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:41:11,856 INFO L82 PathProgramCache]: Analyzing trace with hash 672697743, now seen corresponding path program 1 times [2018-12-08 16:41:11,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:41:11,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:11,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:41:11,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:11,857 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:41:11,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:41:11,913 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-08 16:41:11,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:41:11,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 16:41:11,913 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:41:11,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 16:41:11,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 16:41:11,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 16:41:11,914 INFO L87 Difference]: Start difference. First operand 9212 states and 20534 transitions. Second operand 5 states. [2018-12-08 16:41:11,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:41:11,965 INFO L93 Difference]: Finished difference Result 9212 states and 20470 transitions. [2018-12-08 16:41:11,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 16:41:11,966 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2018-12-08 16:41:11,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:41:11,972 INFO L225 Difference]: With dead ends: 9212 [2018-12-08 16:41:11,972 INFO L226 Difference]: Without dead ends: 9212 [2018-12-08 16:41:11,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-08 16:41:11,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9212 states. [2018-12-08 16:41:12,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9212 to 6217. [2018-12-08 16:41:12,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6217 states. [2018-12-08 16:41:12,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6217 states to 6217 states and 13837 transitions. [2018-12-08 16:41:12,031 INFO L78 Accepts]: Start accepts. Automaton has 6217 states and 13837 transitions. Word has length 95 [2018-12-08 16:41:12,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:41:12,032 INFO L480 AbstractCegarLoop]: Abstraction has 6217 states and 13837 transitions. [2018-12-08 16:41:12,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 16:41:12,032 INFO L276 IsEmpty]: Start isEmpty. Operand 6217 states and 13837 transitions. [2018-12-08 16:41:12,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-08 16:41:12,036 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:41:12,036 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] [2018-12-08 16:41:12,036 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:41:12,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:41:12,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1560201424, now seen corresponding path program 1 times [2018-12-08 16:41:12,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:41:12,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:12,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:41:12,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:12,038 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:41:12,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:41:12,134 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-08 16:41:12,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:41:12,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-08 16:41:12,134 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:41:12,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 16:41:12,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 16:41:12,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-08 16:41:12,135 INFO L87 Difference]: Start difference. First operand 6217 states and 13837 transitions. Second operand 11 states. [2018-12-08 16:41:13,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:41:13,940 INFO L93 Difference]: Finished difference Result 11284 states and 25232 transitions. [2018-12-08 16:41:13,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-08 16:41:13,940 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2018-12-08 16:41:13,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:41:13,945 INFO L225 Difference]: With dead ends: 11284 [2018-12-08 16:41:13,945 INFO L226 Difference]: Without dead ends: 7970 [2018-12-08 16:41:13,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-12-08 16:41:13,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7970 states. [2018-12-08 16:41:13,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7970 to 6049. [2018-12-08 16:41:13,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6049 states. [2018-12-08 16:41:13,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6049 states to 6049 states and 13423 transitions. [2018-12-08 16:41:13,992 INFO L78 Accepts]: Start accepts. Automaton has 6049 states and 13423 transitions. Word has length 95 [2018-12-08 16:41:13,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:41:13,992 INFO L480 AbstractCegarLoop]: Abstraction has 6049 states and 13423 transitions. [2018-12-08 16:41:13,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 16:41:13,992 INFO L276 IsEmpty]: Start isEmpty. Operand 6049 states and 13423 transitions. [2018-12-08 16:41:13,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-08 16:41:13,996 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:41:13,996 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] [2018-12-08 16:41:13,996 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:41:13,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:41:13,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1172529568, now seen corresponding path program 1 times [2018-12-08 16:41:13,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:41:14,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:14,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:41:14,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:14,009 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:41:14,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:41:14,068 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-08 16:41:14,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:41:14,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 16:41:14,068 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:41:14,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 16:41:14,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 16:41:14,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-08 16:41:14,068 INFO L87 Difference]: Start difference. First operand 6049 states and 13423 transitions. Second operand 7 states. [2018-12-08 16:41:14,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:41:14,320 INFO L93 Difference]: Finished difference Result 7475 states and 16378 transitions. [2018-12-08 16:41:14,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 16:41:14,321 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2018-12-08 16:41:14,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:41:14,325 INFO L225 Difference]: With dead ends: 7475 [2018-12-08 16:41:14,326 INFO L226 Difference]: Without dead ends: 7437 [2018-12-08 16:41:14,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-08 16:41:14,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7437 states. [2018-12-08 16:41:14,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7437 to 6381. [2018-12-08 16:41:14,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6381 states. [2018-12-08 16:41:14,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6381 states to 6381 states and 14093 transitions. [2018-12-08 16:41:14,372 INFO L78 Accepts]: Start accepts. Automaton has 6381 states and 14093 transitions. Word has length 95 [2018-12-08 16:41:14,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:41:14,372 INFO L480 AbstractCegarLoop]: Abstraction has 6381 states and 14093 transitions. [2018-12-08 16:41:14,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 16:41:14,373 INFO L276 IsEmpty]: Start isEmpty. Operand 6381 states and 14093 transitions. [2018-12-08 16:41:14,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-08 16:41:14,376 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:41:14,377 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] [2018-12-08 16:41:14,377 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:41:14,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:41:14,377 INFO L82 PathProgramCache]: Analyzing trace with hash -354392864, now seen corresponding path program 2 times [2018-12-08 16:41:14,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:41:14,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:14,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:41:14,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:14,378 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:41:14,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:41:14,462 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-08 16:41:14,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:41:14,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-08 16:41:14,462 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:41:14,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 16:41:14,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 16:41:14,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-08 16:41:14,463 INFO L87 Difference]: Start difference. First operand 6381 states and 14093 transitions. Second operand 9 states. [2018-12-08 16:41:14,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:41:14,869 INFO L93 Difference]: Finished difference Result 7497 states and 16434 transitions. [2018-12-08 16:41:14,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 16:41:14,870 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2018-12-08 16:41:14,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:41:14,875 INFO L225 Difference]: With dead ends: 7497 [2018-12-08 16:41:14,875 INFO L226 Difference]: Without dead ends: 7490 [2018-12-08 16:41:14,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-12-08 16:41:14,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7490 states. [2018-12-08 16:41:14,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7490 to 6603. [2018-12-08 16:41:14,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6603 states. [2018-12-08 16:41:14,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6603 states to 6603 states and 14580 transitions. [2018-12-08 16:41:14,925 INFO L78 Accepts]: Start accepts. Automaton has 6603 states and 14580 transitions. Word has length 95 [2018-12-08 16:41:14,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:41:14,925 INFO L480 AbstractCegarLoop]: Abstraction has 6603 states and 14580 transitions. [2018-12-08 16:41:14,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 16:41:14,925 INFO L276 IsEmpty]: Start isEmpty. Operand 6603 states and 14580 transitions. [2018-12-08 16:41:14,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-08 16:41:14,929 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:41:14,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] [2018-12-08 16:41:14,929 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:41:14,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:41:14,929 INFO L82 PathProgramCache]: Analyzing trace with hash -143041951, now seen corresponding path program 1 times [2018-12-08 16:41:14,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:41:14,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:14,930 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 16:41:14,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:14,930 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:41:14,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:41:14,963 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-08 16:41:14,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:41:14,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 16:41:14,964 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:41:14,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 16:41:14,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 16:41:14,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 16:41:14,964 INFO L87 Difference]: Start difference. First operand 6603 states and 14580 transitions. Second operand 6 states. [2018-12-08 16:41:15,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:41:15,071 INFO L93 Difference]: Finished difference Result 6823 states and 14984 transitions. [2018-12-08 16:41:15,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 16:41:15,071 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2018-12-08 16:41:15,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:41:15,075 INFO L225 Difference]: With dead ends: 6823 [2018-12-08 16:41:15,075 INFO L226 Difference]: Without dead ends: 6823 [2018-12-08 16:41:15,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-08 16:41:15,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6823 states. [2018-12-08 16:41:15,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6823 to 6249. [2018-12-08 16:41:15,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6249 states. [2018-12-08 16:41:15,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6249 states to 6249 states and 13774 transitions. [2018-12-08 16:41:15,117 INFO L78 Accepts]: Start accepts. Automaton has 6249 states and 13774 transitions. Word has length 95 [2018-12-08 16:41:15,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:41:15,117 INFO L480 AbstractCegarLoop]: Abstraction has 6249 states and 13774 transitions. [2018-12-08 16:41:15,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 16:41:15,117 INFO L276 IsEmpty]: Start isEmpty. Operand 6249 states and 13774 transitions. [2018-12-08 16:41:15,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-08 16:41:15,121 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:41:15,121 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] [2018-12-08 16:41:15,121 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:41:15,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:41:15,122 INFO L82 PathProgramCache]: Analyzing trace with hash -842763807, now seen corresponding path program 2 times [2018-12-08 16:41:15,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:41:15,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:15,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:41:15,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:15,122 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:41:15,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:41:15,209 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-08 16:41:15,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:41:15,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 16:41:15,209 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:41:15,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 16:41:15,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 16:41:15,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-08 16:41:15,210 INFO L87 Difference]: Start difference. First operand 6249 states and 13774 transitions. Second operand 8 states. [2018-12-08 16:41:15,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:41:15,444 INFO L93 Difference]: Finished difference Result 8061 states and 17617 transitions. [2018-12-08 16:41:15,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 16:41:15,444 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2018-12-08 16:41:15,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:41:15,449 INFO L225 Difference]: With dead ends: 8061 [2018-12-08 16:41:15,449 INFO L226 Difference]: Without dead ends: 8061 [2018-12-08 16:41:15,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-12-08 16:41:15,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8061 states. [2018-12-08 16:41:15,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8061 to 6404. [2018-12-08 16:41:15,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6404 states. [2018-12-08 16:41:15,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6404 states to 6404 states and 14131 transitions. [2018-12-08 16:41:15,501 INFO L78 Accepts]: Start accepts. Automaton has 6404 states and 14131 transitions. Word has length 95 [2018-12-08 16:41:15,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:41:15,501 INFO L480 AbstractCegarLoop]: Abstraction has 6404 states and 14131 transitions. [2018-12-08 16:41:15,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 16:41:15,501 INFO L276 IsEmpty]: Start isEmpty. Operand 6404 states and 14131 transitions. [2018-12-08 16:41:15,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-08 16:41:15,505 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:41:15,506 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] [2018-12-08 16:41:15,506 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 16:41:15,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:41:15,506 INFO L82 PathProgramCache]: Analyzing trace with hash -631412894, now seen corresponding path program 2 times [2018-12-08 16:41:15,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:41:15,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:15,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 16:41:15,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:41:15,507 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:41:15,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:41:15,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:41:15,548 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-08 16:41:15,620 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-08 16:41:15,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 04:41:15 BasicIcfg [2018-12-08 16:41:15,621 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 16:41:15,621 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 16:41:15,621 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 16:41:15,621 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 16:41:15,622 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 04:40:57" (3/4) ... [2018-12-08 16:41:15,623 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-08 16:41:15,695 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_e3ce3981-08c9-425c-95a2-3c793bef46f8/bin-2019/utaipan/witness.graphml [2018-12-08 16:41:15,695 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 16:41:15,695 INFO L168 Benchmark]: Toolchain (without parser) took 19347.75 ms. Allocated memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: 1.6 GB). Free memory was 953.5 MB in the beginning and 1.6 GB in the end (delta: -648.2 MB). Peak memory consumption was 992.9 MB. Max. memory is 11.5 GB. [2018-12-08 16:41:15,696 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 16:41:15,696 INFO L168 Benchmark]: CACSL2BoogieTranslator took 371.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -177.3 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. [2018-12-08 16:41:15,696 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-12-08 16:41:15,697 INFO L168 Benchmark]: Boogie Preprocessor took 20.11 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 16:41:15,697 INFO L168 Benchmark]: RCFGBuilder took 325.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.1 MB). Peak memory consumption was 48.1 MB. Max. memory is 11.5 GB. [2018-12-08 16:41:15,697 INFO L168 Benchmark]: TraceAbstraction took 18524.73 ms. Allocated memory was 1.2 GB in the beginning and 2.7 GB in the end (delta: 1.5 GB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -559.5 MB). Peak memory consumption was 926.8 MB. Max. memory is 11.5 GB. [2018-12-08 16:41:15,697 INFO L168 Benchmark]: Witness Printer took 73.51 ms. Allocated memory is still 2.7 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 11.5 GB. [2018-12-08 16:41:15,698 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 371.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -177.3 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.11 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 325.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.1 MB). Peak memory consumption was 48.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 18524.73 ms. Allocated memory was 1.2 GB in the beginning and 2.7 GB in the end (delta: 1.5 GB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -559.5 MB). Peak memory consumption was 926.8 MB. Max. memory is 11.5 GB. * Witness Printer took 73.51 ms. Allocated memory is still 2.7 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 33.6 MB). Peak memory consumption was 33.6 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: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L675] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L680] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L681] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L682] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L683] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L684] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L685] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L686] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L687] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L688] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L689] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L690] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L691] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L692] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L693] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L695] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L696] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L697] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L773] -1 pthread_t t1711; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L774] FCALL, FORK -1 pthread_create(&t1711, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L701] 0 x$w_buff1 = x$w_buff0 [L702] 0 x$w_buff0 = 1 [L703] 0 x$w_buff1_used = x$w_buff0_used [L704] 0 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L706] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L707] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L708] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L709] 0 x$r_buff0_thd1 = (_Bool)1 [L712] 0 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L715] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] -1 pthread_t t1712; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L776] FCALL, FORK -1 pthread_create(&t1712, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L729] 1 y = 2 [L732] 1 __unbuffered_p1_EAX = y [L735] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L736] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L740] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L742] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L743] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L744] EXPR 1 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] 1 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L745] EXPR 1 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L745] 1 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L715] 0 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] 1 x = x$flush_delayed ? x$mem_tmp : x [L748] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L716] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L716] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L717] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L717] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L718] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L718] 0 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L719] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L719] 0 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L722] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L751] EXPR 1 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=2] [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=2] [L751] 1 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L752] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L752] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L753] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L753] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L754] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L754] 1 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L755] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L755] 1 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L778] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] -1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L783] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L783] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L784] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L784] -1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L785] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L786] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L786] -1 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L789] -1 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 222 locations, 3 error locations. UNSAFE Result, 18.4s OverallTime, 36 OverallIterations, 1 TraceHistogramMax, 10.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9122 SDtfs, 10126 SDslu, 22628 SDs, 0 SdLazy, 10674 SolverSat, 494 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 383 GetRequests, 89 SyntacticMatches, 41 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34806occurred 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: 4.3s AutomataMinimizationTime, 35 MinimizatonAttempts, 90076 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 2764 NumberOfCodeBlocks, 2764 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 2634 ConstructedInterpolants, 0 QuantifiedInterpolants, 622933 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 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...