./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix032_rmo.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f056aa3d-21f4-4729-b96e-0d4a154cf0cb/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f056aa3d-21f4-4729-b96e-0d4a154cf0cb/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f056aa3d-21f4-4729-b96e-0d4a154cf0cb/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f056aa3d-21f4-4729-b96e-0d4a154cf0cb/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix032_rmo.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_f056aa3d-21f4-4729-b96e-0d4a154cf0cb/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f056aa3d-21f4-4729-b96e-0d4a154cf0cb/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 3bccc60f19dbcc18d87154d20be228295e714a4b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-03 01:45:53,814 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 01:45:53,815 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 01:45:53,822 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 01:45:53,822 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 01:45:53,823 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 01:45:53,824 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 01:45:53,825 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 01:45:53,826 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 01:45:53,827 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 01:45:53,827 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 01:45:53,827 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 01:45:53,828 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 01:45:53,829 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 01:45:53,830 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 01:45:53,830 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 01:45:53,831 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 01:45:53,832 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 01:45:53,833 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 01:45:53,834 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 01:45:53,835 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 01:45:53,836 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 01:45:53,837 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 01:45:53,838 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 01:45:53,838 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 01:45:53,838 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 01:45:53,839 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 01:45:53,840 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 01:45:53,840 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 01:45:53,841 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 01:45:53,841 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 01:45:53,842 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 01:45:53,842 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 01:45:53,842 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 01:45:53,842 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 01:45:53,843 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 01:45:53,843 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f056aa3d-21f4-4729-b96e-0d4a154cf0cb/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-03 01:45:53,853 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 01:45:53,853 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 01:45:53,854 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 01:45:53,854 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 01:45:53,854 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 01:45:53,855 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 01:45:53,855 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 01:45:53,855 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 01:45:53,855 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 01:45:53,855 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 01:45:53,855 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 01:45:53,855 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 01:45:53,856 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 01:45:53,856 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 01:45:53,856 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 01:45:53,856 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 01:45:53,856 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 01:45:53,857 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 01:45:53,857 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 01:45:53,857 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 01:45:53,857 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 01:45:53,857 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 01:45:53,857 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 01:45:53,857 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 01:45:53,857 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 01:45:53,858 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 01:45:53,858 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 01:45:53,858 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 01:45:53,858 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 01:45:53,858 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 01:45:53,858 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 01:45:53,858 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 01:45:53,858 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 01:45:53,858 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 01:45:53,858 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 01:45:53,859 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 01:45:53,859 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_f056aa3d-21f4-4729-b96e-0d4a154cf0cb/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 -> 3bccc60f19dbcc18d87154d20be228295e714a4b [2018-12-03 01:45:53,881 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 01:45:53,890 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 01:45:53,893 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 01:45:53,894 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 01:45:53,894 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 01:45:53,895 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f056aa3d-21f4-4729-b96e-0d4a154cf0cb/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix032_rmo.opt_false-unreach-call.i [2018-12-03 01:45:53,939 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f056aa3d-21f4-4729-b96e-0d4a154cf0cb/bin-2019/utaipan/data/6d1d4ccdd/f98eee7e718c4290908a5f5a0091e0ba/FLAG17cc4300d [2018-12-03 01:45:54,280 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 01:45:54,281 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f056aa3d-21f4-4729-b96e-0d4a154cf0cb/sv-benchmarks/c/pthread-wmm/mix032_rmo.opt_false-unreach-call.i [2018-12-03 01:45:54,288 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f056aa3d-21f4-4729-b96e-0d4a154cf0cb/bin-2019/utaipan/data/6d1d4ccdd/f98eee7e718c4290908a5f5a0091e0ba/FLAG17cc4300d [2018-12-03 01:45:54,297 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f056aa3d-21f4-4729-b96e-0d4a154cf0cb/bin-2019/utaipan/data/6d1d4ccdd/f98eee7e718c4290908a5f5a0091e0ba [2018-12-03 01:45:54,299 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 01:45:54,300 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 01:45:54,301 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 01:45:54,301 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 01:45:54,303 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 01:45:54,303 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 01:45:54" (1/1) ... [2018-12-03 01:45:54,305 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@628262cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:45:54, skipping insertion in model container [2018-12-03 01:45:54,305 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 01:45:54" (1/1) ... [2018-12-03 01:45:54,309 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 01:45:54,337 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 01:45:54,532 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 01:45:54,540 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 01:45:54,610 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 01:45:54,640 INFO L195 MainTranslator]: Completed translation [2018-12-03 01:45:54,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:45:54 WrapperNode [2018-12-03 01:45:54,640 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 01:45:54,640 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 01:45:54,640 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 01:45:54,640 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 01:45:54,646 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:45:54" (1/1) ... [2018-12-03 01:45:54,656 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:45:54" (1/1) ... [2018-12-03 01:45:54,672 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 01:45:54,672 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 01:45:54,672 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 01:45:54,672 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 01:45:54,678 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:45:54" (1/1) ... [2018-12-03 01:45:54,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:45:54" (1/1) ... [2018-12-03 01:45:54,680 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:45:54" (1/1) ... [2018-12-03 01:45:54,680 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:45:54" (1/1) ... [2018-12-03 01:45:54,686 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:45:54" (1/1) ... [2018-12-03 01:45:54,688 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:45:54" (1/1) ... [2018-12-03 01:45:54,689 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:45:54" (1/1) ... [2018-12-03 01:45:54,691 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 01:45:54,691 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 01:45:54,691 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 01:45:54,692 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 01:45:54,692 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:45:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f056aa3d-21f4-4729-b96e-0d4a154cf0cb/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-03 01:45:54,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 01:45:54,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-03 01:45:54,724 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-03 01:45:54,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-03 01:45:54,724 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-03 01:45:54,724 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-03 01:45:54,724 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-03 01:45:54,724 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-03 01:45:54,724 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-03 01:45:54,724 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-03 01:45:54,724 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-03 01:45:54,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 01:45:54,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 01:45:54,725 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-03 01:45:55,033 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 01:45:55,033 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-03 01:45:55,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:45:55 BoogieIcfgContainer [2018-12-03 01:45:55,033 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 01:45:55,034 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 01:45:55,034 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 01:45:55,036 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 01:45:55,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 01:45:54" (1/3) ... [2018-12-03 01:45:55,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d5fbd6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 01:45:55, skipping insertion in model container [2018-12-03 01:45:55,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:45:54" (2/3) ... [2018-12-03 01:45:55,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d5fbd6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 01:45:55, skipping insertion in model container [2018-12-03 01:45:55,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:45:55" (3/3) ... [2018-12-03 01:45:55,038 INFO L112 eAbstractionObserver]: Analyzing ICFG mix032_rmo.opt_false-unreach-call.i [2018-12-03 01:45:55,065 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,065 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,065 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,066 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,066 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,066 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,066 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,066 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,066 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,067 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,067 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,067 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,067 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,067 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,068 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,068 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,068 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,068 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,068 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,068 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,068 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,068 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,069 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,069 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,069 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,069 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,069 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,069 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,069 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,070 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,070 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,070 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,070 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,070 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,070 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,071 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,071 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,071 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,071 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,071 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,072 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,072 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,072 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,072 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,072 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,072 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,072 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,073 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,073 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,073 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,073 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,073 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,073 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,074 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,074 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,074 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,074 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,074 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,074 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,074 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,075 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,075 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,075 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,075 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,075 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,075 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,076 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,076 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,076 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,076 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,076 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,076 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,076 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,077 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,077 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,077 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,077 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,077 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,077 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,078 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,078 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,078 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,078 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,078 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,078 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,079 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,079 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,079 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,079 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,079 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,079 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,079 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,079 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,080 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,080 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,080 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,080 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,080 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,080 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,081 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,081 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,081 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,081 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,081 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,081 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,081 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,082 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,082 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,082 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,082 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,082 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,082 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,083 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,083 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,083 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,083 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,083 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,083 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,083 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,084 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,084 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,084 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,084 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,084 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,084 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,085 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,085 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,085 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,085 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,085 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,085 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,085 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,086 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,086 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,086 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,086 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,086 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,086 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,086 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,087 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,087 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,087 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,087 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,087 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,087 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,087 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,088 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,088 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,088 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,088 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 01:45:55,093 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-03 01:45:55,094 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 01:45:55,100 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-03 01:45:55,113 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-03 01:45:55,135 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 01:45:55,135 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 01:45:55,135 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 01:45:55,135 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 01:45:55,135 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 01:45:55,135 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 01:45:55,136 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 01:45:55,136 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 01:45:55,144 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 149places, 180 transitions [2018-12-03 01:46:15,017 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 149048 states. [2018-12-03 01:46:15,018 INFO L276 IsEmpty]: Start isEmpty. Operand 149048 states. [2018-12-03 01:46:15,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-03 01:46:15,025 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:46:15,026 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:46:15,027 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:46:15,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:46:15,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1796074028, now seen corresponding path program 1 times [2018-12-03 01:46:15,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:46:15,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:46:15,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:46:15,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:46:15,067 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:46:15,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:46:15,195 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-03 01:46:15,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:46:15,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:46:15,197 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:46:15,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:46:15,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:46:15,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:46:15,211 INFO L87 Difference]: Start difference. First operand 149048 states. Second operand 4 states. [2018-12-03 01:46:16,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:46:16,744 INFO L93 Difference]: Finished difference Result 257068 states and 1188607 transitions. [2018-12-03 01:46:16,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:46:16,746 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-12-03 01:46:16,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:46:17,336 INFO L225 Difference]: With dead ends: 257068 [2018-12-03 01:46:17,336 INFO L226 Difference]: Without dead ends: 174818 [2018-12-03 01:46:17,337 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-03 01:46:18,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174818 states. [2018-12-03 01:46:21,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174818 to 110558. [2018-12-03 01:46:21,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110558 states. [2018-12-03 01:46:22,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110558 states to 110558 states and 511489 transitions. [2018-12-03 01:46:22,336 INFO L78 Accepts]: Start accepts. Automaton has 110558 states and 511489 transitions. Word has length 49 [2018-12-03 01:46:22,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:46:22,337 INFO L480 AbstractCegarLoop]: Abstraction has 110558 states and 511489 transitions. [2018-12-03 01:46:22,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:46:22,337 INFO L276 IsEmpty]: Start isEmpty. Operand 110558 states and 511489 transitions. [2018-12-03 01:46:22,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-03 01:46:22,350 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:46:22,350 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:46:22,350 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:46:22,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:46:22,351 INFO L82 PathProgramCache]: Analyzing trace with hash -506965212, now seen corresponding path program 1 times [2018-12-03 01:46:22,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:46:22,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:46:22,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:46:22,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:46:22,355 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:46:22,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:46:22,391 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-03 01:46:22,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:46:22,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 01:46:22,392 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:46:22,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 01:46:22,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 01:46:22,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 01:46:22,393 INFO L87 Difference]: Start difference. First operand 110558 states and 511489 transitions. Second operand 3 states. [2018-12-03 01:46:23,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:46:23,306 INFO L93 Difference]: Finished difference Result 110558 states and 511384 transitions. [2018-12-03 01:46:23,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 01:46:23,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2018-12-03 01:46:23,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:46:23,592 INFO L225 Difference]: With dead ends: 110558 [2018-12-03 01:46:23,592 INFO L226 Difference]: Without dead ends: 110558 [2018-12-03 01:46:23,592 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-03 01:46:24,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110558 states. [2018-12-03 01:46:25,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110558 to 110558. [2018-12-03 01:46:25,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110558 states. [2018-12-03 01:46:26,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110558 states to 110558 states and 511384 transitions. [2018-12-03 01:46:26,174 INFO L78 Accepts]: Start accepts. Automaton has 110558 states and 511384 transitions. Word has length 57 [2018-12-03 01:46:26,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:46:26,174 INFO L480 AbstractCegarLoop]: Abstraction has 110558 states and 511384 transitions. [2018-12-03 01:46:26,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 01:46:26,174 INFO L276 IsEmpty]: Start isEmpty. Operand 110558 states and 511384 transitions. [2018-12-03 01:46:26,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-03 01:46:26,185 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:46:26,185 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:46:26,185 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:46:26,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:46:26,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1235845123, now seen corresponding path program 1 times [2018-12-03 01:46:26,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:46:26,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:46:26,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:46:26,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:46:26,189 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:46:26,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:46:26,249 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-03 01:46:26,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:46:26,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 01:46:26,249 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:46:26,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 01:46:26,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 01:46:26,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:46:26,250 INFO L87 Difference]: Start difference. First operand 110558 states and 511384 transitions. Second operand 5 states. [2018-12-03 01:46:27,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:46:27,542 INFO L93 Difference]: Finished difference Result 240608 states and 1068639 transitions. [2018-12-03 01:46:27,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 01:46:27,543 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2018-12-03 01:46:27,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:46:28,237 INFO L225 Difference]: With dead ends: 240608 [2018-12-03 01:46:28,238 INFO L226 Difference]: Without dead ends: 237058 [2018-12-03 01:46:28,238 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-03 01:46:31,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237058 states. [2018-12-03 01:46:33,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237058 to 160438. [2018-12-03 01:46:33,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160438 states. [2018-12-03 01:46:34,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160438 states to 160438 states and 716828 transitions. [2018-12-03 01:46:34,233 INFO L78 Accepts]: Start accepts. Automaton has 160438 states and 716828 transitions. Word has length 57 [2018-12-03 01:46:34,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:46:34,233 INFO L480 AbstractCegarLoop]: Abstraction has 160438 states and 716828 transitions. [2018-12-03 01:46:34,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 01:46:34,233 INFO L276 IsEmpty]: Start isEmpty. Operand 160438 states and 716828 transitions. [2018-12-03 01:46:34,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 01:46:34,241 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:46:34,241 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:46:34,241 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:46:34,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:46:34,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1838099179, now seen corresponding path program 1 times [2018-12-03 01:46:34,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:46:34,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:46:34,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:46:34,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:46:34,243 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:46:34,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:46:34,302 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-03 01:46:34,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:46:34,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 01:46:34,302 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:46:34,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 01:46:34,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 01:46:34,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-03 01:46:34,303 INFO L87 Difference]: Start difference. First operand 160438 states and 716828 transitions. Second operand 6 states. [2018-12-03 01:46:35,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:46:35,513 INFO L93 Difference]: Finished difference Result 210258 states and 922769 transitions. [2018-12-03 01:46:35,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 01:46:35,513 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2018-12-03 01:46:35,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:46:36,066 INFO L225 Difference]: With dead ends: 210258 [2018-12-03 01:46:36,066 INFO L226 Difference]: Without dead ends: 207358 [2018-12-03 01:46:36,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-12-03 01:46:37,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207358 states. [2018-12-03 01:46:41,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207358 to 178278. [2018-12-03 01:46:41,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178278 states. [2018-12-03 01:46:42,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178278 states to 178278 states and 791365 transitions. [2018-12-03 01:46:42,443 INFO L78 Accepts]: Start accepts. Automaton has 178278 states and 791365 transitions. Word has length 58 [2018-12-03 01:46:42,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:46:42,443 INFO L480 AbstractCegarLoop]: Abstraction has 178278 states and 791365 transitions. [2018-12-03 01:46:42,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 01:46:42,443 INFO L276 IsEmpty]: Start isEmpty. Operand 178278 states and 791365 transitions. [2018-12-03 01:46:42,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 01:46:42,456 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:46:42,457 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:46:42,457 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:46:42,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:46:42,457 INFO L82 PathProgramCache]: Analyzing trace with hash -299178373, now seen corresponding path program 1 times [2018-12-03 01:46:42,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:46:42,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:46:42,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:46:42,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:46:42,459 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:46:42,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:46:42,483 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-03 01:46:42,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:46:42,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 01:46:42,484 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:46:42,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 01:46:42,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 01:46:42,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 01:46:42,484 INFO L87 Difference]: Start difference. First operand 178278 states and 791365 transitions. Second operand 3 states. [2018-12-03 01:46:43,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:46:43,913 INFO L93 Difference]: Finished difference Result 231658 states and 1011134 transitions. [2018-12-03 01:46:43,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 01:46:43,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-12-03 01:46:43,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:46:44,510 INFO L225 Difference]: With dead ends: 231658 [2018-12-03 01:46:44,510 INFO L226 Difference]: Without dead ends: 231658 [2018-12-03 01:46:44,511 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-03 01:46:45,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231658 states. [2018-12-03 01:46:48,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231658 to 202943. [2018-12-03 01:46:48,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202943 states. [2018-12-03 01:46:49,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202943 states to 202943 states and 893422 transitions. [2018-12-03 01:46:49,211 INFO L78 Accepts]: Start accepts. Automaton has 202943 states and 893422 transitions. Word has length 60 [2018-12-03 01:46:49,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:46:49,211 INFO L480 AbstractCegarLoop]: Abstraction has 202943 states and 893422 transitions. [2018-12-03 01:46:49,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 01:46:49,212 INFO L276 IsEmpty]: Start isEmpty. Operand 202943 states and 893422 transitions. [2018-12-03 01:46:49,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-03 01:46:49,245 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:46:49,245 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-03 01:46:49,245 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:46:49,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:46:49,245 INFO L82 PathProgramCache]: Analyzing trace with hash 281236806, now seen corresponding path program 1 times [2018-12-03 01:46:49,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:46:49,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:46:49,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:46:49,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:46:49,247 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:46:49,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:46:49,299 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-03 01:46:49,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:46:49,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 01:46:49,299 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:46:49,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 01:46:49,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 01:46:49,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 01:46:49,299 INFO L87 Difference]: Start difference. First operand 202943 states and 893422 transitions. Second operand 6 states. [2018-12-03 01:46:53,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:46:53,269 INFO L93 Difference]: Finished difference Result 356178 states and 1552140 transitions. [2018-12-03 01:46:53,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 01:46:53,270 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-12-03 01:46:53,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:46:54,203 INFO L225 Difference]: With dead ends: 356178 [2018-12-03 01:46:54,203 INFO L226 Difference]: Without dead ends: 352828 [2018-12-03 01:46:54,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-03 01:46:55,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352828 states. [2018-12-03 01:46:59,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352828 to 205748. [2018-12-03 01:46:59,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205748 states. [2018-12-03 01:47:00,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205748 states to 205748 states and 906656 transitions. [2018-12-03 01:47:00,019 INFO L78 Accepts]: Start accepts. Automaton has 205748 states and 906656 transitions. Word has length 64 [2018-12-03 01:47:00,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:00,019 INFO L480 AbstractCegarLoop]: Abstraction has 205748 states and 906656 transitions. [2018-12-03 01:47:00,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 01:47:00,019 INFO L276 IsEmpty]: Start isEmpty. Operand 205748 states and 906656 transitions. [2018-12-03 01:47:00,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-03 01:47:00,051 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:00,051 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-03 01:47:00,051 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:00,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:00,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1440890515, now seen corresponding path program 1 times [2018-12-03 01:47:00,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:00,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:00,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:00,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:00,054 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:00,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:00,130 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-03 01:47:00,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:00,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 01:47:00,130 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:00,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 01:47:00,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 01:47:00,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-03 01:47:00,131 INFO L87 Difference]: Start difference. First operand 205748 states and 906656 transitions. Second operand 6 states. [2018-12-03 01:47:01,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:01,741 INFO L93 Difference]: Finished difference Result 284253 states and 1239490 transitions. [2018-12-03 01:47:01,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 01:47:01,742 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-12-03 01:47:01,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:02,996 INFO L225 Difference]: With dead ends: 284253 [2018-12-03 01:47:02,996 INFO L226 Difference]: Without dead ends: 278558 [2018-12-03 01:47:02,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-03 01:47:04,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278558 states. [2018-12-03 01:47:10,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278558 to 261033. [2018-12-03 01:47:10,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261033 states. [2018-12-03 01:47:11,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261033 states to 261033 states and 1142709 transitions. [2018-12-03 01:47:11,234 INFO L78 Accepts]: Start accepts. Automaton has 261033 states and 1142709 transitions. Word has length 64 [2018-12-03 01:47:11,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:11,234 INFO L480 AbstractCegarLoop]: Abstraction has 261033 states and 1142709 transitions. [2018-12-03 01:47:11,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 01:47:11,234 INFO L276 IsEmpty]: Start isEmpty. Operand 261033 states and 1142709 transitions. [2018-12-03 01:47:11,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-03 01:47:11,274 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:11,275 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-03 01:47:11,275 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:11,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:11,275 INFO L82 PathProgramCache]: Analyzing trace with hash -356060844, now seen corresponding path program 1 times [2018-12-03 01:47:11,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:11,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:11,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:11,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:11,277 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:11,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:11,335 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-03 01:47:11,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:11,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 01:47:11,336 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:11,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 01:47:11,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 01:47:11,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-03 01:47:11,336 INFO L87 Difference]: Start difference. First operand 261033 states and 1142709 transitions. Second operand 7 states. [2018-12-03 01:47:13,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:13,873 INFO L93 Difference]: Finished difference Result 379448 states and 1607926 transitions. [2018-12-03 01:47:13,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 01:47:13,873 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2018-12-03 01:47:13,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:15,510 INFO L225 Difference]: With dead ends: 379448 [2018-12-03 01:47:15,511 INFO L226 Difference]: Without dead ends: 379448 [2018-12-03 01:47:15,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-03 01:47:16,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379448 states. [2018-12-03 01:47:24,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379448 to 308623. [2018-12-03 01:47:24,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308623 states. [2018-12-03 01:47:25,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308623 states to 308623 states and 1326666 transitions. [2018-12-03 01:47:25,419 INFO L78 Accepts]: Start accepts. Automaton has 308623 states and 1326666 transitions. Word has length 64 [2018-12-03 01:47:25,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:25,419 INFO L480 AbstractCegarLoop]: Abstraction has 308623 states and 1326666 transitions. [2018-12-03 01:47:25,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 01:47:25,420 INFO L276 IsEmpty]: Start isEmpty. Operand 308623 states and 1326666 transitions. [2018-12-03 01:47:25,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-03 01:47:25,461 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:25,461 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-03 01:47:25,461 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:25,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:25,462 INFO L82 PathProgramCache]: Analyzing trace with hash 531442837, now seen corresponding path program 1 times [2018-12-03 01:47:25,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:25,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:25,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:25,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:25,463 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:25,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:25,500 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-03 01:47:25,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:25,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:47:25,500 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:25,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:47:25,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:47:25,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:25,501 INFO L87 Difference]: Start difference. First operand 308623 states and 1326666 transitions. Second operand 4 states. [2018-12-03 01:47:27,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:27,259 INFO L93 Difference]: Finished difference Result 267156 states and 1127024 transitions. [2018-12-03 01:47:27,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 01:47:27,259 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-03 01:47:27,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:27,924 INFO L225 Difference]: With dead ends: 267156 [2018-12-03 01:47:27,924 INFO L226 Difference]: Without dead ends: 259071 [2018-12-03 01:47:27,924 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-03 01:47:28,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259071 states. [2018-12-03 01:47:32,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259071 to 259071. [2018-12-03 01:47:32,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259071 states. [2018-12-03 01:47:33,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259071 states to 259071 states and 1099302 transitions. [2018-12-03 01:47:33,147 INFO L78 Accepts]: Start accepts. Automaton has 259071 states and 1099302 transitions. Word has length 64 [2018-12-03 01:47:33,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:33,147 INFO L480 AbstractCegarLoop]: Abstraction has 259071 states and 1099302 transitions. [2018-12-03 01:47:33,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:47:33,147 INFO L276 IsEmpty]: Start isEmpty. Operand 259071 states and 1099302 transitions. [2018-12-03 01:47:33,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 01:47:33,184 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:33,185 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:33,185 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:33,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:33,185 INFO L82 PathProgramCache]: Analyzing trace with hash 757118313, now seen corresponding path program 1 times [2018-12-03 01:47:33,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:33,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:33,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:33,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:33,187 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:33,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:33,233 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-03 01:47:33,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:33,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 01:47:33,234 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:33,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 01:47:33,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 01:47:33,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:47:33,234 INFO L87 Difference]: Start difference. First operand 259071 states and 1099302 transitions. Second operand 5 states. [2018-12-03 01:47:33,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:33,868 INFO L93 Difference]: Finished difference Result 57903 states and 224526 transitions. [2018-12-03 01:47:33,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 01:47:33,869 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-12-03 01:47:33,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:33,981 INFO L225 Difference]: With dead ends: 57903 [2018-12-03 01:47:33,981 INFO L226 Difference]: Without dead ends: 50987 [2018-12-03 01:47:33,981 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-03 01:47:34,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50987 states. [2018-12-03 01:47:34,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50987 to 50747. [2018-12-03 01:47:34,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50747 states. [2018-12-03 01:47:34,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50747 states to 50747 states and 196313 transitions. [2018-12-03 01:47:34,761 INFO L78 Accepts]: Start accepts. Automaton has 50747 states and 196313 transitions. Word has length 65 [2018-12-03 01:47:34,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:34,761 INFO L480 AbstractCegarLoop]: Abstraction has 50747 states and 196313 transitions. [2018-12-03 01:47:34,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 01:47:34,761 INFO L276 IsEmpty]: Start isEmpty. Operand 50747 states and 196313 transitions. [2018-12-03 01:47:34,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 01:47:34,777 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:34,777 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:34,777 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:34,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:34,778 INFO L82 PathProgramCache]: Analyzing trace with hash -229270171, now seen corresponding path program 1 times [2018-12-03 01:47:34,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:34,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:34,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:34,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:34,779 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:34,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:34,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:47:34,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:34,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:47:34,826 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:34,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:47:34,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:47:34,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:34,827 INFO L87 Difference]: Start difference. First operand 50747 states and 196313 transitions. Second operand 4 states. [2018-12-03 01:47:35,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:35,096 INFO L93 Difference]: Finished difference Result 59866 states and 230932 transitions. [2018-12-03 01:47:35,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 01:47:35,096 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2018-12-03 01:47:35,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:35,214 INFO L225 Difference]: With dead ends: 59866 [2018-12-03 01:47:35,214 INFO L226 Difference]: Without dead ends: 59866 [2018-12-03 01:47:35,214 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-03 01:47:35,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59866 states. [2018-12-03 01:47:36,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59866 to 53962. [2018-12-03 01:47:36,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53962 states. [2018-12-03 01:47:37,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53962 states to 53962 states and 208380 transitions. [2018-12-03 01:47:37,063 INFO L78 Accepts]: Start accepts. Automaton has 53962 states and 208380 transitions. Word has length 75 [2018-12-03 01:47:37,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:37,064 INFO L480 AbstractCegarLoop]: Abstraction has 53962 states and 208380 transitions. [2018-12-03 01:47:37,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:47:37,064 INFO L276 IsEmpty]: Start isEmpty. Operand 53962 states and 208380 transitions. [2018-12-03 01:47:37,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 01:47:37,081 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:37,082 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:37,082 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:37,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:37,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1513540164, now seen corresponding path program 1 times [2018-12-03 01:47:37,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:37,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:37,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:37,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:37,083 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:37,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:37,129 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-03 01:47:37,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:37,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 01:47:37,130 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:37,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 01:47:37,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 01:47:37,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 01:47:37,130 INFO L87 Difference]: Start difference. First operand 53962 states and 208380 transitions. Second operand 6 states. [2018-12-03 01:47:37,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:37,726 INFO L93 Difference]: Finished difference Result 98121 states and 377174 transitions. [2018-12-03 01:47:37,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 01:47:37,727 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2018-12-03 01:47:37,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:37,919 INFO L225 Difference]: With dead ends: 98121 [2018-12-03 01:47:37,920 INFO L226 Difference]: Without dead ends: 97801 [2018-12-03 01:47:37,920 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-03 01:47:38,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97801 states. [2018-12-03 01:47:39,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97801 to 58187. [2018-12-03 01:47:39,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58187 states. [2018-12-03 01:47:39,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58187 states to 58187 states and 223571 transitions. [2018-12-03 01:47:39,168 INFO L78 Accepts]: Start accepts. Automaton has 58187 states and 223571 transitions. Word has length 75 [2018-12-03 01:47:39,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:39,169 INFO L480 AbstractCegarLoop]: Abstraction has 58187 states and 223571 transitions. [2018-12-03 01:47:39,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 01:47:39,169 INFO L276 IsEmpty]: Start isEmpty. Operand 58187 states and 223571 transitions. [2018-12-03 01:47:39,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-03 01:47:39,193 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:39,193 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:39,193 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:39,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:39,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1542588999, now seen corresponding path program 1 times [2018-12-03 01:47:39,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:39,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:39,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:39,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:39,195 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:39,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:39,238 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-03 01:47:39,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:39,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:47:39,238 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:39,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:47:39,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:47:39,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:39,239 INFO L87 Difference]: Start difference. First operand 58187 states and 223571 transitions. Second operand 4 states. [2018-12-03 01:47:39,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:39,592 INFO L93 Difference]: Finished difference Result 73350 states and 278575 transitions. [2018-12-03 01:47:39,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:47:39,592 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2018-12-03 01:47:39,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:39,727 INFO L225 Difference]: With dead ends: 73350 [2018-12-03 01:47:39,728 INFO L226 Difference]: Without dead ends: 73350 [2018-12-03 01:47:39,728 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-03 01:47:39,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73350 states. [2018-12-03 01:47:40,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73350 to 66714. [2018-12-03 01:47:40,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66714 states. [2018-12-03 01:47:40,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66714 states to 66714 states and 254003 transitions. [2018-12-03 01:47:40,987 INFO L78 Accepts]: Start accepts. Automaton has 66714 states and 254003 transitions. Word has length 77 [2018-12-03 01:47:40,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:40,987 INFO L480 AbstractCegarLoop]: Abstraction has 66714 states and 254003 transitions. [2018-12-03 01:47:40,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:47:40,987 INFO L276 IsEmpty]: Start isEmpty. Operand 66714 states and 254003 transitions. [2018-12-03 01:47:41,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-03 01:47:41,020 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:41,020 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:41,020 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:41,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:41,021 INFO L82 PathProgramCache]: Analyzing trace with hash 675168954, now seen corresponding path program 1 times [2018-12-03 01:47:41,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:41,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:41,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:41,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:41,022 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:41,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:41,052 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-03 01:47:41,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:41,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 01:47:41,053 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:41,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 01:47:41,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 01:47:41,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 01:47:41,053 INFO L87 Difference]: Start difference. First operand 66714 states and 254003 transitions. Second operand 3 states. [2018-12-03 01:47:41,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:41,371 INFO L93 Difference]: Finished difference Result 69476 states and 263648 transitions. [2018-12-03 01:47:41,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 01:47:41,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-12-03 01:47:41,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:41,505 INFO L225 Difference]: With dead ends: 69476 [2018-12-03 01:47:41,505 INFO L226 Difference]: Without dead ends: 69476 [2018-12-03 01:47:41,506 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-03 01:47:41,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69476 states. [2018-12-03 01:47:42,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69476 to 68224. [2018-12-03 01:47:42,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68224 states. [2018-12-03 01:47:42,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68224 states to 68224 states and 259247 transitions. [2018-12-03 01:47:42,489 INFO L78 Accepts]: Start accepts. Automaton has 68224 states and 259247 transitions. Word has length 77 [2018-12-03 01:47:42,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:42,489 INFO L480 AbstractCegarLoop]: Abstraction has 68224 states and 259247 transitions. [2018-12-03 01:47:42,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 01:47:42,489 INFO L276 IsEmpty]: Start isEmpty. Operand 68224 states and 259247 transitions. [2018-12-03 01:47:42,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-03 01:47:42,529 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:42,529 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:42,529 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:42,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:42,530 INFO L82 PathProgramCache]: Analyzing trace with hash -935757050, now seen corresponding path program 1 times [2018-12-03 01:47:42,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:42,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:42,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:42,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:42,531 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:42,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:42,575 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-03 01:47:42,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:42,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 01:47:42,575 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:42,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 01:47:42,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 01:47:42,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 01:47:42,576 INFO L87 Difference]: Start difference. First operand 68224 states and 259247 transitions. Second operand 6 states. [2018-12-03 01:47:43,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:43,460 INFO L93 Difference]: Finished difference Result 82931 states and 311778 transitions. [2018-12-03 01:47:43,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 01:47:43,460 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2018-12-03 01:47:43,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:43,614 INFO L225 Difference]: With dead ends: 82931 [2018-12-03 01:47:43,615 INFO L226 Difference]: Without dead ends: 82931 [2018-12-03 01:47:43,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-03 01:47:43,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82931 states. [2018-12-03 01:47:44,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82931 to 78447. [2018-12-03 01:47:44,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78447 states. [2018-12-03 01:47:44,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78447 states to 78447 states and 296296 transitions. [2018-12-03 01:47:44,780 INFO L78 Accepts]: Start accepts. Automaton has 78447 states and 296296 transitions. Word has length 79 [2018-12-03 01:47:44,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:44,780 INFO L480 AbstractCegarLoop]: Abstraction has 78447 states and 296296 transitions. [2018-12-03 01:47:44,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 01:47:44,781 INFO L276 IsEmpty]: Start isEmpty. Operand 78447 states and 296296 transitions. [2018-12-03 01:47:44,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-03 01:47:44,829 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:44,829 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:44,829 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:44,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:44,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1282000903, now seen corresponding path program 1 times [2018-12-03 01:47:44,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:44,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:44,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:44,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:44,831 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:44,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:44,892 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-03 01:47:44,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:44,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 01:47:44,893 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:44,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 01:47:44,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 01:47:44,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 01:47:44,893 INFO L87 Difference]: Start difference. First operand 78447 states and 296296 transitions. Second operand 6 states. [2018-12-03 01:47:45,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:45,542 INFO L93 Difference]: Finished difference Result 91981 states and 338639 transitions. [2018-12-03 01:47:45,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 01:47:45,542 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2018-12-03 01:47:45,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:45,702 INFO L225 Difference]: With dead ends: 91981 [2018-12-03 01:47:45,702 INFO L226 Difference]: Without dead ends: 91981 [2018-12-03 01:47:45,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-03 01:47:45,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91981 states. [2018-12-03 01:47:46,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91981 to 80036. [2018-12-03 01:47:46,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80036 states. [2018-12-03 01:47:46,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80036 states to 80036 states and 297461 transitions. [2018-12-03 01:47:46,900 INFO L78 Accepts]: Start accepts. Automaton has 80036 states and 297461 transitions. Word has length 79 [2018-12-03 01:47:46,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:46,900 INFO L480 AbstractCegarLoop]: Abstraction has 80036 states and 297461 transitions. [2018-12-03 01:47:46,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 01:47:46,900 INFO L276 IsEmpty]: Start isEmpty. Operand 80036 states and 297461 transitions. [2018-12-03 01:47:46,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-03 01:47:46,949 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:46,949 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:46,949 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:46,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:46,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1493351816, now seen corresponding path program 1 times [2018-12-03 01:47:46,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:46,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:46,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:46,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:46,950 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:46,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:46,999 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-03 01:47:46,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:46,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 01:47:46,999 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:47,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 01:47:47,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 01:47:47,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:47:47,000 INFO L87 Difference]: Start difference. First operand 80036 states and 297461 transitions. Second operand 5 states. [2018-12-03 01:47:47,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:47,652 INFO L93 Difference]: Finished difference Result 101345 states and 374909 transitions. [2018-12-03 01:47:47,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 01:47:47,653 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2018-12-03 01:47:47,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:47,845 INFO L225 Difference]: With dead ends: 101345 [2018-12-03 01:47:47,845 INFO L226 Difference]: Without dead ends: 101345 [2018-12-03 01:47:47,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-03 01:47:48,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101345 states. [2018-12-03 01:47:48,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101345 to 85991. [2018-12-03 01:47:48,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85991 states. [2018-12-03 01:47:49,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85991 states to 85991 states and 317479 transitions. [2018-12-03 01:47:49,115 INFO L78 Accepts]: Start accepts. Automaton has 85991 states and 317479 transitions. Word has length 79 [2018-12-03 01:47:49,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:49,115 INFO L480 AbstractCegarLoop]: Abstraction has 85991 states and 317479 transitions. [2018-12-03 01:47:49,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 01:47:49,116 INFO L276 IsEmpty]: Start isEmpty. Operand 85991 states and 317479 transitions. [2018-12-03 01:47:49,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-03 01:47:49,168 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:49,168 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:49,168 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:49,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:49,169 INFO L82 PathProgramCache]: Analyzing trace with hash 982817639, now seen corresponding path program 1 times [2018-12-03 01:47:49,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:49,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:49,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:49,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:49,170 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:49,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:49,206 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-03 01:47:49,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:49,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 01:47:49,206 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:49,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 01:47:49,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 01:47:49,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:47:49,207 INFO L87 Difference]: Start difference. First operand 85991 states and 317479 transitions. Second operand 5 states. [2018-12-03 01:47:49,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:49,842 INFO L93 Difference]: Finished difference Result 115114 states and 423727 transitions. [2018-12-03 01:47:49,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 01:47:49,842 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2018-12-03 01:47:49,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:50,249 INFO L225 Difference]: With dead ends: 115114 [2018-12-03 01:47:50,250 INFO L226 Difference]: Without dead ends: 115114 [2018-12-03 01:47:50,250 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-03 01:47:50,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115114 states. [2018-12-03 01:47:51,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115114 to 90924. [2018-12-03 01:47:51,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90924 states. [2018-12-03 01:47:51,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90924 states to 90924 states and 335673 transitions. [2018-12-03 01:47:51,649 INFO L78 Accepts]: Start accepts. Automaton has 90924 states and 335673 transitions. Word has length 79 [2018-12-03 01:47:51,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:51,649 INFO L480 AbstractCegarLoop]: Abstraction has 90924 states and 335673 transitions. [2018-12-03 01:47:51,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 01:47:51,649 INFO L276 IsEmpty]: Start isEmpty. Operand 90924 states and 335673 transitions. [2018-12-03 01:47:51,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-03 01:47:51,701 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:51,701 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:51,701 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:51,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:51,701 INFO L82 PathProgramCache]: Analyzing trace with hash -824636824, now seen corresponding path program 1 times [2018-12-03 01:47:51,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:51,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:51,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:51,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:51,703 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:51,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:51,739 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-03 01:47:51,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:51,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 01:47:51,739 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:51,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 01:47:51,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 01:47:51,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 01:47:51,739 INFO L87 Difference]: Start difference. First operand 90924 states and 335673 transitions. Second operand 6 states. [2018-12-03 01:47:51,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:51,855 INFO L93 Difference]: Finished difference Result 32108 states and 101609 transitions. [2018-12-03 01:47:51,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 01:47:51,855 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2018-12-03 01:47:51,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:51,886 INFO L225 Difference]: With dead ends: 32108 [2018-12-03 01:47:51,886 INFO L226 Difference]: Without dead ends: 25827 [2018-12-03 01:47:51,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-03 01:47:51,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25827 states. [2018-12-03 01:47:52,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25827 to 22407. [2018-12-03 01:47:52,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22407 states. [2018-12-03 01:47:52,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22407 states to 22407 states and 70116 transitions. [2018-12-03 01:47:52,136 INFO L78 Accepts]: Start accepts. Automaton has 22407 states and 70116 transitions. Word has length 79 [2018-12-03 01:47:52,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:52,136 INFO L480 AbstractCegarLoop]: Abstraction has 22407 states and 70116 transitions. [2018-12-03 01:47:52,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 01:47:52,136 INFO L276 IsEmpty]: Start isEmpty. Operand 22407 states and 70116 transitions. [2018-12-03 01:47:52,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 01:47:52,157 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:52,157 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:52,158 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:52,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:52,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1435852254, now seen corresponding path program 1 times [2018-12-03 01:47:52,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:52,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:52,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:52,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:52,159 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:52,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:52,211 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-03 01:47:52,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:52,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 01:47:52,212 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:52,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 01:47:52,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 01:47:52,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-03 01:47:52,212 INFO L87 Difference]: Start difference. First operand 22407 states and 70116 transitions. Second operand 7 states. [2018-12-03 01:47:52,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:52,525 INFO L93 Difference]: Finished difference Result 28185 states and 87909 transitions. [2018-12-03 01:47:52,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 01:47:52,525 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-03 01:47:52,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:52,558 INFO L225 Difference]: With dead ends: 28185 [2018-12-03 01:47:52,558 INFO L226 Difference]: Without dead ends: 28185 [2018-12-03 01:47:52,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-03 01:47:52,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28185 states. [2018-12-03 01:47:52,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28185 to 23157. [2018-12-03 01:47:52,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23157 states. [2018-12-03 01:47:52,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23157 states to 23157 states and 72666 transitions. [2018-12-03 01:47:52,834 INFO L78 Accepts]: Start accepts. Automaton has 23157 states and 72666 transitions. Word has length 94 [2018-12-03 01:47:52,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:52,834 INFO L480 AbstractCegarLoop]: Abstraction has 23157 states and 72666 transitions. [2018-12-03 01:47:52,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 01:47:52,835 INFO L276 IsEmpty]: Start isEmpty. Operand 23157 states and 72666 transitions. [2018-12-03 01:47:52,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 01:47:52,857 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:52,857 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:52,857 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:52,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:52,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1105280225, now seen corresponding path program 1 times [2018-12-03 01:47:52,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:52,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:52,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:52,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:52,859 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:52,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:52,891 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-03 01:47:52,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:52,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 01:47:52,892 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:52,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 01:47:52,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 01:47:52,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:47:52,892 INFO L87 Difference]: Start difference. First operand 23157 states and 72666 transitions. Second operand 5 states. [2018-12-03 01:47:53,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:53,081 INFO L93 Difference]: Finished difference Result 26791 states and 83200 transitions. [2018-12-03 01:47:53,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 01:47:53,082 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-03 01:47:53,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:53,114 INFO L225 Difference]: With dead ends: 26791 [2018-12-03 01:47:53,114 INFO L226 Difference]: Without dead ends: 26621 [2018-12-03 01:47:53,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-03 01:47:53,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26621 states. [2018-12-03 01:47:53,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26621 to 23937. [2018-12-03 01:47:53,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23937 states. [2018-12-03 01:47:53,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23937 states to 23937 states and 74830 transitions. [2018-12-03 01:47:53,389 INFO L78 Accepts]: Start accepts. Automaton has 23937 states and 74830 transitions. Word has length 94 [2018-12-03 01:47:53,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:53,389 INFO L480 AbstractCegarLoop]: Abstraction has 23937 states and 74830 transitions. [2018-12-03 01:47:53,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 01:47:53,389 INFO L276 IsEmpty]: Start isEmpty. Operand 23937 states and 74830 transitions. [2018-12-03 01:47:53,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 01:47:53,413 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:53,413 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:53,413 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:53,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:53,413 INFO L82 PathProgramCache]: Analyzing trace with hash 301893331, now seen corresponding path program 2 times [2018-12-03 01:47:53,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:53,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:53,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:53,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:53,415 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:53,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:53,495 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-03 01:47:53,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:53,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 01:47:53,496 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:53,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 01:47:53,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 01:47:53,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 01:47:53,496 INFO L87 Difference]: Start difference. First operand 23937 states and 74830 transitions. Second operand 6 states. [2018-12-03 01:47:53,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:53,605 INFO L93 Difference]: Finished difference Result 23873 states and 74046 transitions. [2018-12-03 01:47:53,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 01:47:53,605 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-03 01:47:53,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:53,631 INFO L225 Difference]: With dead ends: 23873 [2018-12-03 01:47:53,631 INFO L226 Difference]: Without dead ends: 23873 [2018-12-03 01:47:53,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-03 01:47:53,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23873 states. [2018-12-03 01:47:53,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23873 to 16029. [2018-12-03 01:47:53,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16029 states. [2018-12-03 01:47:53,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16029 states to 16029 states and 50194 transitions. [2018-12-03 01:47:53,846 INFO L78 Accepts]: Start accepts. Automaton has 16029 states and 50194 transitions. Word has length 94 [2018-12-03 01:47:53,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:53,846 INFO L480 AbstractCegarLoop]: Abstraction has 16029 states and 50194 transitions. [2018-12-03 01:47:53,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 01:47:53,846 INFO L276 IsEmpty]: Start isEmpty. Operand 16029 states and 50194 transitions. [2018-12-03 01:47:53,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 01:47:53,861 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:53,861 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:53,861 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:53,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:53,861 INFO L82 PathProgramCache]: Analyzing trace with hash -18809202, now seen corresponding path program 1 times [2018-12-03 01:47:53,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:53,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:53,862 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 01:47:53,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:53,862 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:53,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:53,946 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-03 01:47:53,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:53,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 01:47:53,947 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:53,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 01:47:53,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 01:47:53,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-03 01:47:53,947 INFO L87 Difference]: Start difference. First operand 16029 states and 50194 transitions. Second operand 8 states. [2018-12-03 01:47:54,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:54,200 INFO L93 Difference]: Finished difference Result 19086 states and 59342 transitions. [2018-12-03 01:47:54,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 01:47:54,201 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2018-12-03 01:47:54,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:54,221 INFO L225 Difference]: With dead ends: 19086 [2018-12-03 01:47:54,222 INFO L226 Difference]: Without dead ends: 19086 [2018-12-03 01:47:54,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2018-12-03 01:47:54,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19086 states. [2018-12-03 01:47:54,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19086 to 18317. [2018-12-03 01:47:54,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18317 states. [2018-12-03 01:47:54,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18317 states to 18317 states and 57195 transitions. [2018-12-03 01:47:54,416 INFO L78 Accepts]: Start accepts. Automaton has 18317 states and 57195 transitions. Word has length 96 [2018-12-03 01:47:54,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:54,416 INFO L480 AbstractCegarLoop]: Abstraction has 18317 states and 57195 transitions. [2018-12-03 01:47:54,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 01:47:54,417 INFO L276 IsEmpty]: Start isEmpty. Operand 18317 states and 57195 transitions. [2018-12-03 01:47:54,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 01:47:54,433 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:54,433 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:54,433 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:54,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:54,433 INFO L82 PathProgramCache]: Analyzing trace with hash 868694479, now seen corresponding path program 1 times [2018-12-03 01:47:54,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:54,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:54,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:54,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:54,435 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:54,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:54,534 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-03 01:47:54,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:54,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-03 01:47:54,535 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:54,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 01:47:54,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 01:47:54,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-03 01:47:54,535 INFO L87 Difference]: Start difference. First operand 18317 states and 57195 transitions. Second operand 11 states. [2018-12-03 01:47:55,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:55,523 INFO L93 Difference]: Finished difference Result 31408 states and 97769 transitions. [2018-12-03 01:47:55,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 01:47:55,523 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2018-12-03 01:47:55,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:55,546 INFO L225 Difference]: With dead ends: 31408 [2018-12-03 01:47:55,546 INFO L226 Difference]: Without dead ends: 21812 [2018-12-03 01:47:55,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-12-03 01:47:55,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21812 states. [2018-12-03 01:47:55,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21812 to 18647. [2018-12-03 01:47:55,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18647 states. [2018-12-03 01:47:55,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18647 states to 18647 states and 57939 transitions. [2018-12-03 01:47:55,777 INFO L78 Accepts]: Start accepts. Automaton has 18647 states and 57939 transitions. Word has length 96 [2018-12-03 01:47:55,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:55,777 INFO L480 AbstractCegarLoop]: Abstraction has 18647 states and 57939 transitions. [2018-12-03 01:47:55,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 01:47:55,777 INFO L276 IsEmpty]: Start isEmpty. Operand 18647 states and 57939 transitions. [2018-12-03 01:47:55,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 01:47:55,794 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:55,794 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:55,794 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:55,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:55,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1477933554, now seen corresponding path program 1 times [2018-12-03 01:47:55,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:55,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:55,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:55,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:55,796 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:55,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:55,864 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-03 01:47:55,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:55,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 01:47:55,864 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:55,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 01:47:55,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 01:47:55,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-03 01:47:55,864 INFO L87 Difference]: Start difference. First operand 18647 states and 57939 transitions. Second operand 7 states. [2018-12-03 01:47:56,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:56,286 INFO L93 Difference]: Finished difference Result 26000 states and 79822 transitions. [2018-12-03 01:47:56,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 01:47:56,286 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-03 01:47:56,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:56,313 INFO L225 Difference]: With dead ends: 26000 [2018-12-03 01:47:56,313 INFO L226 Difference]: Without dead ends: 25320 [2018-12-03 01:47:56,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-03 01:47:56,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25320 states. [2018-12-03 01:47:56,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25320 to 19167. [2018-12-03 01:47:56,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19167 states. [2018-12-03 01:47:56,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19167 states to 19167 states and 58870 transitions. [2018-12-03 01:47:56,528 INFO L78 Accepts]: Start accepts. Automaton has 19167 states and 58870 transitions. Word has length 96 [2018-12-03 01:47:56,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:56,528 INFO L480 AbstractCegarLoop]: Abstraction has 19167 states and 58870 transitions. [2018-12-03 01:47:56,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 01:47:56,528 INFO L276 IsEmpty]: Start isEmpty. Operand 19167 states and 58870 transitions. [2018-12-03 01:47:56,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 01:47:56,544 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:56,544 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:56,544 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:56,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:56,544 INFO L82 PathProgramCache]: Analyzing trace with hash 739824399, now seen corresponding path program 2 times [2018-12-03 01:47:56,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:56,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:56,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:56,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:56,545 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:56,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:56,640 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-03 01:47:56,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:56,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-03 01:47:56,640 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:56,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 01:47:56,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 01:47:56,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-03 01:47:56,641 INFO L87 Difference]: Start difference. First operand 19167 states and 58870 transitions. Second operand 10 states. [2018-12-03 01:47:57,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:57,171 INFO L93 Difference]: Finished difference Result 35587 states and 108845 transitions. [2018-12-03 01:47:57,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 01:47:57,171 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2018-12-03 01:47:57,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:57,189 INFO L225 Difference]: With dead ends: 35587 [2018-12-03 01:47:57,189 INFO L226 Difference]: Without dead ends: 17179 [2018-12-03 01:47:57,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-12-03 01:47:57,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17179 states. [2018-12-03 01:47:57,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17179 to 17179. [2018-12-03 01:47:57,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17179 states. [2018-12-03 01:47:57,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17179 states to 17179 states and 52498 transitions. [2018-12-03 01:47:57,360 INFO L78 Accepts]: Start accepts. Automaton has 17179 states and 52498 transitions. Word has length 96 [2018-12-03 01:47:57,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:57,360 INFO L480 AbstractCegarLoop]: Abstraction has 17179 states and 52498 transitions. [2018-12-03 01:47:57,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 01:47:57,360 INFO L276 IsEmpty]: Start isEmpty. Operand 17179 states and 52498 transitions. [2018-12-03 01:47:57,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 01:47:57,376 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:57,376 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:57,376 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:57,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:57,376 INFO L82 PathProgramCache]: Analyzing trace with hash -5061991, now seen corresponding path program 3 times [2018-12-03 01:47:57,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:57,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:57,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 01:47:57,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:57,377 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:57,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:57,461 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-03 01:47:57,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:57,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-03 01:47:57,462 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:57,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 01:47:57,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 01:47:57,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-03 01:47:57,463 INFO L87 Difference]: Start difference. First operand 17179 states and 52498 transitions. Second operand 10 states. [2018-12-03 01:47:57,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:57,883 INFO L93 Difference]: Finished difference Result 30297 states and 92556 transitions. [2018-12-03 01:47:57,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 01:47:57,883 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2018-12-03 01:47:57,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:57,895 INFO L225 Difference]: With dead ends: 30297 [2018-12-03 01:47:57,895 INFO L226 Difference]: Without dead ends: 11301 [2018-12-03 01:47:57,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2018-12-03 01:47:57,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11301 states. [2018-12-03 01:47:57,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11301 to 11301. [2018-12-03 01:47:57,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11301 states. [2018-12-03 01:47:58,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11301 states to 11301 states and 34527 transitions. [2018-12-03 01:47:58,003 INFO L78 Accepts]: Start accepts. Automaton has 11301 states and 34527 transitions. Word has length 96 [2018-12-03 01:47:58,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:58,004 INFO L480 AbstractCegarLoop]: Abstraction has 11301 states and 34527 transitions. [2018-12-03 01:47:58,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 01:47:58,004 INFO L276 IsEmpty]: Start isEmpty. Operand 11301 states and 34527 transitions. [2018-12-03 01:47:58,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 01:47:58,014 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:58,014 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:58,014 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:58,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:58,014 INFO L82 PathProgramCache]: Analyzing trace with hash 272721815, now seen corresponding path program 4 times [2018-12-03 01:47:58,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:58,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:58,015 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 01:47:58,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:58,015 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:58,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:47:58,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:47:58,070 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-03 01:47:58,150 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-03 01:47:58,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 01:47:58 BasicIcfg [2018-12-03 01:47:58,151 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 01:47:58,151 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 01:47:58,151 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 01:47:58,151 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 01:47:58,152 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:45:55" (3/4) ... [2018-12-03 01:47:58,154 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-03 01:47:58,230 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f056aa3d-21f4-4729-b96e-0d4a154cf0cb/bin-2019/utaipan/witness.graphml [2018-12-03 01:47:58,230 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 01:47:58,231 INFO L168 Benchmark]: Toolchain (without parser) took 123931.51 ms. Allocated memory was 1.0 GB in the beginning and 7.8 GB in the end (delta: 6.8 GB). Free memory was 947.0 MB in the beginning and 5.3 GB in the end (delta: -4.3 GB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. [2018-12-03 01:47:58,232 INFO L168 Benchmark]: CDTParser took 0.16 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-03 01:47:58,232 INFO L168 Benchmark]: CACSL2BoogieTranslator took 339.57 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -131.7 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. [2018-12-03 01:47:58,232 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.41 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-03 01:47:58,232 INFO L168 Benchmark]: Boogie Preprocessor took 19.34 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-03 01:47:58,233 INFO L168 Benchmark]: RCFGBuilder took 342.01 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: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. [2018-12-03 01:47:58,233 INFO L168 Benchmark]: TraceAbstraction took 123117.04 ms. Allocated memory was 1.1 GB in the beginning and 7.8 GB in the end (delta: 6.7 GB). Free memory was 1.0 GB in the beginning and 5.3 GB in the end (delta: -4.3 GB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. [2018-12-03 01:47:58,233 INFO L168 Benchmark]: Witness Printer took 79.48 ms. Allocated memory is still 7.8 GB. Free memory was 5.3 GB in the beginning and 5.3 GB in the end (delta: 37.0 MB). Peak memory consumption was 37.0 MB. Max. memory is 11.5 GB. [2018-12-03 01:47:58,234 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.16 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 339.57 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -131.7 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.41 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 19.34 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 342.01 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: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 123117.04 ms. Allocated memory was 1.1 GB in the beginning and 7.8 GB in the end (delta: 6.7 GB). Free memory was 1.0 GB in the beginning and 5.3 GB in the end (delta: -4.3 GB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. * Witness Printer took 79.48 ms. Allocated memory is still 7.8 GB. Free memory was 5.3 GB in the beginning and 5.3 GB in the end (delta: 37.0 MB). Peak memory consumption was 37.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L678] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L680] -1 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0] [L682] -1 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L684] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L686] -1 int b = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0] [L687] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0] [L688] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0] [L690] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L692] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L694] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L695] -1 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L696] -1 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L697] -1 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L698] -1 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L699] -1 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L700] -1 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L701] -1 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0] [L702] -1 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L703] -1 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L704] -1 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L705] -1 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L706] -1 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L707] -1 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L708] -1 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L709] -1 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L710] -1 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L711] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L712] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L808] -1 pthread_t t866; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L809] FCALL, FORK -1 pthread_create(&t866, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L810] -1 pthread_t t867; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L811] FCALL, FORK -1 pthread_create(&t867, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L812] -1 pthread_t t868; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L813] FCALL, FORK -1 pthread_create(&t868, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L765] 0 z$w_buff1 = z$w_buff0 [L766] 0 z$w_buff0 = 1 [L767] 0 z$w_buff1_used = z$w_buff0_used [L768] 0 z$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 0 z$r_buff1_thd0 = z$r_buff0_thd0 [L771] 0 z$r_buff1_thd1 = z$r_buff0_thd1 [L772] 0 z$r_buff1_thd2 = z$r_buff0_thd2 [L773] 0 z$r_buff1_thd3 = z$r_buff0_thd3 [L774] 0 z$r_buff0_thd3 = (_Bool)1 [L777] 0 a = 1 [L780] 0 __unbuffered_p2_EAX = a [L783] 0 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L716] 1 b = 1 [L719] 1 __unbuffered_p0_EAX = x [L724] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L731] 2 x = 1 [L734] 2 y = 1 [L737] 2 __unbuffered_p1_EAX = y [L740] 2 weak$$choice0 = __VERIFIER_nondet_pointer() [L741] 2 weak$$choice2 = __VERIFIER_nondet_pointer() [L742] 2 z$flush_delayed = weak$$choice2 [L743] 2 z$mem_tmp = z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L745] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L745] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L746] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L746] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L747] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L747] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L748] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L749] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L749] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L750] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L751] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] EXPR 2 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] 0 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L787] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 2 z = z$flush_delayed ? z$mem_tmp : z [L753] 2 z$flush_delayed = (_Bool)0 [L758] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L788] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L788] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L789] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 0 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L790] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L790] 0 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L793] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L815] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L819] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L819] EXPR -1 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L819] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L819] -1 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L820] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L820] -1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L821] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L821] -1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L822] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L822] -1 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L823] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L823] -1 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L826] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 222 locations, 3 error locations. UNSAFE Result, 123.0s OverallTime, 28 OverallIterations, 1 TraceHistogramMax, 33.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8029 SDtfs, 10520 SDslu, 20168 SDs, 0 SdLazy, 7957 SolverSat, 426 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 280 GetRequests, 75 SyntacticMatches, 18 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=308623occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 66.9s AutomataMinimizationTime, 27 MinimizatonAttempts, 572787 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 2159 NumberOfCodeBlocks, 2159 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 2036 ConstructedInterpolants, 0 QuantifiedInterpolants, 409617 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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...