./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix000_tso.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_630a1e69-0814-4998-a110-5a991ca09305/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_630a1e69-0814-4998-a110-5a991ca09305/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_630a1e69-0814-4998-a110-5a991ca09305/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_630a1e69-0814-4998-a110-5a991ca09305/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix000_tso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_630a1e69-0814-4998-a110-5a991ca09305/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_630a1e69-0814-4998-a110-5a991ca09305/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 a4dc61dcc3100553026c0b6a76926752a014539d .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 19:20:10,768 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 19:20:10,769 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 19:20:10,775 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 19:20:10,775 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 19:20:10,775 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 19:20:10,776 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 19:20:10,777 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 19:20:10,777 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 19:20:10,778 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 19:20:10,778 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 19:20:10,778 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 19:20:10,779 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 19:20:10,779 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 19:20:10,780 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 19:20:10,780 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 19:20:10,780 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 19:20:10,781 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 19:20:10,782 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 19:20:10,783 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 19:20:10,783 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 19:20:10,784 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 19:20:10,785 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 19:20:10,785 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 19:20:10,785 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 19:20:10,785 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 19:20:10,786 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 19:20:10,786 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 19:20:10,786 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 19:20:10,787 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 19:20:10,787 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 19:20:10,787 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 19:20:10,787 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 19:20:10,787 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 19:20:10,788 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 19:20:10,788 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 19:20:10,788 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_630a1e69-0814-4998-a110-5a991ca09305/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-08 19:20:10,795 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 19:20:10,795 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 19:20:10,796 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 19:20:10,796 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 19:20:10,796 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-08 19:20:10,796 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-08 19:20:10,796 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-08 19:20:10,796 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-08 19:20:10,796 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-08 19:20:10,796 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-08 19:20:10,796 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-08 19:20:10,796 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-08 19:20:10,796 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-08 19:20:10,797 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 19:20:10,797 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 19:20:10,797 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 19:20:10,797 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 19:20:10,797 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 19:20:10,797 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 19:20:10,797 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 19:20:10,797 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 19:20:10,798 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 19:20:10,798 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 19:20:10,798 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 19:20:10,798 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 19:20:10,798 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 19:20:10,798 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 19:20:10,798 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 19:20:10,798 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 19:20:10,798 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 19:20:10,798 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 19:20:10,798 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 19:20:10,799 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-08 19:20:10,799 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 19:20:10,799 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 19:20:10,799 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-08 19:20:10,799 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_630a1e69-0814-4998-a110-5a991ca09305/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 -> a4dc61dcc3100553026c0b6a76926752a014539d [2018-12-08 19:20:10,816 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 19:20:10,823 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 19:20:10,825 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 19:20:10,826 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 19:20:10,826 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 19:20:10,826 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_630a1e69-0814-4998-a110-5a991ca09305/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix000_tso.opt_false-unreach-call.i [2018-12-08 19:20:10,863 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_630a1e69-0814-4998-a110-5a991ca09305/bin-2019/utaipan/data/31811666d/ae0d174ecef34122971f677010c9e5f6/FLAG0ead7215c [2018-12-08 19:20:11,349 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 19:20:11,349 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_630a1e69-0814-4998-a110-5a991ca09305/sv-benchmarks/c/pthread-wmm/mix000_tso.opt_false-unreach-call.i [2018-12-08 19:20:11,358 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_630a1e69-0814-4998-a110-5a991ca09305/bin-2019/utaipan/data/31811666d/ae0d174ecef34122971f677010c9e5f6/FLAG0ead7215c [2018-12-08 19:20:11,847 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_630a1e69-0814-4998-a110-5a991ca09305/bin-2019/utaipan/data/31811666d/ae0d174ecef34122971f677010c9e5f6 [2018-12-08 19:20:11,849 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 19:20:11,850 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 19:20:11,851 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 19:20:11,851 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 19:20:11,854 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 19:20:11,854 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 07:20:11" (1/1) ... [2018-12-08 19:20:11,856 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68cabf0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:20:11, skipping insertion in model container [2018-12-08 19:20:11,856 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 07:20:11" (1/1) ... [2018-12-08 19:20:11,861 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 19:20:11,886 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 19:20:12,078 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 19:20:12,086 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 19:20:12,175 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 19:20:12,214 INFO L195 MainTranslator]: Completed translation [2018-12-08 19:20:12,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:20:12 WrapperNode [2018-12-08 19:20:12,214 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 19:20:12,215 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 19:20:12,215 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 19:20:12,215 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 19:20:12,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:20:12" (1/1) ... [2018-12-08 19:20:12,235 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:20:12" (1/1) ... [2018-12-08 19:20:12,256 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 19:20:12,256 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 19:20:12,256 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 19:20:12,256 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 19:20:12,262 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:20:12" (1/1) ... [2018-12-08 19:20:12,262 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:20:12" (1/1) ... [2018-12-08 19:20:12,265 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:20:12" (1/1) ... [2018-12-08 19:20:12,265 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:20:12" (1/1) ... [2018-12-08 19:20:12,270 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:20:12" (1/1) ... [2018-12-08 19:20:12,272 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:20:12" (1/1) ... [2018-12-08 19:20:12,274 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:20:12" (1/1) ... [2018-12-08 19:20:12,276 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 19:20:12,277 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 19:20:12,277 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 19:20:12,277 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 19:20:12,278 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:20:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_630a1e69-0814-4998-a110-5a991ca09305/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 19:20:12,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 19:20:12,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 19:20:12,310 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-08 19:20:12,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 19:20:12,310 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-08 19:20:12,310 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-08 19:20:12,310 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-08 19:20:12,311 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-08 19:20:12,311 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-08 19:20:12,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 19:20:12,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 19:20:12,312 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 19:20:12,643 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 19:20:12,643 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-08 19:20:12,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 07:20:12 BoogieIcfgContainer [2018-12-08 19:20:12,644 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 19:20:12,644 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 19:20:12,644 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 19:20:12,646 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 19:20:12,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 07:20:11" (1/3) ... [2018-12-08 19:20:12,646 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7453cf3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 07:20:12, skipping insertion in model container [2018-12-08 19:20:12,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:20:12" (2/3) ... [2018-12-08 19:20:12,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7453cf3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 07:20:12, skipping insertion in model container [2018-12-08 19:20:12,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 07:20:12" (3/3) ... [2018-12-08 19:20:12,648 INFO L112 eAbstractionObserver]: Analyzing ICFG mix000_tso.opt_false-unreach-call.i [2018-12-08 19:20:12,673 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,673 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,674 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,674 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,674 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,674 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,674 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,674 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,675 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,675 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,675 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,675 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,675 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,675 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,675 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,676 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,676 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,676 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,676 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,676 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,676 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,676 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,676 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,677 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,677 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,677 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,677 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,677 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,677 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,677 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,678 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,678 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,678 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,678 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,678 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,678 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,678 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,679 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,679 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,679 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,679 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,679 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,679 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,679 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,680 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,680 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,680 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,680 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,680 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,680 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,680 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,680 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,681 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,681 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,681 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,681 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,681 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,681 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,681 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,681 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,682 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,682 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,682 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,682 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,682 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,682 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,682 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,682 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,683 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,683 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,683 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,683 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,683 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,683 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,683 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,683 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,684 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,684 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,684 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,684 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,684 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,684 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,684 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,684 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,685 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,685 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,685 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,685 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,685 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,685 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,685 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,686 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,686 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,686 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,686 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,686 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,686 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,686 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,687 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,687 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,687 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,687 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,687 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,687 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,689 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,689 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,689 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,689 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,689 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,689 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,689 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,689 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,690 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,690 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,690 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,690 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,690 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,690 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,690 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,691 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,691 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,691 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,691 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,691 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,691 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,691 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,692 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,692 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,692 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,692 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,692 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,692 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,692 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,693 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,693 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,693 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,693 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,693 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,693 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,693 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,694 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,694 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,694 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,694 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,694 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,694 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,694 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,695 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,695 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,695 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,695 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,695 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,695 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,695 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,696 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,696 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,696 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,696 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,696 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,696 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,696 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,697 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,697 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,697 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,697 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,697 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,697 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,697 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,697 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,698 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,698 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,698 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,698 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,698 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,698 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,699 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,699 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,699 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,699 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,699 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,699 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,699 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,700 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,700 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,700 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,700 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,700 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,701 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,701 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,701 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,701 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,701 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,701 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,701 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,701 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,702 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,702 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,702 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,702 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,702 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,702 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,702 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,703 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,703 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,703 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,703 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,703 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,703 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,703 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,704 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,704 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,704 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,704 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,704 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,704 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,704 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,705 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,705 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,705 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,705 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,705 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,705 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,705 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,705 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:20:12,710 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-08 19:20:12,710 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 19:20:12,717 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-08 19:20:12,726 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-08 19:20:12,741 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 19:20:12,741 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 19:20:12,742 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 19:20:12,742 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 19:20:12,742 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 19:20:12,742 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 19:20:12,742 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 19:20:12,742 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 19:20:12,751 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 174places, 227 transitions [2018-12-08 19:20:18,156 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 83128 states. [2018-12-08 19:20:18,158 INFO L276 IsEmpty]: Start isEmpty. Operand 83128 states. [2018-12-08 19:20:18,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-08 19:20:18,166 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:20:18,166 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] [2018-12-08 19:20:18,168 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:20:18,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:20:18,171 INFO L82 PathProgramCache]: Analyzing trace with hash 164866570, now seen corresponding path program 1 times [2018-12-08 19:20:18,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:20:18,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:20:18,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:20:18,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:20:18,208 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:20:18,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:20:18,311 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 19:20:18,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:20:18,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 19:20:18,312 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:20:18,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 19:20:18,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 19:20:18,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 19:20:18,325 INFO L87 Difference]: Start difference. First operand 83128 states. Second operand 4 states. [2018-12-08 19:20:19,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:20:19,143 INFO L93 Difference]: Finished difference Result 150584 states and 603161 transitions. [2018-12-08 19:20:19,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 19:20:19,145 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-12-08 19:20:19,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:20:19,717 INFO L225 Difference]: With dead ends: 150584 [2018-12-08 19:20:19,717 INFO L226 Difference]: Without dead ends: 105840 [2018-12-08 19:20:19,718 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 19:20:20,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105840 states. [2018-12-08 19:20:21,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105840 to 61236. [2018-12-08 19:20:21,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61236 states. [2018-12-08 19:20:21,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61236 states to 61236 states and 248291 transitions. [2018-12-08 19:20:21,816 INFO L78 Accepts]: Start accepts. Automaton has 61236 states and 248291 transitions. Word has length 39 [2018-12-08 19:20:21,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:20:21,816 INFO L480 AbstractCegarLoop]: Abstraction has 61236 states and 248291 transitions. [2018-12-08 19:20:21,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 19:20:21,817 INFO L276 IsEmpty]: Start isEmpty. Operand 61236 states and 248291 transitions. [2018-12-08 19:20:21,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-08 19:20:21,822 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:20:21,822 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:20:21,822 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:20:21,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:20:21,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1121119524, now seen corresponding path program 1 times [2018-12-08 19:20:21,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:20:21,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:20:21,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:20:21,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:20:21,825 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:20:21,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:20:21,863 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 19:20:21,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:20:21,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 19:20:21,863 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:20:21,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 19:20:21,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 19:20:21,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 19:20:21,864 INFO L87 Difference]: Start difference. First operand 61236 states and 248291 transitions. Second operand 4 states. [2018-12-08 19:20:21,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:20:21,961 INFO L93 Difference]: Finished difference Result 14310 states and 48364 transitions. [2018-12-08 19:20:21,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 19:20:21,962 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-12-08 19:20:21,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:20:21,985 INFO L225 Difference]: With dead ends: 14310 [2018-12-08 19:20:21,985 INFO L226 Difference]: Without dead ends: 11490 [2018-12-08 19:20:21,986 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 19:20:22,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11490 states. [2018-12-08 19:20:22,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11490 to 11490. [2018-12-08 19:20:22,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11490 states. [2018-12-08 19:20:22,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11490 states to 11490 states and 37855 transitions. [2018-12-08 19:20:22,113 INFO L78 Accepts]: Start accepts. Automaton has 11490 states and 37855 transitions. Word has length 47 [2018-12-08 19:20:22,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:20:22,114 INFO L480 AbstractCegarLoop]: Abstraction has 11490 states and 37855 transitions. [2018-12-08 19:20:22,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 19:20:22,114 INFO L276 IsEmpty]: Start isEmpty. Operand 11490 states and 37855 transitions. [2018-12-08 19:20:22,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-08 19:20:22,115 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:20:22,115 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 19:20:22,115 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:20:22,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:20:22,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1095203171, now seen corresponding path program 1 times [2018-12-08 19:20:22,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:20:22,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:20:22,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:20:22,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:20:22,117 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:20:22,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:20:22,181 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 19:20:22,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:20:22,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 19:20:22,181 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:20:22,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 19:20:22,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 19:20:22,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 19:20:22,181 INFO L87 Difference]: Start difference. First operand 11490 states and 37855 transitions. Second operand 5 states. [2018-12-08 19:20:22,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:20:22,454 INFO L93 Difference]: Finished difference Result 23360 states and 75856 transitions. [2018-12-08 19:20:22,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 19:20:22,454 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-12-08 19:20:22,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:20:22,487 INFO L225 Difference]: With dead ends: 23360 [2018-12-08 19:20:22,487 INFO L226 Difference]: Without dead ends: 23285 [2018-12-08 19:20:22,487 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 19:20:22,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23285 states. [2018-12-08 19:20:22,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23285 to 15417. [2018-12-08 19:20:22,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15417 states. [2018-12-08 19:20:22,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15417 states to 15417 states and 49310 transitions. [2018-12-08 19:20:22,709 INFO L78 Accepts]: Start accepts. Automaton has 15417 states and 49310 transitions. Word has length 48 [2018-12-08 19:20:22,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:20:22,710 INFO L480 AbstractCegarLoop]: Abstraction has 15417 states and 49310 transitions. [2018-12-08 19:20:22,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 19:20:22,710 INFO L276 IsEmpty]: Start isEmpty. Operand 15417 states and 49310 transitions. [2018-12-08 19:20:22,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-08 19:20:22,711 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:20:22,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] [2018-12-08 19:20:22,711 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:20:22,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:20:22,712 INFO L82 PathProgramCache]: Analyzing trace with hash 659319747, now seen corresponding path program 1 times [2018-12-08 19:20:22,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:20:22,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:20:22,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:20:22,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:20:22,714 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:20:22,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:20:22,740 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 19:20:22,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:20:22,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 19:20:22,741 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:20:22,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 19:20:22,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 19:20:22,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 19:20:22,741 INFO L87 Difference]: Start difference. First operand 15417 states and 49310 transitions. Second operand 3 states. [2018-12-08 19:20:22,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:20:22,948 INFO L93 Difference]: Finished difference Result 28677 states and 90548 transitions. [2018-12-08 19:20:22,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 19:20:22,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-08 19:20:22,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:20:22,986 INFO L225 Difference]: With dead ends: 28677 [2018-12-08 19:20:22,986 INFO L226 Difference]: Without dead ends: 28673 [2018-12-08 19:20:22,986 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 19:20:23,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28673 states. [2018-12-08 19:20:23,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28673 to 24152. [2018-12-08 19:20:23,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24152 states. [2018-12-08 19:20:23,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24152 states to 24152 states and 76316 transitions. [2018-12-08 19:20:23,262 INFO L78 Accepts]: Start accepts. Automaton has 24152 states and 76316 transitions. Word has length 50 [2018-12-08 19:20:23,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:20:23,262 INFO L480 AbstractCegarLoop]: Abstraction has 24152 states and 76316 transitions. [2018-12-08 19:20:23,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 19:20:23,262 INFO L276 IsEmpty]: Start isEmpty. Operand 24152 states and 76316 transitions. [2018-12-08 19:20:23,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-08 19:20:23,264 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:20:23,264 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] [2018-12-08 19:20:23,265 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:20:23,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:20:23,265 INFO L82 PathProgramCache]: Analyzing trace with hash 669168142, now seen corresponding path program 1 times [2018-12-08 19:20:23,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:20:23,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:20:23,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:20:23,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:20:23,266 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:20:23,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:20:23,313 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 19:20:23,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:20:23,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 19:20:23,313 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:20:23,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 19:20:23,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 19:20:23,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 19:20:23,314 INFO L87 Difference]: Start difference. First operand 24152 states and 76316 transitions. Second operand 6 states. [2018-12-08 19:20:23,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:20:23,710 INFO L93 Difference]: Finished difference Result 33838 states and 105314 transitions. [2018-12-08 19:20:23,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 19:20:23,711 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-12-08 19:20:23,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:20:23,753 INFO L225 Difference]: With dead ends: 33838 [2018-12-08 19:20:23,754 INFO L226 Difference]: Without dead ends: 33741 [2018-12-08 19:20:23,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-12-08 19:20:23,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33741 states. [2018-12-08 19:20:24,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33741 to 23973. [2018-12-08 19:20:24,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23973 states. [2018-12-08 19:20:24,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23973 states to 23973 states and 75822 transitions. [2018-12-08 19:20:24,072 INFO L78 Accepts]: Start accepts. Automaton has 23973 states and 75822 transitions. Word has length 54 [2018-12-08 19:20:24,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:20:24,072 INFO L480 AbstractCegarLoop]: Abstraction has 23973 states and 75822 transitions. [2018-12-08 19:20:24,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 19:20:24,072 INFO L276 IsEmpty]: Start isEmpty. Operand 23973 states and 75822 transitions. [2018-12-08 19:20:24,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-08 19:20:24,080 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:20:24,080 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 19:20:24,080 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:20:24,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:20:24,081 INFO L82 PathProgramCache]: Analyzing trace with hash -494140957, now seen corresponding path program 1 times [2018-12-08 19:20:24,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:20:24,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:20:24,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:20:24,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:20:24,083 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:20:24,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:20:24,132 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 19:20:24,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:20:24,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 19:20:24,133 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:20:24,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 19:20:24,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 19:20:24,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 19:20:24,134 INFO L87 Difference]: Start difference. First operand 23973 states and 75822 transitions. Second operand 4 states. [2018-12-08 19:20:24,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:20:24,320 INFO L93 Difference]: Finished difference Result 30737 states and 97932 transitions. [2018-12-08 19:20:24,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 19:20:24,320 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-08 19:20:24,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:20:24,360 INFO L225 Difference]: With dead ends: 30737 [2018-12-08 19:20:24,360 INFO L226 Difference]: Without dead ends: 30737 [2018-12-08 19:20:24,360 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 19:20:24,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30737 states. [2018-12-08 19:20:24,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30737 to 27609. [2018-12-08 19:20:24,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27609 states. [2018-12-08 19:20:24,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27609 states to 27609 states and 87450 transitions. [2018-12-08 19:20:24,770 INFO L78 Accepts]: Start accepts. Automaton has 27609 states and 87450 transitions. Word has length 64 [2018-12-08 19:20:24,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:20:24,771 INFO L480 AbstractCegarLoop]: Abstraction has 27609 states and 87450 transitions. [2018-12-08 19:20:24,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 19:20:24,771 INFO L276 IsEmpty]: Start isEmpty. Operand 27609 states and 87450 transitions. [2018-12-08 19:20:24,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-08 19:20:24,776 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:20:24,776 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:20:24,776 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:20:24,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:20:24,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1248669378, now seen corresponding path program 1 times [2018-12-08 19:20:24,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:20:24,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:20:24,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:20:24,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:20:24,778 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:20:24,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:20:24,829 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 19:20:24,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:20:24,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 19:20:24,830 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:20:24,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 19:20:24,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 19:20:24,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 19:20:24,830 INFO L87 Difference]: Start difference. First operand 27609 states and 87450 transitions. Second operand 6 states. [2018-12-08 19:20:25,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:20:25,419 INFO L93 Difference]: Finished difference Result 65702 states and 204771 transitions. [2018-12-08 19:20:25,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 19:20:25,420 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-12-08 19:20:25,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:20:25,510 INFO L225 Difference]: With dead ends: 65702 [2018-12-08 19:20:25,510 INFO L226 Difference]: Without dead ends: 65638 [2018-12-08 19:20:25,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-08 19:20:25,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65638 states. [2018-12-08 19:20:26,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65638 to 39277. [2018-12-08 19:20:26,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39277 states. [2018-12-08 19:20:26,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39277 states to 39277 states and 121531 transitions. [2018-12-08 19:20:26,091 INFO L78 Accepts]: Start accepts. Automaton has 39277 states and 121531 transitions. Word has length 64 [2018-12-08 19:20:26,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:20:26,091 INFO L480 AbstractCegarLoop]: Abstraction has 39277 states and 121531 transitions. [2018-12-08 19:20:26,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 19:20:26,092 INFO L276 IsEmpty]: Start isEmpty. Operand 39277 states and 121531 transitions. [2018-12-08 19:20:26,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-08 19:20:26,102 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:20:26,102 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:20:26,102 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:20:26,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:20:26,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1121736755, now seen corresponding path program 1 times [2018-12-08 19:20:26,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:20:26,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:20:26,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:20:26,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:20:26,104 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:20:26,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:20:26,132 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 19:20:26,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:20:26,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 19:20:26,132 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:20:26,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 19:20:26,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 19:20:26,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 19:20:26,133 INFO L87 Difference]: Start difference. First operand 39277 states and 121531 transitions. Second operand 3 states. [2018-12-08 19:20:26,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:20:26,270 INFO L93 Difference]: Finished difference Result 44930 states and 137016 transitions. [2018-12-08 19:20:26,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 19:20:26,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2018-12-08 19:20:26,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:20:26,325 INFO L225 Difference]: With dead ends: 44930 [2018-12-08 19:20:26,325 INFO L226 Difference]: Without dead ends: 44930 [2018-12-08 19:20:26,326 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 19:20:26,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44930 states. [2018-12-08 19:20:26,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44930 to 38917. [2018-12-08 19:20:26,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38917 states. [2018-12-08 19:20:26,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38917 states to 38917 states and 117881 transitions. [2018-12-08 19:20:26,816 INFO L78 Accepts]: Start accepts. Automaton has 38917 states and 117881 transitions. Word has length 70 [2018-12-08 19:20:26,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:20:26,816 INFO L480 AbstractCegarLoop]: Abstraction has 38917 states and 117881 transitions. [2018-12-08 19:20:26,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 19:20:26,816 INFO L276 IsEmpty]: Start isEmpty. Operand 38917 states and 117881 transitions. [2018-12-08 19:20:26,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-08 19:20:26,828 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:20:26,828 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] [2018-12-08 19:20:26,829 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:20:26,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:20:26,829 INFO L82 PathProgramCache]: Analyzing trace with hash -730730463, now seen corresponding path program 1 times [2018-12-08 19:20:26,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:20:26,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:20:26,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:20:26,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:20:26,830 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:20:26,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:20:26,900 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 19:20:26,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:20:26,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 19:20:26,901 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:20:26,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 19:20:26,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 19:20:26,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-08 19:20:26,901 INFO L87 Difference]: Start difference. First operand 38917 states and 117881 transitions. Second operand 7 states. [2018-12-08 19:20:27,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:20:27,805 INFO L93 Difference]: Finished difference Result 48545 states and 147167 transitions. [2018-12-08 19:20:27,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 19:20:27,805 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2018-12-08 19:20:27,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:20:27,875 INFO L225 Difference]: With dead ends: 48545 [2018-12-08 19:20:27,875 INFO L226 Difference]: Without dead ends: 48545 [2018-12-08 19:20:27,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-12-08 19:20:28,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48545 states. [2018-12-08 19:20:28,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48545 to 45065. [2018-12-08 19:20:28,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45065 states. [2018-12-08 19:20:28,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45065 states to 45065 states and 136967 transitions. [2018-12-08 19:20:28,421 INFO L78 Accepts]: Start accepts. Automaton has 45065 states and 136967 transitions. Word has length 71 [2018-12-08 19:20:28,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:20:28,421 INFO L480 AbstractCegarLoop]: Abstraction has 45065 states and 136967 transitions. [2018-12-08 19:20:28,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 19:20:28,421 INFO L276 IsEmpty]: Start isEmpty. Operand 45065 states and 136967 transitions. [2018-12-08 19:20:28,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-08 19:20:28,435 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:20:28,435 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] [2018-12-08 19:20:28,435 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:20:28,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:20:28,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1767285474, now seen corresponding path program 1 times [2018-12-08 19:20:28,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:20:28,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:20:28,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:20:28,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:20:28,437 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:20:28,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:20:28,475 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 19:20:28,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:20:28,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 19:20:28,475 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:20:28,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 19:20:28,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 19:20:28,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 19:20:28,476 INFO L87 Difference]: Start difference. First operand 45065 states and 136967 transitions. Second operand 5 states. [2018-12-08 19:20:28,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:20:28,531 INFO L93 Difference]: Finished difference Result 13109 states and 33092 transitions. [2018-12-08 19:20:28,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 19:20:28,531 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2018-12-08 19:20:28,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:20:28,539 INFO L225 Difference]: With dead ends: 13109 [2018-12-08 19:20:28,539 INFO L226 Difference]: Without dead ends: 10985 [2018-12-08 19:20:28,540 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 19:20:28,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10985 states. [2018-12-08 19:20:28,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10985 to 8180. [2018-12-08 19:20:28,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8180 states. [2018-12-08 19:20:28,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8180 states to 8180 states and 20398 transitions. [2018-12-08 19:20:28,615 INFO L78 Accepts]: Start accepts. Automaton has 8180 states and 20398 transitions. Word has length 71 [2018-12-08 19:20:28,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:20:28,615 INFO L480 AbstractCegarLoop]: Abstraction has 8180 states and 20398 transitions. [2018-12-08 19:20:28,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 19:20:28,615 INFO L276 IsEmpty]: Start isEmpty. Operand 8180 states and 20398 transitions. [2018-12-08 19:20:28,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-08 19:20:28,622 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:20:28,622 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:20:28,623 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:20:28,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:20:28,623 INFO L82 PathProgramCache]: Analyzing trace with hash -771267100, now seen corresponding path program 1 times [2018-12-08 19:20:28,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:20:28,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:20:28,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:20:28,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:20:28,624 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:20:28,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:20:28,682 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 19:20:28,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:20:28,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 19:20:28,683 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:20:28,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 19:20:28,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 19:20:28,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 19:20:28,683 INFO L87 Difference]: Start difference. First operand 8180 states and 20398 transitions. Second operand 4 states. [2018-12-08 19:20:28,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:20:28,822 INFO L93 Difference]: Finished difference Result 9531 states and 23362 transitions. [2018-12-08 19:20:28,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 19:20:28,822 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2018-12-08 19:20:28,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:20:28,829 INFO L225 Difference]: With dead ends: 9531 [2018-12-08 19:20:28,829 INFO L226 Difference]: Without dead ends: 9531 [2018-12-08 19:20:28,829 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 19:20:28,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9531 states. [2018-12-08 19:20:28,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9531 to 9028. [2018-12-08 19:20:28,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9028 states. [2018-12-08 19:20:28,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9028 states to 9028 states and 22245 transitions. [2018-12-08 19:20:28,900 INFO L78 Accepts]: Start accepts. Automaton has 9028 states and 22245 transitions. Word has length 99 [2018-12-08 19:20:28,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:20:28,900 INFO L480 AbstractCegarLoop]: Abstraction has 9028 states and 22245 transitions. [2018-12-08 19:20:28,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 19:20:28,900 INFO L276 IsEmpty]: Start isEmpty. Operand 9028 states and 22245 transitions. [2018-12-08 19:20:28,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-08 19:20:28,908 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:20:28,908 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:20:28,908 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:20:28,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:20:28,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1446490853, now seen corresponding path program 1 times [2018-12-08 19:20:28,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:20:28,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:20:28,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:20:28,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:20:28,910 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:20:28,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:20:28,937 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 19:20:28,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:20:28,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 19:20:28,937 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:20:28,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 19:20:28,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 19:20:28,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 19:20:28,938 INFO L87 Difference]: Start difference. First operand 9028 states and 22245 transitions. Second operand 3 states. [2018-12-08 19:20:29,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:20:29,059 INFO L93 Difference]: Finished difference Result 12279 states and 29754 transitions. [2018-12-08 19:20:29,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 19:20:29,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2018-12-08 19:20:29,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:20:29,068 INFO L225 Difference]: With dead ends: 12279 [2018-12-08 19:20:29,068 INFO L226 Difference]: Without dead ends: 12279 [2018-12-08 19:20:29,069 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 19:20:29,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12279 states. [2018-12-08 19:20:29,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12279 to 11108. [2018-12-08 19:20:29,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11108 states. [2018-12-08 19:20:29,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11108 states to 11108 states and 27145 transitions. [2018-12-08 19:20:29,158 INFO L78 Accepts]: Start accepts. Automaton has 11108 states and 27145 transitions. Word has length 99 [2018-12-08 19:20:29,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:20:29,158 INFO L480 AbstractCegarLoop]: Abstraction has 11108 states and 27145 transitions. [2018-12-08 19:20:29,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 19:20:29,159 INFO L276 IsEmpty]: Start isEmpty. Operand 11108 states and 27145 transitions. [2018-12-08 19:20:29,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-08 19:20:29,166 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:20:29,166 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:20:29,166 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:20:29,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:20:29,166 INFO L82 PathProgramCache]: Analyzing trace with hash 547986639, now seen corresponding path program 2 times [2018-12-08 19:20:29,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:20:29,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:20:29,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:20:29,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:20:29,168 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:20:29,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:20:29,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 19:20:29,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:20:29,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 19:20:29,213 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:20:29,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 19:20:29,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 19:20:29,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 19:20:29,213 INFO L87 Difference]: Start difference. First operand 11108 states and 27145 transitions. Second operand 5 states. [2018-12-08 19:20:29,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:20:29,419 INFO L93 Difference]: Finished difference Result 13175 states and 31571 transitions. [2018-12-08 19:20:29,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 19:20:29,419 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2018-12-08 19:20:29,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:20:29,429 INFO L225 Difference]: With dead ends: 13175 [2018-12-08 19:20:29,429 INFO L226 Difference]: Without dead ends: 13175 [2018-12-08 19:20:29,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-08 19:20:29,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13175 states. [2018-12-08 19:20:29,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13175 to 11735. [2018-12-08 19:20:29,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11735 states. [2018-12-08 19:20:29,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11735 states to 11735 states and 28445 transitions. [2018-12-08 19:20:29,524 INFO L78 Accepts]: Start accepts. Automaton has 11735 states and 28445 transitions. Word has length 99 [2018-12-08 19:20:29,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:20:29,525 INFO L480 AbstractCegarLoop]: Abstraction has 11735 states and 28445 transitions. [2018-12-08 19:20:29,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 19:20:29,525 INFO L276 IsEmpty]: Start isEmpty. Operand 11735 states and 28445 transitions. [2018-12-08 19:20:29,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-08 19:20:29,533 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:20:29,533 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:20:29,534 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:20:29,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:20:29,534 INFO L82 PathProgramCache]: Analyzing trace with hash -347787469, now seen corresponding path program 3 times [2018-12-08 19:20:29,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:20:29,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:20:29,535 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 19:20:29,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:20:29,535 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:20:29,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:20:29,591 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 19:20:29,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:20:29,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 19:20:29,591 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:20:29,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 19:20:29,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 19:20:29,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 19:20:29,592 INFO L87 Difference]: Start difference. First operand 11735 states and 28445 transitions. Second operand 6 states. [2018-12-08 19:20:29,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:20:29,832 INFO L93 Difference]: Finished difference Result 14380 states and 34262 transitions. [2018-12-08 19:20:29,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 19:20:29,833 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2018-12-08 19:20:29,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:20:29,842 INFO L225 Difference]: With dead ends: 14380 [2018-12-08 19:20:29,842 INFO L226 Difference]: Without dead ends: 14380 [2018-12-08 19:20:29,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-08 19:20:29,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14380 states. [2018-12-08 19:20:29,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14380 to 11533. [2018-12-08 19:20:29,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11533 states. [2018-12-08 19:20:29,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11533 states to 11533 states and 27501 transitions. [2018-12-08 19:20:29,944 INFO L78 Accepts]: Start accepts. Automaton has 11533 states and 27501 transitions. Word has length 99 [2018-12-08 19:20:29,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:20:29,945 INFO L480 AbstractCegarLoop]: Abstraction has 11533 states and 27501 transitions. [2018-12-08 19:20:29,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 19:20:29,945 INFO L276 IsEmpty]: Start isEmpty. Operand 11533 states and 27501 transitions. [2018-12-08 19:20:29,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-08 19:20:29,953 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:20:29,953 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:20:29,953 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:20:29,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:20:29,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1518564844, now seen corresponding path program 1 times [2018-12-08 19:20:29,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:20:29,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:20:29,955 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 19:20:29,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:20:29,955 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:20:29,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:20:30,000 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 19:20:30,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:20:30,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 19:20:30,001 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:20:30,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 19:20:30,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 19:20:30,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 19:20:30,002 INFO L87 Difference]: Start difference. First operand 11533 states and 27501 transitions. Second operand 5 states. [2018-12-08 19:20:30,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:20:30,166 INFO L93 Difference]: Finished difference Result 12356 states and 29202 transitions. [2018-12-08 19:20:30,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 19:20:30,167 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2018-12-08 19:20:30,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:20:30,175 INFO L225 Difference]: With dead ends: 12356 [2018-12-08 19:20:30,175 INFO L226 Difference]: Without dead ends: 12356 [2018-12-08 19:20:30,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-08 19:20:30,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12356 states. [2018-12-08 19:20:30,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12356 to 11700. [2018-12-08 19:20:30,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11700 states. [2018-12-08 19:20:30,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11700 states to 11700 states and 27858 transitions. [2018-12-08 19:20:30,270 INFO L78 Accepts]: Start accepts. Automaton has 11700 states and 27858 transitions. Word has length 101 [2018-12-08 19:20:30,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:20:30,270 INFO L480 AbstractCegarLoop]: Abstraction has 11700 states and 27858 transitions. [2018-12-08 19:20:30,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 19:20:30,270 INFO L276 IsEmpty]: Start isEmpty. Operand 11700 states and 27858 transitions. [2018-12-08 19:20:30,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-08 19:20:30,280 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:20:30,280 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:20:30,280 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:20:30,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:20:30,281 INFO L82 PathProgramCache]: Analyzing trace with hash -443547866, now seen corresponding path program 1 times [2018-12-08 19:20:30,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:20:30,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:20:30,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:20:30,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:20:30,282 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:20:30,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:20:30,332 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 19:20:30,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:20:30,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 19:20:30,333 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:20:30,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 19:20:30,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 19:20:30,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 19:20:30,333 INFO L87 Difference]: Start difference. First operand 11700 states and 27858 transitions. Second operand 5 states. [2018-12-08 19:20:30,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:20:30,519 INFO L93 Difference]: Finished difference Result 14260 states and 34245 transitions. [2018-12-08 19:20:30,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 19:20:30,520 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2018-12-08 19:20:30,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:20:30,529 INFO L225 Difference]: With dead ends: 14260 [2018-12-08 19:20:30,529 INFO L226 Difference]: Without dead ends: 14260 [2018-12-08 19:20:30,530 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 19:20:30,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14260 states. [2018-12-08 19:20:30,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14260 to 12757. [2018-12-08 19:20:30,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12757 states. [2018-12-08 19:20:30,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12757 states to 12757 states and 30522 transitions. [2018-12-08 19:20:30,648 INFO L78 Accepts]: Start accepts. Automaton has 12757 states and 30522 transitions. Word has length 101 [2018-12-08 19:20:30,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:20:30,648 INFO L480 AbstractCegarLoop]: Abstraction has 12757 states and 30522 transitions. [2018-12-08 19:20:30,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 19:20:30,648 INFO L276 IsEmpty]: Start isEmpty. Operand 12757 states and 30522 transitions. [2018-12-08 19:20:30,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-08 19:20:30,659 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:20:30,659 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:20:30,659 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:20:30,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:20:30,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1281933031, now seen corresponding path program 1 times [2018-12-08 19:20:30,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:20:30,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:20:30,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:20:30,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:20:30,660 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:20:30,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:20:30,704 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 19:20:30,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:20:30,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 19:20:30,704 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:20:30,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 19:20:30,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 19:20:30,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 19:20:30,705 INFO L87 Difference]: Start difference. First operand 12757 states and 30522 transitions. Second operand 6 states. [2018-12-08 19:20:30,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:20:30,932 INFO L93 Difference]: Finished difference Result 14167 states and 33586 transitions. [2018-12-08 19:20:30,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 19:20:30,932 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2018-12-08 19:20:30,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:20:30,942 INFO L225 Difference]: With dead ends: 14167 [2018-12-08 19:20:30,942 INFO L226 Difference]: Without dead ends: 14167 [2018-12-08 19:20:30,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-08 19:20:30,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14167 states. [2018-12-08 19:20:31,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14167 to 12757. [2018-12-08 19:20:31,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12757 states. [2018-12-08 19:20:31,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12757 states to 12757 states and 30522 transitions. [2018-12-08 19:20:31,053 INFO L78 Accepts]: Start accepts. Automaton has 12757 states and 30522 transitions. Word has length 101 [2018-12-08 19:20:31,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:20:31,053 INFO L480 AbstractCegarLoop]: Abstraction has 12757 states and 30522 transitions. [2018-12-08 19:20:31,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 19:20:31,054 INFO L276 IsEmpty]: Start isEmpty. Operand 12757 states and 30522 transitions. [2018-12-08 19:20:31,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-08 19:20:31,063 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:20:31,063 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:20:31,063 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:20:31,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:20:31,064 INFO L82 PathProgramCache]: Analyzing trace with hash 117568751, now seen corresponding path program 1 times [2018-12-08 19:20:31,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:20:31,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:20:31,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:20:31,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:20:31,065 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:20:31,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:20:31,132 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 19:20:31,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:20:31,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 19:20:31,132 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:20:31,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 19:20:31,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 19:20:31,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-08 19:20:31,133 INFO L87 Difference]: Start difference. First operand 12757 states and 30522 transitions. Second operand 8 states. [2018-12-08 19:20:31,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:20:31,595 INFO L93 Difference]: Finished difference Result 16512 states and 39446 transitions. [2018-12-08 19:20:31,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 19:20:31,596 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 101 [2018-12-08 19:20:31,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:20:31,611 INFO L225 Difference]: With dead ends: 16512 [2018-12-08 19:20:31,611 INFO L226 Difference]: Without dead ends: 16480 [2018-12-08 19:20:31,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-12-08 19:20:31,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16480 states. [2018-12-08 19:20:31,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16480 to 13492. [2018-12-08 19:20:31,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13492 states. [2018-12-08 19:20:31,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13492 states to 13492 states and 32328 transitions. [2018-12-08 19:20:31,732 INFO L78 Accepts]: Start accepts. Automaton has 13492 states and 32328 transitions. Word has length 101 [2018-12-08 19:20:31,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:20:31,732 INFO L480 AbstractCegarLoop]: Abstraction has 13492 states and 32328 transitions. [2018-12-08 19:20:31,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 19:20:31,732 INFO L276 IsEmpty]: Start isEmpty. Operand 13492 states and 32328 transitions. [2018-12-08 19:20:31,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-08 19:20:31,741 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:20:31,741 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:20:31,741 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:20:31,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:20:31,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1679382608, now seen corresponding path program 1 times [2018-12-08 19:20:31,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:20:31,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:20:31,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:20:31,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:20:31,742 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:20:31,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:20:31,770 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 19:20:31,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:20:31,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 19:20:31,771 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:20:31,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 19:20:31,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 19:20:31,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 19:20:31,771 INFO L87 Difference]: Start difference. First operand 13492 states and 32328 transitions. Second operand 3 states. [2018-12-08 19:20:31,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:20:31,812 INFO L93 Difference]: Finished difference Result 15849 states and 37694 transitions. [2018-12-08 19:20:31,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 19:20:31,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2018-12-08 19:20:31,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:20:31,828 INFO L225 Difference]: With dead ends: 15849 [2018-12-08 19:20:31,828 INFO L226 Difference]: Without dead ends: 15849 [2018-12-08 19:20:31,829 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 19:20:31,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15849 states. [2018-12-08 19:20:31,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15849 to 15786. [2018-12-08 19:20:31,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15786 states. [2018-12-08 19:20:31,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15786 states to 15786 states and 37564 transitions. [2018-12-08 19:20:31,963 INFO L78 Accepts]: Start accepts. Automaton has 15786 states and 37564 transitions. Word has length 101 [2018-12-08 19:20:31,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:20:31,963 INFO L480 AbstractCegarLoop]: Abstraction has 15786 states and 37564 transitions. [2018-12-08 19:20:31,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 19:20:31,964 INFO L276 IsEmpty]: Start isEmpty. Operand 15786 states and 37564 transitions. [2018-12-08 19:20:31,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-08 19:20:31,974 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:20:31,974 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:20:31,974 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:20:31,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:20:31,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1771112817, now seen corresponding path program 1 times [2018-12-08 19:20:31,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:20:31,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:20:31,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:20:31,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:20:31,976 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:20:31,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:20:32,045 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 19:20:32,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:20:32,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 19:20:32,045 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:20:32,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 19:20:32,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 19:20:32,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-08 19:20:32,046 INFO L87 Difference]: Start difference. First operand 15786 states and 37564 transitions. Second operand 7 states. [2018-12-08 19:20:32,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:20:32,161 INFO L93 Difference]: Finished difference Result 20166 states and 48195 transitions. [2018-12-08 19:20:32,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 19:20:32,161 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 101 [2018-12-08 19:20:32,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:20:32,176 INFO L225 Difference]: With dead ends: 20166 [2018-12-08 19:20:32,177 INFO L226 Difference]: Without dead ends: 20166 [2018-12-08 19:20:32,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-08 19:20:32,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20166 states. [2018-12-08 19:20:32,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20166 to 16914. [2018-12-08 19:20:32,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16914 states. [2018-12-08 19:20:32,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16914 states to 16914 states and 40509 transitions. [2018-12-08 19:20:32,332 INFO L78 Accepts]: Start accepts. Automaton has 16914 states and 40509 transitions. Word has length 101 [2018-12-08 19:20:32,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:20:32,332 INFO L480 AbstractCegarLoop]: Abstraction has 16914 states and 40509 transitions. [2018-12-08 19:20:32,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 19:20:32,333 INFO L276 IsEmpty]: Start isEmpty. Operand 16914 states and 40509 transitions. [2018-12-08 19:20:32,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-08 19:20:32,343 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:20:32,343 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:20:32,344 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:20:32,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:20:32,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1802132624, now seen corresponding path program 1 times [2018-12-08 19:20:32,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:20:32,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:20:32,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:20:32,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:20:32,345 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:20:32,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:20:32,372 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 19:20:32,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:20:32,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 19:20:32,373 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:20:32,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 19:20:32,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 19:20:32,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 19:20:32,373 INFO L87 Difference]: Start difference. First operand 16914 states and 40509 transitions. Second operand 3 states. [2018-12-08 19:20:32,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:20:32,414 INFO L93 Difference]: Finished difference Result 16850 states and 40253 transitions. [2018-12-08 19:20:32,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 19:20:32,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2018-12-08 19:20:32,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:20:32,427 INFO L225 Difference]: With dead ends: 16850 [2018-12-08 19:20:32,427 INFO L226 Difference]: Without dead ends: 16818 [2018-12-08 19:20:32,427 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 19:20:32,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16818 states. [2018-12-08 19:20:32,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16818 to 15495. [2018-12-08 19:20:32,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15495 states. [2018-12-08 19:20:32,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15495 states to 15495 states and 37168 transitions. [2018-12-08 19:20:32,564 INFO L78 Accepts]: Start accepts. Automaton has 15495 states and 37168 transitions. Word has length 101 [2018-12-08 19:20:32,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:20:32,564 INFO L480 AbstractCegarLoop]: Abstraction has 15495 states and 37168 transitions. [2018-12-08 19:20:32,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 19:20:32,564 INFO L276 IsEmpty]: Start isEmpty. Operand 15495 states and 37168 transitions. [2018-12-08 19:20:32,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-08 19:20:32,575 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:20:32,576 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:20:32,576 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:20:32,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:20:32,576 INFO L82 PathProgramCache]: Analyzing trace with hash -2122277356, now seen corresponding path program 1 times [2018-12-08 19:20:32,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:20:32,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:20:32,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:20:32,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:20:32,577 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:20:32,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:20:32,650 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 19:20:32,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:20:32,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 19:20:32,650 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:20:32,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 19:20:32,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 19:20:32,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-08 19:20:32,651 INFO L87 Difference]: Start difference. First operand 15495 states and 37168 transitions. Second operand 7 states. [2018-12-08 19:20:32,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:20:32,933 INFO L93 Difference]: Finished difference Result 20526 states and 47993 transitions. [2018-12-08 19:20:32,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 19:20:32,933 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2018-12-08 19:20:32,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:20:32,948 INFO L225 Difference]: With dead ends: 20526 [2018-12-08 19:20:32,948 INFO L226 Difference]: Without dead ends: 20385 [2018-12-08 19:20:32,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-08 19:20:32,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20385 states. [2018-12-08 19:20:33,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20385 to 16141. [2018-12-08 19:20:33,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16141 states. [2018-12-08 19:20:33,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16141 states to 16141 states and 38270 transitions. [2018-12-08 19:20:33,102 INFO L78 Accepts]: Start accepts. Automaton has 16141 states and 38270 transitions. Word has length 103 [2018-12-08 19:20:33,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:20:33,102 INFO L480 AbstractCegarLoop]: Abstraction has 16141 states and 38270 transitions. [2018-12-08 19:20:33,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 19:20:33,102 INFO L276 IsEmpty]: Start isEmpty. Operand 16141 states and 38270 transitions. [2018-12-08 19:20:33,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-08 19:20:33,114 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:20:33,114 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:20:33,114 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:20:33,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:20:33,115 INFO L82 PathProgramCache]: Analyzing trace with hash 95480597, now seen corresponding path program 1 times [2018-12-08 19:20:33,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:20:33,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:20:33,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:20:33,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:20:33,116 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:20:33,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:20:33,166 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 19:20:33,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:20:33,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 19:20:33,167 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:20:33,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 19:20:33,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 19:20:33,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 19:20:33,167 INFO L87 Difference]: Start difference. First operand 16141 states and 38270 transitions. Second operand 7 states. [2018-12-08 19:20:33,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:20:33,480 INFO L93 Difference]: Finished difference Result 20352 states and 46837 transitions. [2018-12-08 19:20:33,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 19:20:33,481 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2018-12-08 19:20:33,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:20:33,494 INFO L225 Difference]: With dead ends: 20352 [2018-12-08 19:20:33,494 INFO L226 Difference]: Without dead ends: 20352 [2018-12-08 19:20:33,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-12-08 19:20:33,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20352 states. [2018-12-08 19:20:33,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20352 to 17513. [2018-12-08 19:20:33,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17513 states. [2018-12-08 19:20:33,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17513 states to 17513 states and 40871 transitions. [2018-12-08 19:20:33,664 INFO L78 Accepts]: Start accepts. Automaton has 17513 states and 40871 transitions. Word has length 103 [2018-12-08 19:20:33,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:20:33,664 INFO L480 AbstractCegarLoop]: Abstraction has 17513 states and 40871 transitions. [2018-12-08 19:20:33,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 19:20:33,664 INFO L276 IsEmpty]: Start isEmpty. Operand 17513 states and 40871 transitions. [2018-12-08 19:20:33,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-08 19:20:33,679 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:20:33,679 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:20:33,679 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:20:33,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:20:33,679 INFO L82 PathProgramCache]: Analyzing trace with hash 306831510, now seen corresponding path program 1 times [2018-12-08 19:20:33,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:20:33,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:20:33,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:20:33,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:20:33,681 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:20:33,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:20:33,738 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 19:20:33,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:20:33,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 19:20:33,738 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:20:33,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 19:20:33,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 19:20:33,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 19:20:33,739 INFO L87 Difference]: Start difference. First operand 17513 states and 40871 transitions. Second operand 7 states. [2018-12-08 19:20:34,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:20:34,240 INFO L93 Difference]: Finished difference Result 24766 states and 56995 transitions. [2018-12-08 19:20:34,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-08 19:20:34,241 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2018-12-08 19:20:34,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:20:34,258 INFO L225 Difference]: With dead ends: 24766 [2018-12-08 19:20:34,258 INFO L226 Difference]: Without dead ends: 24766 [2018-12-08 19:20:34,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2018-12-08 19:20:34,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24766 states. [2018-12-08 19:20:34,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24766 to 20604. [2018-12-08 19:20:34,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20604 states. [2018-12-08 19:20:34,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20604 states to 20604 states and 47919 transitions. [2018-12-08 19:20:34,533 INFO L78 Accepts]: Start accepts. Automaton has 20604 states and 47919 transitions. Word has length 103 [2018-12-08 19:20:34,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:20:34,533 INFO L480 AbstractCegarLoop]: Abstraction has 20604 states and 47919 transitions. [2018-12-08 19:20:34,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 19:20:34,533 INFO L276 IsEmpty]: Start isEmpty. Operand 20604 states and 47919 transitions. [2018-12-08 19:20:34,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-08 19:20:34,545 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:20:34,545 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:20:34,545 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:20:34,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:20:34,545 INFO L82 PathProgramCache]: Analyzing trace with hash -203702667, now seen corresponding path program 1 times [2018-12-08 19:20:34,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:20:34,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:20:34,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:20:34,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:20:34,546 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:20:34,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:20:34,570 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 19:20:34,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:20:34,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 19:20:34,571 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:20:34,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 19:20:34,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 19:20:34,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 19:20:34,571 INFO L87 Difference]: Start difference. First operand 20604 states and 47919 transitions. Second operand 4 states. [2018-12-08 19:20:34,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:20:34,703 INFO L93 Difference]: Finished difference Result 20748 states and 48279 transitions. [2018-12-08 19:20:34,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 19:20:34,703 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2018-12-08 19:20:34,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:20:34,718 INFO L225 Difference]: With dead ends: 20748 [2018-12-08 19:20:34,718 INFO L226 Difference]: Without dead ends: 20716 [2018-12-08 19:20:34,718 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 19:20:34,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20716 states. [2018-12-08 19:20:34,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20716 to 20207. [2018-12-08 19:20:34,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20207 states. [2018-12-08 19:20:34,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20207 states to 20207 states and 47007 transitions. [2018-12-08 19:20:34,891 INFO L78 Accepts]: Start accepts. Automaton has 20207 states and 47007 transitions. Word has length 103 [2018-12-08 19:20:34,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:20:34,891 INFO L480 AbstractCegarLoop]: Abstraction has 20207 states and 47007 transitions. [2018-12-08 19:20:34,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 19:20:34,892 INFO L276 IsEmpty]: Start isEmpty. Operand 20207 states and 47007 transitions. [2018-12-08 19:20:34,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-08 19:20:34,907 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:20:34,907 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:20:34,907 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:20:34,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:20:34,907 INFO L82 PathProgramCache]: Analyzing trace with hash -2000654026, now seen corresponding path program 1 times [2018-12-08 19:20:34,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:20:34,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:20:34,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:20:34,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:20:34,909 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:20:34,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:20:34,991 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 19:20:34,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:20:34,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-08 19:20:34,991 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:20:34,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 19:20:34,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 19:20:34,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-08 19:20:34,992 INFO L87 Difference]: Start difference. First operand 20207 states and 47007 transitions. Second operand 10 states. [2018-12-08 19:20:35,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:20:35,333 INFO L93 Difference]: Finished difference Result 22653 states and 52665 transitions. [2018-12-08 19:20:35,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 19:20:35,333 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 103 [2018-12-08 19:20:35,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:20:35,336 INFO L225 Difference]: With dead ends: 22653 [2018-12-08 19:20:35,337 INFO L226 Difference]: Without dead ends: 4088 [2018-12-08 19:20:35,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2018-12-08 19:20:35,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4088 states. [2018-12-08 19:20:35,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4088 to 4086. [2018-12-08 19:20:35,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4086 states. [2018-12-08 19:20:35,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4086 states to 4086 states and 9694 transitions. [2018-12-08 19:20:35,364 INFO L78 Accepts]: Start accepts. Automaton has 4086 states and 9694 transitions. Word has length 103 [2018-12-08 19:20:35,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:20:35,364 INFO L480 AbstractCegarLoop]: Abstraction has 4086 states and 9694 transitions. [2018-12-08 19:20:35,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 19:20:35,364 INFO L276 IsEmpty]: Start isEmpty. Operand 4086 states and 9694 transitions. [2018-12-08 19:20:35,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-08 19:20:35,367 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:20:35,367 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:20:35,367 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:20:35,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:20:35,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1488163213, now seen corresponding path program 1 times [2018-12-08 19:20:35,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:20:35,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:20:35,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:20:35,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:20:35,368 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:20:35,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:20:35,423 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 19:20:35,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:20:35,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 19:20:35,423 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:20:35,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 19:20:35,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 19:20:35,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 19:20:35,423 INFO L87 Difference]: Start difference. First operand 4086 states and 9694 transitions. Second operand 7 states. [2018-12-08 19:20:35,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:20:35,594 INFO L93 Difference]: Finished difference Result 4450 states and 10556 transitions. [2018-12-08 19:20:35,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 19:20:35,594 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2018-12-08 19:20:35,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:20:35,597 INFO L225 Difference]: With dead ends: 4450 [2018-12-08 19:20:35,597 INFO L226 Difference]: Without dead ends: 4450 [2018-12-08 19:20:35,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-08 19:20:35,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4450 states. [2018-12-08 19:20:35,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4450 to 4028. [2018-12-08 19:20:35,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4028 states. [2018-12-08 19:20:35,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4028 states to 4028 states and 9576 transitions. [2018-12-08 19:20:35,624 INFO L78 Accepts]: Start accepts. Automaton has 4028 states and 9576 transitions. Word has length 103 [2018-12-08 19:20:35,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:20:35,624 INFO L480 AbstractCegarLoop]: Abstraction has 4028 states and 9576 transitions. [2018-12-08 19:20:35,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 19:20:35,624 INFO L276 IsEmpty]: Start isEmpty. Operand 4028 states and 9576 transitions. [2018-12-08 19:20:35,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-08 19:20:35,626 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:20:35,626 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:20:35,626 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:20:35,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:20:35,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1345224084, now seen corresponding path program 2 times [2018-12-08 19:20:35,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:20:35,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:20:35,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:20:35,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:20:35,628 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:20:35,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:20:35,738 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 19:20:35,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:20:35,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-08 19:20:35,739 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:20:35,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-08 19:20:35,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-08 19:20:35,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-12-08 19:20:35,739 INFO L87 Difference]: Start difference. First operand 4028 states and 9576 transitions. Second operand 13 states. [2018-12-08 19:20:36,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:20:36,147 INFO L93 Difference]: Finished difference Result 6328 states and 14778 transitions. [2018-12-08 19:20:36,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-08 19:20:36,147 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 103 [2018-12-08 19:20:36,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:20:36,150 INFO L225 Difference]: With dead ends: 6328 [2018-12-08 19:20:36,150 INFO L226 Difference]: Without dead ends: 4567 [2018-12-08 19:20:36,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2018-12-08 19:20:36,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4567 states. [2018-12-08 19:20:36,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4567 to 4079. [2018-12-08 19:20:36,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4079 states. [2018-12-08 19:20:36,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4079 states to 4079 states and 9631 transitions. [2018-12-08 19:20:36,177 INFO L78 Accepts]: Start accepts. Automaton has 4079 states and 9631 transitions. Word has length 103 [2018-12-08 19:20:36,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:20:36,177 INFO L480 AbstractCegarLoop]: Abstraction has 4079 states and 9631 transitions. [2018-12-08 19:20:36,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-08 19:20:36,178 INFO L276 IsEmpty]: Start isEmpty. Operand 4079 states and 9631 transitions. [2018-12-08 19:20:36,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-08 19:20:36,180 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:20:36,180 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:20:36,180 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:20:36,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:20:36,180 INFO L82 PathProgramCache]: Analyzing trace with hash -932371670, now seen corresponding path program 3 times [2018-12-08 19:20:36,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:20:36,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:20:36,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 19:20:36,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:20:36,181 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:20:36,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 19:20:36,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 19:20:36,227 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-08 19:20:36,318 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-08 19:20:36,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 07:20:36 BasicIcfg [2018-12-08 19:20:36,319 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 19:20:36,320 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 19:20:36,320 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 19:20:36,320 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 19:20:36,320 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 07:20:12" (3/4) ... [2018-12-08 19:20:36,322 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-08 19:20:36,401 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_630a1e69-0814-4998-a110-5a991ca09305/bin-2019/utaipan/witness.graphml [2018-12-08 19:20:36,401 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 19:20:36,401 INFO L168 Benchmark]: Toolchain (without parser) took 24551.54 ms. Allocated memory was 1.0 GB in the beginning and 3.4 GB in the end (delta: 2.4 GB). Free memory was 948.1 MB in the beginning and 1.9 GB in the end (delta: -935.9 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2018-12-08 19:20:36,402 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 19:20:36,402 INFO L168 Benchmark]: CACSL2BoogieTranslator took 363.76 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -139.9 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. [2018-12-08 19:20:36,402 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.90 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-08 19:20:36,403 INFO L168 Benchmark]: Boogie Preprocessor took 20.46 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-08 19:20:36,403 INFO L168 Benchmark]: RCFGBuilder took 366.79 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 52.0 MB). Peak memory consumption was 52.0 MB. Max. memory is 11.5 GB. [2018-12-08 19:20:36,403 INFO L168 Benchmark]: TraceAbstraction took 23675.30 ms. Allocated memory was 1.1 GB in the beginning and 3.4 GB in the end (delta: 2.3 GB). Free memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: -899.7 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2018-12-08 19:20:36,403 INFO L168 Benchmark]: Witness Printer took 81.26 ms. Allocated memory is still 3.4 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 11.5 GB. [2018-12-08 19:20:36,404 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 363.76 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -139.9 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.90 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.46 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 366.79 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 52.0 MB). Peak memory consumption was 52.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 23675.30 ms. Allocated memory was 1.1 GB in the beginning and 3.4 GB in the end (delta: 2.3 GB). Free memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: -899.7 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 81.26 ms. Allocated memory is still 3.4 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L678] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L680] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L681] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L682] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L684] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L685] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L686] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L687] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L688] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L689] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L690] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L691] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L692] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L693] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L694] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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}] [L695] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L696] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L697] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L698] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L700] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L701] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L702] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L789] -1 pthread_t t14; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L790] FCALL, FORK -1 pthread_create(&t14, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=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] [L791] -1 pthread_t t15; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=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] [L792] FCALL, FORK -1 pthread_create(&t15, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=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] [L737] 0 x$w_buff1 = x$w_buff0 [L738] 0 x$w_buff0 = 1 [L739] 0 x$w_buff1_used = x$w_buff0_used [L740] 0 x$w_buff0_used = (_Bool)1 [L5] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=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] [L742] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L743] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L744] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L745] 0 x$r_buff0_thd2 = (_Bool)1 [L748] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L749] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L750] 0 x$flush_delayed = weak$$choice2 [L751] 0 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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] [L752] EXPR 0 !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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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] [L752] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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] [L752] EXPR 0 !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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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] [L752] 0 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) [L753] EXPR 0 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_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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] [L753] 0 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)) [L754] EXPR 0 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_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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] [L754] 0 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)) [L755] EXPR 0 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_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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] [L755] 0 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)) [L756] EXPR 0 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_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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] [L756] 0 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)) [L757] EXPR 0 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_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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] [L757] 0 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)) [L758] EXPR 0 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_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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] [L758] 0 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)) [L759] 0 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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] [L760] EXPR 0 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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] [L760] 0 x = x$flush_delayed ? x$mem_tmp : x [L761] 0 x$flush_delayed = (_Bool)0 [L764] 0 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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] [L767] EXPR 0 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=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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] 1 y = 1 [L709] 1 __unbuffered_p0_EAX = y [L712] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L713] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L714] 1 x$flush_delayed = weak$$choice2 [L715] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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] [L716] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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] [L767] 0 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L768] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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] [L768] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=1] [L716] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L717] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? 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=0, x$r_buff0_thd2=1, 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=1] [L717] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L718] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? 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=0, x$r_buff0_thd2=1, 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=1] [L718] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L719] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=1] [L719] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L720] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=1] [L769] 0 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 [L770] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=1] [L770] 0 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L771] EXPR 0 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=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=1] [L771] 0 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 [L774] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=1] [L720] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L721] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=1] [L721] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L722] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=1] [L722] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L723] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=1] [L724] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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=0, x$r_buff0_thd2=1, 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=1] [L724] 1 x = x$flush_delayed ? x$mem_tmp : x [L725] 1 x$flush_delayed = (_Bool)0 [L730] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=1] [L794] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=1] [L798] 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_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=1] [L798] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=1] [L798] 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_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=1] [L798] -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) [L799] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=1] [L799] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L800] 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_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=1] [L800] -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 [L801] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=1] [L801] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L802] 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_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=1] [L802] -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 [L805] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=1] [L5] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=1] [L5] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 284 locations, 3 error locations. UNSAFE Result, 23.5s OverallTime, 29 OverallIterations, 1 TraceHistogramMax, 8.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 10071 SDtfs, 10557 SDslu, 24219 SDs, 0 SdLazy, 8313 SolverSat, 442 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 281 GetRequests, 70 SyntacticMatches, 27 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=83128occurred 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: 7.2s AutomataMinimizationTime, 28 MinimizatonAttempts, 138370 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 2505 NumberOfCodeBlocks, 2505 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2374 ConstructedInterpolants, 0 QuantifiedInterpolants, 489490 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...